/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_3-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:16:01,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:16:01,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:16:01,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:16:01,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:16:01,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:16:01,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:16:01,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:16:01,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:16:01,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:16:01,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:16:01,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:16:01,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:16:01,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:16:01,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:16:01,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:16:01,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:16:01,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:16:01,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:16:01,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:16:01,173 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:16:01,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:16:01,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:16:01,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:16:01,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:16:01,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:16:01,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:16:01,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:16:01,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:16:01,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:16:01,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:16:01,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:16:01,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:16:01,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:16:01,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:16:01,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:16:01,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:16:01,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:16:01,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:16:01,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:16:01,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:16:01,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:16:01,182 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:01,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:16:01,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:16:01,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:16:01,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:16:01,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:16:01,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:16:01,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:16:01,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:16:01,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:16:01,188 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:16:01,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:16:01,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:16:01,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:16:01,189 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:16:01,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:16:01,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:16:01,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:16:01,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:16:01,189 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:16:01,189 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:16:01,189 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:16:01,189 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:16:01,189 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:01,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:16:01,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:16:01,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:16:01,400 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:16:01,401 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:16:01,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_3-2.i [2022-04-15 12:16:01,456 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ff9c004/d12aa98c81f647949d567bb4145048b5/FLAG9d28264d1 [2022-04-15 12:16:01,788 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:16:01,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-2.i [2022-04-15 12:16:01,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ff9c004/d12aa98c81f647949d567bb4145048b5/FLAG9d28264d1 [2022-04-15 12:16:02,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ff9c004/d12aa98c81f647949d567bb4145048b5 [2022-04-15 12:16:02,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:16:02,231 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:16:02,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:16:02,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:16:02,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:16:02,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:16:02" (1/1) ... [2022-04-15 12:16:02,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29780617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:02, skipping insertion in model container [2022-04-15 12:16:02,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:16:02" (1/1) ... [2022-04-15 12:16:02,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:16:02,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:16:02,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-2.i[809,822] [2022-04-15 12:16:02,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:16:02,417 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:16:02,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-2.i[809,822] [2022-04-15 12:16:02,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:16:02,437 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:16:02,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:02 WrapperNode [2022-04-15 12:16:02,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:16:02,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:16:02,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:16:02,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:16:02,447 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:02" (1/1) ... [2022-04-15 12:16:02,448 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:02" (1/1) ... [2022-04-15 12:16:02,453 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:02" (1/1) ... [2022-04-15 12:16:02,454 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:02" (1/1) ... [2022-04-15 12:16:02,465 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:02" (1/1) ... [2022-04-15 12:16:02,469 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:02" (1/1) ... [2022-04-15 12:16:02,470 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:02" (1/1) ... [2022-04-15 12:16:02,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:16:02,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:16:02,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:16:02,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:16:02,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:02" (1/1) ... [2022-04-15 12:16:02,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:16:02,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:02,496 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:02,499 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:02,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:16:02,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:16:02,520 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:16:02,521 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:16:02,521 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:16:02,521 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:16:02,521 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:16:02,521 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:16:02,521 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:16:02,521 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:16:02,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:16:02,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:16:02,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:16:02,521 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:16:02,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 12:16:02,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:16:02,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:16:02,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:16:02,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:16:02,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:16:02,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:16:02,569 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:16:02,570 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:16:02,667 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:16:02,671 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:16:02,671 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:16:02,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:16:02 BoogieIcfgContainer [2022-04-15 12:16:02,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:16:02,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:16:02,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:16:02,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:16:02,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:16:02" (1/3) ... [2022-04-15 12:16:02,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603ec119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:16:02, skipping insertion in model container [2022-04-15 12:16:02,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:02" (2/3) ... [2022-04-15 12:16:02,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603ec119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:16:02, skipping insertion in model container [2022-04-15 12:16:02,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:16:02" (3/3) ... [2022-04-15 12:16:02,684 INFO L111 eAbstractionObserver]: Analyzing ICFG array_3-2.i [2022-04-15 12:16:02,691 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:16:02,692 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:16:02,722 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:16:02,726 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:02,727 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:16:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:16:02,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:16:02,761 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:02,761 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:02,762 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:02,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:02,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1368365270, now seen corresponding path program 1 times [2022-04-15 12:16:02,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:02,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [183201775] [2022-04-15 12:16:02,786 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:16:02,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1368365270, now seen corresponding path program 2 times [2022-04-15 12:16:02,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:02,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787623067] [2022-04-15 12:16:02,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:02,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:02,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:02,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {28#true} is VALID [2022-04-15 12:16:02,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 12:16:02,991 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #64#return; {28#true} is VALID [2022-04-15 12:16:02,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:02,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {28#true} is VALID [2022-04-15 12:16:02,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 12:16:02,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #64#return; {28#true} is VALID [2022-04-15 12:16:02,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret6 := main(); {28#true} is VALID [2022-04-15 12:16:02,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28#true} is VALID [2022-04-15 12:16:02,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-15 12:16:02,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0 := 0; {29#false} is VALID [2022-04-15 12:16:02,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume !true; {29#false} is VALID [2022-04-15 12:16:02,999 INFO L272 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {29#false} is VALID [2022-04-15 12:16:02,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-15 12:16:02,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-15 12:16:03,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-15 12:16:03,000 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:03,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:03,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787623067] [2022-04-15 12:16:03,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787623067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:03,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:03,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:16:03,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:03,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [183201775] [2022-04-15 12:16:03,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [183201775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:03,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:03,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:16:03,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350418966] [2022-04-15 12:16:03,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:03,009 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:03,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:03,012 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:03,033 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:03,033 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:16:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:03,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:16:03,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:16:03,054 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:03,135 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-15 12:16:03,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:16:03,135 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:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:03,137 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:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-15 12:16:03,144 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:03,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-15 12:16:03,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-04-15 12:16:03,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:03,211 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:16:03,211 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:16:03,213 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:03,216 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:03,217 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:16:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 12:16:03,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:03,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,240 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,240 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:03,241 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 12:16:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 12:16:03,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:03,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:03,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 12:16:03,242 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 12:16:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:03,243 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 12:16:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 12:16:03,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:03,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:03,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:03,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 12:16:03,247 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2022-04-15 12:16:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:03,248 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 12:16:03,249 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:03,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 12:16:03,271 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:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 12:16:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:16:03,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:03,274 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:03,274 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:16:03,274 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:03,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1606867655, now seen corresponding path program 1 times [2022-04-15 12:16:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:03,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [996466750] [2022-04-15 12:16:03,278 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:16:03,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1606867655, now seen corresponding path program 2 times [2022-04-15 12:16:03,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:03,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546580196] [2022-04-15 12:16:03,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:03,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:03,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:03,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {192#true} is VALID [2022-04-15 12:16:03,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#true} assume true; {192#true} is VALID [2022-04-15 12:16:03,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {192#true} {192#true} #64#return; {192#true} is VALID [2022-04-15 12:16:03,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {192#true} call ULTIMATE.init(); {198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:03,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {192#true} is VALID [2022-04-15 12:16:03,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {192#true} assume true; {192#true} is VALID [2022-04-15 12:16:03,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192#true} {192#true} #64#return; {192#true} is VALID [2022-04-15 12:16:03,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {192#true} call #t~ret6 := main(); {192#true} is VALID [2022-04-15 12:16:03,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {192#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {197#(= main_~i~0 0)} is VALID [2022-04-15 12:16:03,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#(= main_~i~0 0)} assume !(~i~0 < 1024); {193#false} is VALID [2022-04-15 12:16:03,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {193#false} ~i~0 := 0; {193#false} is VALID [2022-04-15 12:16:03,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#false} #t~short5 := ~i~0 < 1024; {193#false} is VALID [2022-04-15 12:16:03,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {193#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {193#false} is VALID [2022-04-15 12:16:03,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {193#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {193#false} is VALID [2022-04-15 12:16:03,354 INFO L272 TraceCheckUtils]: 11: Hoare triple {193#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {193#false} is VALID [2022-04-15 12:16:03,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {193#false} ~cond := #in~cond; {193#false} is VALID [2022-04-15 12:16:03,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {193#false} assume 0 == ~cond; {193#false} is VALID [2022-04-15 12:16:03,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {193#false} assume !false; {193#false} is VALID [2022-04-15 12:16:03,355 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:03,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:03,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546580196] [2022-04-15 12:16:03,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546580196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:03,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:03,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:03,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:03,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [996466750] [2022-04-15 12:16:03,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [996466750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:03,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:03,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:03,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354957489] [2022-04-15 12:16:03,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:03,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:16:03,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:03,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:03,374 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:16:03,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:03,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:16:03,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:16:03,375 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:03,458 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 12:16:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:16:03,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:16:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-15 12:16:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-15 12:16:03,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-15 12:16:03,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:03,498 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:16:03,498 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:16:03,498 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:03,500 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:03,500 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 22 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:16:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-04-15 12:16:03,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:03,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,511 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,511 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:03,513 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 12:16:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 12:16:03,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:03,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:03,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:16:03,513 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:16:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:03,515 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 12:16:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 12:16:03,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:03,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:03,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:03,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 12:16:03,517 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-15 12:16:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:03,517 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 12:16:03,518 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 12:16:03,546 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:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:16:03,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:16:03,546 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:03,546 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:03,546 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:16:03,547 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:03,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:03,547 INFO L85 PathProgramCache]: Analyzing trace with hash 41653477, now seen corresponding path program 1 times [2022-04-15 12:16:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:03,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1541200256] [2022-04-15 12:16:03,557 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:03,557 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:03,557 INFO L85 PathProgramCache]: Analyzing trace with hash 41653477, now seen corresponding path program 2 times [2022-04-15 12:16:03,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:03,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945035952] [2022-04-15 12:16:03,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:03,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:03,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:03,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {361#true} is VALID [2022-04-15 12:16:03,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-15 12:16:03,604 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {361#true} {361#true} #64#return; {361#true} is VALID [2022-04-15 12:16:03,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {368#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:03,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {361#true} is VALID [2022-04-15 12:16:03,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-15 12:16:03,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #64#return; {361#true} is VALID [2022-04-15 12:16:03,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret6 := main(); {361#true} is VALID [2022-04-15 12:16:03,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {366#(= main_~i~0 0)} is VALID [2022-04-15 12:16:03,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {366#(= main_~i~0 0)} is VALID [2022-04-15 12:16:03,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {366#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {367#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:03,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {367#(<= main_~i~0 1)} assume !(~i~0 < 1024); {362#false} is VALID [2022-04-15 12:16:03,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#false} ~i~0 := 0; {362#false} is VALID [2022-04-15 12:16:03,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {362#false} #t~short5 := ~i~0 < 1024; {362#false} is VALID [2022-04-15 12:16:03,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {362#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {362#false} is VALID [2022-04-15 12:16:03,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {362#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {362#false} is VALID [2022-04-15 12:16:03,611 INFO L272 TraceCheckUtils]: 13: Hoare triple {362#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {362#false} is VALID [2022-04-15 12:16:03,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {362#false} ~cond := #in~cond; {362#false} is VALID [2022-04-15 12:16:03,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {362#false} assume 0 == ~cond; {362#false} is VALID [2022-04-15 12:16:03,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-15 12:16:03,612 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:03,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:03,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945035952] [2022-04-15 12:16:03,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945035952] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:03,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131411763] [2022-04-15 12:16:03,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:03,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:03,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:03,614 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:03,615 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:03,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 12:16:03,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:03,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:16:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:03,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:03,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2022-04-15 12:16:03,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {361#true} is VALID [2022-04-15 12:16:03,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-15 12:16:03,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #64#return; {361#true} is VALID [2022-04-15 12:16:03,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret6 := main(); {361#true} is VALID [2022-04-15 12:16:03,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {361#true} is VALID [2022-04-15 12:16:03,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {361#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {361#true} is VALID [2022-04-15 12:16:03,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {361#true} is VALID [2022-04-15 12:16:03,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {361#true} assume !(~i~0 < 1024); {361#true} is VALID [2022-04-15 12:16:03,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#true} ~i~0 := 0; {399#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:03,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {399#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {399#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:03,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {399#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {399#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:03,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {399#(<= main_~i~0 0)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {399#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:03,814 INFO L272 TraceCheckUtils]: 13: Hoare triple {399#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:03,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:03,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {362#false} is VALID [2022-04-15 12:16:03,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-15 12:16:03,815 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:03,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 12:16:03,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131411763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:03,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 12:16:03,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-15 12:16:03,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:03,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1541200256] [2022-04-15 12:16:03,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1541200256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:03,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:03,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:16:03,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589232463] [2022-04-15 12:16:03,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:03,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:16:03,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:03,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:03,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:16:03,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:03,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:16:03,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:16:03,832 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:03,924 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 12:16:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:16:03,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:16:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 12:16:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 12:16:03,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 12:16:03,951 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:03,953 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:16:03,953 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 12:16:03,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:16:03,955 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:03,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:03,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 12:16:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-04-15 12:16:03,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:03,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,969 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,969 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:03,974 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 12:16:03,974 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 12:16:03,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:03,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:03,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:16:03,975 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:16:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:03,976 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 12:16:03,976 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 12:16:03,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:03,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:03,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:03,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-15 12:16:03,979 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2022-04-15 12:16:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:03,980 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-15 12:16:03,980 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:03,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 25 transitions. [2022-04-15 12:16:04,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-15 12:16:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:16:04,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:04,003 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:04,023 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:04,215 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:04,216 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:04,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:04,216 INFO L85 PathProgramCache]: Analyzing trace with hash -62255392, now seen corresponding path program 1 times [2022-04-15 12:16:04,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:04,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1092154600] [2022-04-15 12:16:04,223 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:04,223 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:04,223 INFO L85 PathProgramCache]: Analyzing trace with hash -62255392, now seen corresponding path program 2 times [2022-04-15 12:16:04,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:04,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480601641] [2022-04-15 12:16:04,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:04,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:04,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:04,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {581#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {574#true} is VALID [2022-04-15 12:16:04,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-15 12:16:04,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {574#true} {574#true} #64#return; {574#true} is VALID [2022-04-15 12:16:04,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {581#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:04,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {581#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {574#true} is VALID [2022-04-15 12:16:04,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-15 12:16:04,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574#true} {574#true} #64#return; {574#true} is VALID [2022-04-15 12:16:04,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {574#true} call #t~ret6 := main(); {574#true} is VALID [2022-04-15 12:16:04,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {579#(= main_~i~0 0)} is VALID [2022-04-15 12:16:04,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {579#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {579#(= main_~i~0 0)} is VALID [2022-04-15 12:16:04,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {579#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {580#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:04,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#(<= main_~i~0 1)} assume !(~i~0 < 1024); {575#false} is VALID [2022-04-15 12:16:04,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#false} ~i~0 := 0; {575#false} is VALID [2022-04-15 12:16:04,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-15 12:16:04,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-15 12:16:04,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-15 12:16:04,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {575#false} is VALID [2022-04-15 12:16:04,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-15 12:16:04,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-15 12:16:04,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {575#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-15 12:16:04,267 INFO L272 TraceCheckUtils]: 17: Hoare triple {575#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {575#false} is VALID [2022-04-15 12:16:04,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {575#false} ~cond := #in~cond; {575#false} is VALID [2022-04-15 12:16:04,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {575#false} assume 0 == ~cond; {575#false} is VALID [2022-04-15 12:16:04,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {575#false} assume !false; {575#false} is VALID [2022-04-15 12:16:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:16:04,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:04,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480601641] [2022-04-15 12:16:04,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480601641] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:04,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000201102] [2022-04-15 12:16:04,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:04,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:04,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:04,273 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:04,274 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:04,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:04,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:04,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 12:16:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:04,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:04,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {574#true} is VALID [2022-04-15 12:16:04,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {574#true} is VALID [2022-04-15 12:16:04,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-15 12:16:04,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574#true} {574#true} #64#return; {574#true} is VALID [2022-04-15 12:16:04,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {574#true} call #t~ret6 := main(); {574#true} is VALID [2022-04-15 12:16:04,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {600#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:04,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {600#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {600#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:04,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {600#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {580#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:04,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#(<= main_~i~0 1)} assume !(~i~0 < 1024); {575#false} is VALID [2022-04-15 12:16:04,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#false} ~i~0 := 0; {575#false} is VALID [2022-04-15 12:16:04,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-15 12:16:04,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-15 12:16:04,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-15 12:16:04,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {575#false} is VALID [2022-04-15 12:16:04,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-15 12:16:04,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-15 12:16:04,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {575#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-15 12:16:04,375 INFO L272 TraceCheckUtils]: 17: Hoare triple {575#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {575#false} is VALID [2022-04-15 12:16:04,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {575#false} ~cond := #in~cond; {575#false} is VALID [2022-04-15 12:16:04,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {575#false} assume 0 == ~cond; {575#false} is VALID [2022-04-15 12:16:04,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {575#false} assume !false; {575#false} is VALID [2022-04-15 12:16:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:16:04,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:04,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {575#false} assume !false; {575#false} is VALID [2022-04-15 12:16:04,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {575#false} assume 0 == ~cond; {575#false} is VALID [2022-04-15 12:16:04,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {575#false} ~cond := #in~cond; {575#false} is VALID [2022-04-15 12:16:04,444 INFO L272 TraceCheckUtils]: 17: Hoare triple {575#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {575#false} is VALID [2022-04-15 12:16:04,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {575#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-15 12:16:04,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-15 12:16:04,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-15 12:16:04,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {575#false} is VALID [2022-04-15 12:16:04,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-15 12:16:04,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-15 12:16:04,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-15 12:16:04,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#false} ~i~0 := 0; {575#false} is VALID [2022-04-15 12:16:04,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#(< main_~i~0 1024)} assume !(~i~0 < 1024); {575#false} is VALID [2022-04-15 12:16:04,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {682#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:04,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {686#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {686#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:04,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {686#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:04,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {574#true} call #t~ret6 := main(); {574#true} is VALID [2022-04-15 12:16:04,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574#true} {574#true} #64#return; {574#true} is VALID [2022-04-15 12:16:04,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-15 12:16:04,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {574#true} is VALID [2022-04-15 12:16:04,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {574#true} is VALID [2022-04-15 12:16:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:16:04,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000201102] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:04,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:04,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 12:16:04,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:04,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1092154600] [2022-04-15 12:16:04,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1092154600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:04,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:04,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:16:04,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984125470] [2022-04-15 12:16:04,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:04,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:16:04,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:04,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:04,470 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:04,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:16:04,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:04,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:16:04,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:16:04,471 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:04,588 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-15 12:16:04,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:16:04,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:16:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 12:16:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 12:16:04,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-15 12:16:04,637 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:04,638 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:16:04,638 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:16:04,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:16:04,639 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:04,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:04,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:16:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-04-15 12:16:04,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:04,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:04,649 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:04,649 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:04,651 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 12:16:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-15 12:16:04,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:04,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:04,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:16:04,651 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:16:04,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:04,652 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 12:16:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-15 12:16:04,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:04,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:04,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:04,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-15 12:16:04,654 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 21 [2022-04-15 12:16:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:04,654 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-15 12:16:04,654 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:04,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-15 12:16:04,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 12:16:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:16:04,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:04,675 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:04,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 12:16:04,893 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:04,894 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:04,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:04,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1107704446, now seen corresponding path program 3 times [2022-04-15 12:16:04,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:04,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1434675592] [2022-04-15 12:16:04,899 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:04,899 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:04,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1107704446, now seen corresponding path program 4 times [2022-04-15 12:16:04,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:04,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163956353] [2022-04-15 12:16:04,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:04,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:04,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:04,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {912#true} is VALID [2022-04-15 12:16:04,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 12:16:04,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {912#true} #64#return; {912#true} is VALID [2022-04-15 12:16:04,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:04,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {912#true} is VALID [2022-04-15 12:16:04,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 12:16:04,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #64#return; {912#true} is VALID [2022-04-15 12:16:04,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret6 := main(); {912#true} is VALID [2022-04-15 12:16:04,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {912#true} is VALID [2022-04-15 12:16:04,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {912#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {912#true} is VALID [2022-04-15 12:16:04,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {912#true} is VALID [2022-04-15 12:16:04,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {912#true} is VALID [2022-04-15 12:16:04,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {912#true} is VALID [2022-04-15 12:16:04,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {912#true} assume !(~i~0 < 1024); {912#true} is VALID [2022-04-15 12:16:04,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#true} ~i~0 := 0; {917#(= main_~i~0 0)} is VALID [2022-04-15 12:16:04,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {917#(= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {917#(= main_~i~0 0)} is VALID [2022-04-15 12:16:04,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {917#(= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {917#(= main_~i~0 0)} is VALID [2022-04-15 12:16:04,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {917#(= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {917#(= main_~i~0 0)} is VALID [2022-04-15 12:16:04,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {917#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {918#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:04,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {918#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {918#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:04,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {918#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {918#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:04,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {918#(<= main_~i~0 1)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {918#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:04,974 INFO L272 TraceCheckUtils]: 19: Hoare triple {918#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {919#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:16:04,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {919#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {920#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:16:04,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {920#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {913#false} is VALID [2022-04-15 12:16:04,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-15 12:16:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:16:04,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:04,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163956353] [2022-04-15 12:16:04,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163956353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:04,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836814300] [2022-04-15 12:16:04,977 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:04,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:04,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:04,978 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:04,980 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:05,020 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:05,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:05,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:16:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:05,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:05,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {912#true} is VALID [2022-04-15 12:16:05,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {912#true} is VALID [2022-04-15 12:16:05,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 12:16:05,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #64#return; {912#true} is VALID [2022-04-15 12:16:05,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret6 := main(); {912#true} is VALID [2022-04-15 12:16:05,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {940#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:05,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {940#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {940#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:05,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {940#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {918#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:05,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {918#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {918#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:05,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {918#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {953#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:05,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {953#(<= main_~i~0 2)} assume !(~i~0 < 1024); {913#false} is VALID [2022-04-15 12:16:05,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#false} ~i~0 := 0; {913#false} is VALID [2022-04-15 12:16:05,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#false} #t~short5 := ~i~0 < 1024; {913#false} is VALID [2022-04-15 12:16:05,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {913#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {913#false} is VALID [2022-04-15 12:16:05,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {913#false} is VALID [2022-04-15 12:16:05,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {913#false} is VALID [2022-04-15 12:16:05,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {913#false} #t~short5 := ~i~0 < 1024; {913#false} is VALID [2022-04-15 12:16:05,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {913#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {913#false} is VALID [2022-04-15 12:16:05,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {913#false} is VALID [2022-04-15 12:16:05,106 INFO L272 TraceCheckUtils]: 19: Hoare triple {913#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {913#false} is VALID [2022-04-15 12:16:05,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {913#false} ~cond := #in~cond; {913#false} is VALID [2022-04-15 12:16:05,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {913#false} assume 0 == ~cond; {913#false} is VALID [2022-04-15 12:16:05,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-15 12:16:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:16:05,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:05,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-15 12:16:05,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {913#false} assume 0 == ~cond; {913#false} is VALID [2022-04-15 12:16:05,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {913#false} ~cond := #in~cond; {913#false} is VALID [2022-04-15 12:16:05,210 INFO L272 TraceCheckUtils]: 19: Hoare triple {913#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {913#false} is VALID [2022-04-15 12:16:05,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {913#false} is VALID [2022-04-15 12:16:05,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {913#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {913#false} is VALID [2022-04-15 12:16:05,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {913#false} #t~short5 := ~i~0 < 1024; {913#false} is VALID [2022-04-15 12:16:05,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {913#false} is VALID [2022-04-15 12:16:05,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {913#false} is VALID [2022-04-15 12:16:05,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {913#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {913#false} is VALID [2022-04-15 12:16:05,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#false} #t~short5 := ~i~0 < 1024; {913#false} is VALID [2022-04-15 12:16:05,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#false} ~i~0 := 0; {913#false} is VALID [2022-04-15 12:16:05,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {1029#(< main_~i~0 1024)} assume !(~i~0 < 1024); {913#false} is VALID [2022-04-15 12:16:05,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {1033#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1029#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:05,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {1033#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1033#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:05,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {1040#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1033#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:05,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {1040#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1040#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:05,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1040#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:05,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret6 := main(); {912#true} is VALID [2022-04-15 12:16:05,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #64#return; {912#true} is VALID [2022-04-15 12:16:05,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 12:16:05,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {912#true} is VALID [2022-04-15 12:16:05,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {912#true} is VALID [2022-04-15 12:16:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:16:05,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836814300] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:05,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:05,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-04-15 12:16:05,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:05,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1434675592] [2022-04-15 12:16:05,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1434675592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:05,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:05,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:16:05,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503829706] [2022-04-15 12:16:05,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:05,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:16:05,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:05,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:05,232 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:05,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:16:05,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:05,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:16:05,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:16:05,233 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:05,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:05,379 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 12:16:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:16:05,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:16:05,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-15 12:16:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-15 12:16:05,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2022-04-15 12:16:05,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:05,426 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:16:05,426 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:16:05,426 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:16:05,427 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:05,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 36 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:16:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-04-15 12:16:05,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:05,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:05,439 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:05,439 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:05,440 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 12:16:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 12:16:05,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:05,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:05,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 12:16:05,440 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 12:16:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:05,441 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 12:16:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 12:16:05,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:05,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:05,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:05,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-15 12:16:05,442 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2022-04-15 12:16:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:05,443 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-15 12:16:05,443 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:05,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-15 12:16:05,465 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:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-15 12:16:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:16:05,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:05,466 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:05,491 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:05,675 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:05,675 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:05,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:05,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2073673735, now seen corresponding path program 5 times [2022-04-15 12:16:05,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:05,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2071557144] [2022-04-15 12:16:05,681 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:05,681 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:05,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2073673735, now seen corresponding path program 6 times [2022-04-15 12:16:05,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:05,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660258598] [2022-04-15 12:16:05,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:05,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:05,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:05,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {1268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1260#true} is VALID [2022-04-15 12:16:05,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-15 12:16:05,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1260#true} {1260#true} #64#return; {1260#true} is VALID [2022-04-15 12:16:05,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:05,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {1268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1260#true} is VALID [2022-04-15 12:16:05,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-15 12:16:05,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #64#return; {1260#true} is VALID [2022-04-15 12:16:05,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret6 := main(); {1260#true} is VALID [2022-04-15 12:16:05,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1265#(= main_~i~0 0)} is VALID [2022-04-15 12:16:05,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {1265#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1265#(= main_~i~0 0)} is VALID [2022-04-15 12:16:05,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {1265#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1266#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:05,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {1266#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1266#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:05,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {1266#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1267#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:05,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {1267#(<= main_~i~0 2)} assume !(~i~0 < 1024); {1261#false} is VALID [2022-04-15 12:16:05,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {1261#false} ~i~0 := 0; {1261#false} is VALID [2022-04-15 12:16:05,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {1261#false} #t~short5 := ~i~0 < 1024; {1261#false} is VALID [2022-04-15 12:16:05,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {1261#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1261#false} is VALID [2022-04-15 12:16:05,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {1261#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1261#false} is VALID [2022-04-15 12:16:05,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {1261#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1261#false} is VALID [2022-04-15 12:16:05,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {1261#false} #t~short5 := ~i~0 < 1024; {1261#false} is VALID [2022-04-15 12:16:05,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {1261#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1261#false} is VALID [2022-04-15 12:16:05,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {1261#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1261#false} is VALID [2022-04-15 12:16:05,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {1261#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1261#false} is VALID [2022-04-15 12:16:05,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {1261#false} #t~short5 := ~i~0 < 1024; {1261#false} is VALID [2022-04-15 12:16:05,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {1261#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1261#false} is VALID [2022-04-15 12:16:05,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {1261#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1261#false} is VALID [2022-04-15 12:16:05,735 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1261#false} is VALID [2022-04-15 12:16:05,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#false} ~cond := #in~cond; {1261#false} is VALID [2022-04-15 12:16:05,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#false} assume 0 == ~cond; {1261#false} is VALID [2022-04-15 12:16:05,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-15 12:16:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:05,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:05,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660258598] [2022-04-15 12:16:05,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660258598] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:05,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371052788] [2022-04-15 12:16:05,735 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:05,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:05,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:05,736 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:05,737 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:05,783 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:16:05,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:05,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:05,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:05,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-15 12:16:05,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1260#true} is VALID [2022-04-15 12:16:05,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-15 12:16:05,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #64#return; {1260#true} is VALID [2022-04-15 12:16:05,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret6 := main(); {1260#true} is VALID [2022-04-15 12:16:05,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1260#true} is VALID [2022-04-15 12:16:05,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {1260#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1260#true} is VALID [2022-04-15 12:16:05,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1260#true} is VALID [2022-04-15 12:16:05,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {1260#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1260#true} is VALID [2022-04-15 12:16:05,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {1260#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1260#true} is VALID [2022-04-15 12:16:05,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {1260#true} assume !(~i~0 < 1024); {1260#true} is VALID [2022-04-15 12:16:05,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {1260#true} ~i~0 := 0; {1305#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:05,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {1305#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {1305#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:05,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {1305#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1305#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:05,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {1305#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1305#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:05,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {1305#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1266#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:05,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {1266#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {1266#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:05,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {1266#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1266#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:05,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {1266#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1266#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:05,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {1266#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1267#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:05,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {1267#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {1267#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:05,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {1267#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1267#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:05,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {1267#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1267#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:05,923 INFO L272 TraceCheckUtils]: 23: Hoare triple {1267#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:05,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {1342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:05,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {1346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1261#false} is VALID [2022-04-15 12:16:05,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-15 12:16:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:16:05,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:06,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-15 12:16:06,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {1346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1261#false} is VALID [2022-04-15 12:16:06,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {1342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:06,088 INFO L272 TraceCheckUtils]: 23: Hoare triple {1362#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:06,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {1362#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1362#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:06,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {1362#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1362#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:06,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {1362#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {1362#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:06,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {1375#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1362#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:06,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {1375#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1375#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:06,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {1375#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1375#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:06,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {1375#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {1375#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:06,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {1388#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1375#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:06,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {1388#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1388#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:06,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {1388#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1388#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:06,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {1388#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {1388#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:06,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {1260#true} ~i~0 := 0; {1388#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:06,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {1260#true} assume !(~i~0 < 1024); {1260#true} is VALID [2022-04-15 12:16:06,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {1260#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1260#true} is VALID [2022-04-15 12:16:06,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {1260#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1260#true} is VALID [2022-04-15 12:16:06,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1260#true} is VALID [2022-04-15 12:16:06,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {1260#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1260#true} is VALID [2022-04-15 12:16:06,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1260#true} is VALID [2022-04-15 12:16:06,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret6 := main(); {1260#true} is VALID [2022-04-15 12:16:06,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #64#return; {1260#true} is VALID [2022-04-15 12:16:06,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-15 12:16:06,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1260#true} is VALID [2022-04-15 12:16:06,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-15 12:16:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:16:06,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371052788] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:06,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:06,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-04-15 12:16:06,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:06,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2071557144] [2022-04-15 12:16:06,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2071557144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:06,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:06,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:16:06,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238008148] [2022-04-15 12:16:06,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:06,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 12:16:06,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:06,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:06,108 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:06,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:16:06,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:06,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:16:06,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:16:06,108 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:06,243 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-04-15 12:16:06,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:16:06,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 12:16:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-15 12:16:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-15 12:16:06,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-15 12:16:06,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:06,284 INFO L225 Difference]: With dead ends: 54 [2022-04-15 12:16:06,284 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 12:16:06,285 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:16:06,286 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:06,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 27 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:06,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 12:16:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-04-15 12:16:06,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:06,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:06,303 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:06,303 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:06,304 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-15 12:16:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-15 12:16:06,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:06,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:06,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 12:16:06,306 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 12:16:06,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:06,307 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-15 12:16:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-15 12:16:06,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:06,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:06,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:06,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:06,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-15 12:16:06,308 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2022-04-15 12:16:06,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:06,308 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-15 12:16:06,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:06,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2022-04-15 12:16:06,330 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:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 12:16:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:16:06,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:06,331 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:06,350 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:06,538 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:06,539 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:06,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:06,539 INFO L85 PathProgramCache]: Analyzing trace with hash -550585065, now seen corresponding path program 7 times [2022-04-15 12:16:06,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:06,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [343876110] [2022-04-15 12:16:06,544 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:06,544 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:06,544 INFO L85 PathProgramCache]: Analyzing trace with hash -550585065, now seen corresponding path program 8 times [2022-04-15 12:16:06,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:06,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233379480] [2022-04-15 12:16:06,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:06,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:06,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:06,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {1693#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1684#true} is VALID [2022-04-15 12:16:06,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {1684#true} assume true; {1684#true} is VALID [2022-04-15 12:16:06,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1684#true} {1684#true} #64#return; {1684#true} is VALID [2022-04-15 12:16:06,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {1684#true} call ULTIMATE.init(); {1693#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:06,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {1693#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1684#true} is VALID [2022-04-15 12:16:06,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {1684#true} assume true; {1684#true} is VALID [2022-04-15 12:16:06,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1684#true} {1684#true} #64#return; {1684#true} is VALID [2022-04-15 12:16:06,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {1684#true} call #t~ret6 := main(); {1684#true} is VALID [2022-04-15 12:16:06,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {1684#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1689#(= main_~i~0 0)} is VALID [2022-04-15 12:16:06,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {1689#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1689#(= main_~i~0 0)} is VALID [2022-04-15 12:16:06,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {1689#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1690#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:06,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {1690#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1690#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:06,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {1690#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1691#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:06,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {1691#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1691#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:06,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {1691#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1692#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:06,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {1692#(<= main_~i~0 3)} assume !(~i~0 < 1024); {1685#false} is VALID [2022-04-15 12:16:06,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#false} ~i~0 := 0; {1685#false} is VALID [2022-04-15 12:16:06,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 12:16:06,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 12:16:06,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 12:16:06,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-15 12:16:06,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 12:16:06,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 12:16:06,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 12:16:06,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-15 12:16:06,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 12:16:06,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 12:16:06,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {1685#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 12:16:06,596 INFO L272 TraceCheckUtils]: 25: Hoare triple {1685#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1685#false} is VALID [2022-04-15 12:16:06,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {1685#false} ~cond := #in~cond; {1685#false} is VALID [2022-04-15 12:16:06,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {1685#false} assume 0 == ~cond; {1685#false} is VALID [2022-04-15 12:16:06,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {1685#false} assume !false; {1685#false} is VALID [2022-04-15 12:16:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:06,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:06,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233379480] [2022-04-15 12:16:06,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233379480] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:06,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587315801] [2022-04-15 12:16:06,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:06,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:06,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:06,598 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:06,599 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:06,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:06,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:06,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 12:16:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:06,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:06,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {1684#true} call ULTIMATE.init(); {1684#true} is VALID [2022-04-15 12:16:06,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {1684#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1684#true} is VALID [2022-04-15 12:16:06,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {1684#true} assume true; {1684#true} is VALID [2022-04-15 12:16:06,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1684#true} {1684#true} #64#return; {1684#true} is VALID [2022-04-15 12:16:06,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {1684#true} call #t~ret6 := main(); {1684#true} is VALID [2022-04-15 12:16:06,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {1684#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1712#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:06,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {1712#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1712#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:06,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {1712#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1690#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:06,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {1690#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1690#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:06,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {1690#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1691#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:06,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {1691#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1691#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:06,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {1691#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1692#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:06,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {1692#(<= main_~i~0 3)} assume !(~i~0 < 1024); {1685#false} is VALID [2022-04-15 12:16:06,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#false} ~i~0 := 0; {1685#false} is VALID [2022-04-15 12:16:06,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 12:16:06,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 12:16:06,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 12:16:06,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-15 12:16:06,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 12:16:06,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 12:16:06,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 12:16:06,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-15 12:16:06,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 12:16:06,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 12:16:06,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {1685#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 12:16:06,731 INFO L272 TraceCheckUtils]: 25: Hoare triple {1685#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1685#false} is VALID [2022-04-15 12:16:06,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {1685#false} ~cond := #in~cond; {1685#false} is VALID [2022-04-15 12:16:06,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {1685#false} assume 0 == ~cond; {1685#false} is VALID [2022-04-15 12:16:06,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {1685#false} assume !false; {1685#false} is VALID [2022-04-15 12:16:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:06,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:06,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {1685#false} assume !false; {1685#false} is VALID [2022-04-15 12:16:06,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {1685#false} assume 0 == ~cond; {1685#false} is VALID [2022-04-15 12:16:06,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {1685#false} ~cond := #in~cond; {1685#false} is VALID [2022-04-15 12:16:06,854 INFO L272 TraceCheckUtils]: 25: Hoare triple {1685#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1685#false} is VALID [2022-04-15 12:16:06,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {1685#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 12:16:06,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 12:16:06,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 12:16:06,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-15 12:16:06,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 12:16:06,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 12:16:06,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 12:16:06,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-15 12:16:06,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 12:16:06,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 12:16:06,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 12:16:06,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#false} ~i~0 := 0; {1685#false} is VALID [2022-04-15 12:16:06,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {1830#(< main_~i~0 1024)} assume !(~i~0 < 1024); {1685#false} is VALID [2022-04-15 12:16:06,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {1834#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1830#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:06,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {1834#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1834#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:06,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {1841#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1834#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:06,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {1841#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1841#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:06,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {1848#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1841#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:06,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {1848#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1848#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:06,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {1684#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1848#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:06,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {1684#true} call #t~ret6 := main(); {1684#true} is VALID [2022-04-15 12:16:06,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1684#true} {1684#true} #64#return; {1684#true} is VALID [2022-04-15 12:16:06,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {1684#true} assume true; {1684#true} is VALID [2022-04-15 12:16:06,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {1684#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {1684#true} is VALID [2022-04-15 12:16:06,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {1684#true} call ULTIMATE.init(); {1684#true} is VALID [2022-04-15 12:16:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:06,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587315801] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:06,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:06,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 12:16:06,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:06,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [343876110] [2022-04-15 12:16:06,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [343876110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:06,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:06,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:16:06,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672783787] [2022-04-15 12:16:06,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:06,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 12:16:06,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:06,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:06,876 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:06,876 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:16:06,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:06,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:16:06,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:16:06,877 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:07,051 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-15 12:16:07,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:16:07,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 12:16:07,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:07,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-15 12:16:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-15 12:16:07,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-15 12:16:07,101 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:16:07,103 INFO L225 Difference]: With dead ends: 61 [2022-04-15 12:16:07,103 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 12:16:07,103 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=138, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:16:07,104 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 67 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:07,104 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 27 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 12:16:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-04-15 12:16:07,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:07,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,127 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,127 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:07,128 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-15 12:16:07,128 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-15 12:16:07,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:07,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:07,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 12:16:07,129 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 12:16:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:07,130 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-15 12:16:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-15 12:16:07,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:07,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:07,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:07,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-15 12:16:07,131 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 29 [2022-04-15 12:16:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:07,131 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-15 12:16:07,131 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-15 12:16:07,156 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:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 12:16:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:16:07,156 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:07,157 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:07,175 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:07,371 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:07,372 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:07,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1446221131, now seen corresponding path program 9 times [2022-04-15 12:16:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:07,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [381043432] [2022-04-15 12:16:07,377 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:07,377 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:07,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1446221131, now seen corresponding path program 10 times [2022-04-15 12:16:07,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:07,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681598311] [2022-04-15 12:16:07,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:07,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:07,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:07,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {2164#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2154#true} is VALID [2022-04-15 12:16:07,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {2154#true} assume true; {2154#true} is VALID [2022-04-15 12:16:07,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2154#true} {2154#true} #64#return; {2154#true} is VALID [2022-04-15 12:16:07,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {2154#true} call ULTIMATE.init(); {2164#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:07,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {2164#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2154#true} is VALID [2022-04-15 12:16:07,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {2154#true} assume true; {2154#true} is VALID [2022-04-15 12:16:07,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2154#true} {2154#true} #64#return; {2154#true} is VALID [2022-04-15 12:16:07,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {2154#true} call #t~ret6 := main(); {2154#true} is VALID [2022-04-15 12:16:07,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {2154#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2159#(= main_~i~0 0)} is VALID [2022-04-15 12:16:07,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {2159#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2159#(= main_~i~0 0)} is VALID [2022-04-15 12:16:07,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {2159#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2160#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:07,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {2160#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2160#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:07,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {2160#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2161#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:07,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {2161#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2161#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:07,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {2161#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2162#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:07,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {2162#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2162#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:07,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {2162#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2163#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:07,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {2163#(<= main_~i~0 4)} assume !(~i~0 < 1024); {2155#false} is VALID [2022-04-15 12:16:07,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#false} ~i~0 := 0; {2155#false} is VALID [2022-04-15 12:16:07,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 12:16:07,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 12:16:07,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 12:16:07,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-15 12:16:07,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 12:16:07,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 12:16:07,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 12:16:07,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-15 12:16:07,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 12:16:07,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 12:16:07,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {2155#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 12:16:07,454 INFO L272 TraceCheckUtils]: 27: Hoare triple {2155#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2155#false} is VALID [2022-04-15 12:16:07,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {2155#false} ~cond := #in~cond; {2155#false} is VALID [2022-04-15 12:16:07,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#false} assume 0 == ~cond; {2155#false} is VALID [2022-04-15 12:16:07,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#false} assume !false; {2155#false} is VALID [2022-04-15 12:16:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:07,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:07,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681598311] [2022-04-15 12:16:07,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681598311] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:07,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002952241] [2022-04-15 12:16:07,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:07,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:07,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:07,456 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:07,457 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:07,499 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:07,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:07,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:07,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:07,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {2154#true} call ULTIMATE.init(); {2154#true} is VALID [2022-04-15 12:16:07,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {2154#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2154#true} is VALID [2022-04-15 12:16:07,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {2154#true} assume true; {2154#true} is VALID [2022-04-15 12:16:07,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2154#true} {2154#true} #64#return; {2154#true} is VALID [2022-04-15 12:16:07,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {2154#true} call #t~ret6 := main(); {2154#true} is VALID [2022-04-15 12:16:07,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {2154#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2183#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:07,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {2183#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2183#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:07,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {2183#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2160#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:07,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {2160#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2160#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:07,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {2160#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2161#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:07,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {2161#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2161#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:07,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {2161#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2162#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:07,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {2162#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2162#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:07,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {2162#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2163#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:07,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {2163#(<= main_~i~0 4)} assume !(~i~0 < 1024); {2155#false} is VALID [2022-04-15 12:16:07,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#false} ~i~0 := 0; {2155#false} is VALID [2022-04-15 12:16:07,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 12:16:07,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 12:16:07,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 12:16:07,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-15 12:16:07,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 12:16:07,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 12:16:07,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 12:16:07,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-15 12:16:07,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 12:16:07,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 12:16:07,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {2155#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 12:16:07,584 INFO L272 TraceCheckUtils]: 27: Hoare triple {2155#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2155#false} is VALID [2022-04-15 12:16:07,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {2155#false} ~cond := #in~cond; {2155#false} is VALID [2022-04-15 12:16:07,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#false} assume 0 == ~cond; {2155#false} is VALID [2022-04-15 12:16:07,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#false} assume !false; {2155#false} is VALID [2022-04-15 12:16:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:07,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:07,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#false} assume !false; {2155#false} is VALID [2022-04-15 12:16:07,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#false} assume 0 == ~cond; {2155#false} is VALID [2022-04-15 12:16:07,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {2155#false} ~cond := #in~cond; {2155#false} is VALID [2022-04-15 12:16:07,693 INFO L272 TraceCheckUtils]: 27: Hoare triple {2155#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2155#false} is VALID [2022-04-15 12:16:07,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {2155#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 12:16:07,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 12:16:07,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 12:16:07,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-15 12:16:07,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 12:16:07,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 12:16:07,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 12:16:07,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-15 12:16:07,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 12:16:07,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 12:16:07,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 12:16:07,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#false} ~i~0 := 0; {2155#false} is VALID [2022-04-15 12:16:07,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {2307#(< main_~i~0 1024)} assume !(~i~0 < 1024); {2155#false} is VALID [2022-04-15 12:16:07,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {2311#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2307#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:07,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {2311#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2311#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:07,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {2318#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2311#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:07,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {2318#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2318#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:07,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2318#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:07,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {2325#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2325#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:07,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {2332#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2325#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:07,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {2332#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2332#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:07,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {2154#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2332#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:07,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {2154#true} call #t~ret6 := main(); {2154#true} is VALID [2022-04-15 12:16:07,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2154#true} {2154#true} #64#return; {2154#true} is VALID [2022-04-15 12:16:07,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {2154#true} assume true; {2154#true} is VALID [2022-04-15 12:16:07,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {2154#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2154#true} is VALID [2022-04-15 12:16:07,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {2154#true} call ULTIMATE.init(); {2154#true} is VALID [2022-04-15 12:16:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:07,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002952241] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:07,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:07,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 12:16:07,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:07,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [381043432] [2022-04-15 12:16:07,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [381043432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:07,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:07,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:16:07,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541086381] [2022-04-15 12:16:07,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:07,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 12:16:07,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:07,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:07,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:16:07,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:07,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:16:07,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:16:07,713 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:07,900 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2022-04-15 12:16:07,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:16:07,900 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 12:16:07,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-15 12:16:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-15 12:16:07,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 73 transitions. [2022-04-15 12:16:07,948 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:07,949 INFO L225 Difference]: With dead ends: 68 [2022-04-15 12:16:07,949 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 12:16:07,950 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=196, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:16:07,950 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 84 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:07,950 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 27 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 12:16:07,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2022-04-15 12:16:07,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:07,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,983 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,983 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:07,985 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-04-15 12:16:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-15 12:16:07,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:07,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:07,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 12:16:07,985 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 12:16:07,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:07,986 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-04-15 12:16:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-15 12:16:07,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:07,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:07,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:07,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-15 12:16:07,987 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 31 [2022-04-15 12:16:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:07,988 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-15 12:16:07,988 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:07,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-15 12:16:08,017 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:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 12:16:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:16:08,018 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:08,018 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:08,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 12:16:08,224 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:08,224 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:08,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1135945939, now seen corresponding path program 11 times [2022-04-15 12:16:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:08,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1203245874] [2022-04-15 12:16:08,228 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:08,228 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:08,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1135945939, now seen corresponding path program 12 times [2022-04-15 12:16:08,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:08,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355402804] [2022-04-15 12:16:08,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:08,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:08,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:08,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {2683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2672#true} is VALID [2022-04-15 12:16:08,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-15 12:16:08,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2672#true} {2672#true} #64#return; {2672#true} is VALID [2022-04-15 12:16:08,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:08,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {2683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2672#true} is VALID [2022-04-15 12:16:08,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-15 12:16:08,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #64#return; {2672#true} is VALID [2022-04-15 12:16:08,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret6 := main(); {2672#true} is VALID [2022-04-15 12:16:08,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2677#(= main_~i~0 0)} is VALID [2022-04-15 12:16:08,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {2677#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2677#(= main_~i~0 0)} is VALID [2022-04-15 12:16:08,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {2677#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2678#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:08,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {2678#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2678#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:08,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {2678#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2679#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:08,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {2679#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2679#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:08,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {2679#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2680#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:08,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {2680#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2680#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:08,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {2680#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2681#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:08,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {2681#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2681#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:08,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {2681#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2682#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:08,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {2682#(<= main_~i~0 5)} assume !(~i~0 < 1024); {2673#false} is VALID [2022-04-15 12:16:08,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {2673#false} ~i~0 := 0; {2673#false} is VALID [2022-04-15 12:16:08,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {2673#false} #t~short5 := ~i~0 < 1024; {2673#false} is VALID [2022-04-15 12:16:08,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {2673#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2673#false} is VALID [2022-04-15 12:16:08,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {2673#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2673#false} is VALID [2022-04-15 12:16:08,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {2673#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2673#false} is VALID [2022-04-15 12:16:08,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {2673#false} #t~short5 := ~i~0 < 1024; {2673#false} is VALID [2022-04-15 12:16:08,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {2673#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2673#false} is VALID [2022-04-15 12:16:08,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {2673#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2673#false} is VALID [2022-04-15 12:16:08,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {2673#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2673#false} is VALID [2022-04-15 12:16:08,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {2673#false} #t~short5 := ~i~0 < 1024; {2673#false} is VALID [2022-04-15 12:16:08,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {2673#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2673#false} is VALID [2022-04-15 12:16:08,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {2673#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2673#false} is VALID [2022-04-15 12:16:08,314 INFO L272 TraceCheckUtils]: 29: Hoare triple {2673#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2673#false} is VALID [2022-04-15 12:16:08,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {2673#false} ~cond := #in~cond; {2673#false} is VALID [2022-04-15 12:16:08,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {2673#false} assume 0 == ~cond; {2673#false} is VALID [2022-04-15 12:16:08,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-15 12:16:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:08,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:08,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355402804] [2022-04-15 12:16:08,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355402804] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:08,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453980948] [2022-04-15 12:16:08,315 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:08,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:08,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:08,316 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:08,316 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:08,369 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:16:08,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:08,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:08,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:08,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2672#true} is VALID [2022-04-15 12:16:08,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2672#true} is VALID [2022-04-15 12:16:08,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-15 12:16:08,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #64#return; {2672#true} is VALID [2022-04-15 12:16:08,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret6 := main(); {2672#true} is VALID [2022-04-15 12:16:08,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2672#true} is VALID [2022-04-15 12:16:08,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 12:16:08,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 12:16:08,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 12:16:08,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 12:16:08,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 12:16:08,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 12:16:08,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 12:16:08,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 12:16:08,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 12:16:08,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 12:16:08,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {2672#true} assume !(~i~0 < 1024); {2672#true} is VALID [2022-04-15 12:16:08,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {2672#true} ~i~0 := 0; {2738#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:08,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {2738#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {2738#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:08,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {2738#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2738#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:08,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {2738#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2738#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:08,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {2738#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2678#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:08,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {2678#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {2678#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:08,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {2678#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2678#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:08,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {2678#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2678#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:08,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {2678#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2679#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:08,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {2679#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {2679#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:08,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {2679#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2679#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:08,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {2679#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2679#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:08,522 INFO L272 TraceCheckUtils]: 29: Hoare triple {2679#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2775#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:08,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {2775#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2779#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:08,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {2779#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2673#false} is VALID [2022-04-15 12:16:08,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-15 12:16:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:16:08,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:08,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-15 12:16:08,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {2779#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2673#false} is VALID [2022-04-15 12:16:08,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {2775#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2779#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:08,687 INFO L272 TraceCheckUtils]: 29: Hoare triple {2795#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2775#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:08,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {2795#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2795#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:08,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {2795#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2795#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:08,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {2795#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {2795#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:08,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {2808#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2795#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:08,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {2808#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2808#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:08,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {2808#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2808#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:08,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {2808#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {2808#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:08,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {2821#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2808#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:08,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {2821#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2821#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:08,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {2821#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2821#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:08,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {2821#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {2821#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:08,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {2672#true} ~i~0 := 0; {2821#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:08,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {2672#true} assume !(~i~0 < 1024); {2672#true} is VALID [2022-04-15 12:16:08,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 12:16:08,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 12:16:08,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 12:16:08,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 12:16:08,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 12:16:08,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 12:16:08,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 12:16:08,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 12:16:08,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 12:16:08,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 12:16:08,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2672#true} is VALID [2022-04-15 12:16:08,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret6 := main(); {2672#true} is VALID [2022-04-15 12:16:08,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #64#return; {2672#true} is VALID [2022-04-15 12:16:08,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-15 12:16:08,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {2672#true} is VALID [2022-04-15 12:16:08,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2672#true} is VALID [2022-04-15 12:16:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 12:16:08,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453980948] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:08,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:08,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-04-15 12:16:08,696 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:08,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1203245874] [2022-04-15 12:16:08,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1203245874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:08,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:08,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:16:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124073090] [2022-04-15 12:16:08,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:08,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:16:08,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:08,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:08,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:08,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:16:08,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:08,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:16:08,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:16:08,716 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:08,977 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-15 12:16:08,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:16:08,977 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:16:08,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-04-15 12:16:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-04-15 12:16:08,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 82 transitions. [2022-04-15 12:16:09,052 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:16:09,053 INFO L225 Difference]: With dead ends: 75 [2022-04-15 12:16:09,053 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 12:16:09,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:16:09,054 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 109 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:09,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 27 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 12:16:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 36. [2022-04-15 12:16:09,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:09,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:09,083 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:09,084 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:09,085 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-15 12:16:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-15 12:16:09,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:09,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:09,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 12:16:09,091 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 12:16:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:09,092 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-15 12:16:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-15 12:16:09,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:09,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:09,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:09,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-15 12:16:09,093 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 33 [2022-04-15 12:16:09,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:09,093 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-15 12:16:09,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:09,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 40 transitions. [2022-04-15 12:16:09,123 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:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-15 12:16:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:16:09,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:09,124 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:09,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 12:16:09,334 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:09,335 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:09,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:09,335 INFO L85 PathProgramCache]: Analyzing trace with hash 107403121, now seen corresponding path program 13 times [2022-04-15 12:16:09,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:09,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [965802250] [2022-04-15 12:16:09,339 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:09,339 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:09,340 INFO L85 PathProgramCache]: Analyzing trace with hash 107403121, now seen corresponding path program 14 times [2022-04-15 12:16:09,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:09,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293251448] [2022-04-15 12:16:09,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:09,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:09,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:09,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {3249#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3237#true} is VALID [2022-04-15 12:16:09,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {3237#true} assume true; {3237#true} is VALID [2022-04-15 12:16:09,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3237#true} {3237#true} #64#return; {3237#true} is VALID [2022-04-15 12:16:09,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {3237#true} call ULTIMATE.init(); {3249#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:09,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {3249#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3237#true} is VALID [2022-04-15 12:16:09,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {3237#true} assume true; {3237#true} is VALID [2022-04-15 12:16:09,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3237#true} {3237#true} #64#return; {3237#true} is VALID [2022-04-15 12:16:09,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {3237#true} call #t~ret6 := main(); {3237#true} is VALID [2022-04-15 12:16:09,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {3237#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3242#(= main_~i~0 0)} is VALID [2022-04-15 12:16:09,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {3242#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3242#(= main_~i~0 0)} is VALID [2022-04-15 12:16:09,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {3242#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3243#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:09,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {3243#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3243#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:09,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {3243#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3244#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:09,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {3244#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3244#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:09,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {3244#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3245#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:09,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {3245#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3245#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:09,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {3245#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3246#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:09,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {3246#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3246#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:09,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {3246#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3247#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:09,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {3247#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3247#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:09,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {3247#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3248#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:09,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {3248#(<= main_~i~0 6)} assume !(~i~0 < 1024); {3238#false} is VALID [2022-04-15 12:16:09,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {3238#false} ~i~0 := 0; {3238#false} is VALID [2022-04-15 12:16:09,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 12:16:09,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 12:16:09,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 12:16:09,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-15 12:16:09,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 12:16:09,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 12:16:09,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 12:16:09,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-15 12:16:09,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 12:16:09,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 12:16:09,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {3238#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 12:16:09,434 INFO L272 TraceCheckUtils]: 31: Hoare triple {3238#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3238#false} is VALID [2022-04-15 12:16:09,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {3238#false} ~cond := #in~cond; {3238#false} is VALID [2022-04-15 12:16:09,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {3238#false} assume 0 == ~cond; {3238#false} is VALID [2022-04-15 12:16:09,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {3238#false} assume !false; {3238#false} is VALID [2022-04-15 12:16:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:09,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293251448] [2022-04-15 12:16:09,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293251448] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:09,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136006149] [2022-04-15 12:16:09,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:09,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:09,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:09,435 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:09,436 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:09,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:09,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:09,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:16:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:09,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:09,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {3237#true} call ULTIMATE.init(); {3237#true} is VALID [2022-04-15 12:16:09,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {3237#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3237#true} is VALID [2022-04-15 12:16:09,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {3237#true} assume true; {3237#true} is VALID [2022-04-15 12:16:09,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3237#true} {3237#true} #64#return; {3237#true} is VALID [2022-04-15 12:16:09,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {3237#true} call #t~ret6 := main(); {3237#true} is VALID [2022-04-15 12:16:09,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {3237#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3268#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:09,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {3268#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3268#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:09,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {3268#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3243#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:09,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {3243#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3243#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:09,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {3243#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3244#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:09,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {3244#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3244#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:09,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {3244#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3245#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:09,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {3245#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3245#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:09,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {3245#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3246#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:09,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {3246#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3246#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:09,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {3246#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3247#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:09,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {3247#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3247#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:09,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {3247#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3248#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:09,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {3248#(<= main_~i~0 6)} assume !(~i~0 < 1024); {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {3238#false} ~i~0 := 0; {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {3238#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L272 TraceCheckUtils]: 31: Hoare triple {3238#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {3238#false} ~cond := #in~cond; {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {3238#false} assume 0 == ~cond; {3238#false} is VALID [2022-04-15 12:16:09,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {3238#false} assume !false; {3238#false} is VALID [2022-04-15 12:16:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:09,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:09,819 INFO L290 TraceCheckUtils]: 34: Hoare triple {3238#false} assume !false; {3238#false} is VALID [2022-04-15 12:16:09,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {3238#false} assume 0 == ~cond; {3238#false} is VALID [2022-04-15 12:16:09,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {3238#false} ~cond := #in~cond; {3238#false} is VALID [2022-04-15 12:16:09,819 INFO L272 TraceCheckUtils]: 31: Hoare triple {3238#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3238#false} is VALID [2022-04-15 12:16:09,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {3238#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 12:16:09,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 12:16:09,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 12:16:09,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-15 12:16:09,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 12:16:09,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 12:16:09,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 12:16:09,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-15 12:16:09,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 12:16:09,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 12:16:09,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 12:16:09,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {3238#false} ~i~0 := 0; {3238#false} is VALID [2022-04-15 12:16:09,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {3404#(< main_~i~0 1024)} assume !(~i~0 < 1024); {3238#false} is VALID [2022-04-15 12:16:09,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {3408#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3404#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:09,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {3408#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3408#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:09,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {3415#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3408#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:09,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {3415#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3415#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:09,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {3422#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3415#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:09,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {3422#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3422#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:09,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {3429#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3422#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:09,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {3429#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3429#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:09,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {3436#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3429#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:09,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {3436#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3436#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:09,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {3443#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3436#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:09,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {3443#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3443#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:09,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {3237#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3443#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:09,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {3237#true} call #t~ret6 := main(); {3237#true} is VALID [2022-04-15 12:16:09,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3237#true} {3237#true} #64#return; {3237#true} is VALID [2022-04-15 12:16:09,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {3237#true} assume true; {3237#true} is VALID [2022-04-15 12:16:09,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {3237#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3237#true} is VALID [2022-04-15 12:16:09,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {3237#true} call ULTIMATE.init(); {3237#true} is VALID [2022-04-15 12:16:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:09,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136006149] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:09,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:09,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-15 12:16:09,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:09,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [965802250] [2022-04-15 12:16:09,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [965802250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:09,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:09,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:16:09,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425557422] [2022-04-15 12:16:09,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:09,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:16:09,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:09,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:09,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:09,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:16:09,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:09,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:16:09,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:16:09,846 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:10,212 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-04-15 12:16:10,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:16:10,212 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:16:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-15 12:16:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-15 12:16:10,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2022-04-15 12:16:10,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:10,291 INFO L225 Difference]: With dead ends: 82 [2022-04-15 12:16:10,291 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 12:16:10,291 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:16:10,292 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:10,292 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 22 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 12:16:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2022-04-15 12:16:10,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:10,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:10,339 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:10,339 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:10,340 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-15 12:16:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2022-04-15 12:16:10,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:10,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:10,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 12:16:10,341 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 12:16:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:10,342 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-15 12:16:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2022-04-15 12:16:10,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:10,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:10,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:10,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-15 12:16:10,344 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 35 [2022-04-15 12:16:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:10,344 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-15 12:16:10,344 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:10,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2022-04-15 12:16:10,401 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:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-15 12:16:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 12:16:10,402 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:10,402 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:10,422 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:10,602 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:10,603 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:10,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:10,603 INFO L85 PathProgramCache]: Analyzing trace with hash -479766897, now seen corresponding path program 15 times [2022-04-15 12:16:10,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:10,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [959589112] [2022-04-15 12:16:10,607 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:10,608 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash -479766897, now seen corresponding path program 16 times [2022-04-15 12:16:10,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:10,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061951424] [2022-04-15 12:16:10,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:10,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:10,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:10,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {3864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3851#true} is VALID [2022-04-15 12:16:10,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-15 12:16:10,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3851#true} {3851#true} #64#return; {3851#true} is VALID [2022-04-15 12:16:10,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {3851#true} call ULTIMATE.init(); {3864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:10,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {3864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3851#true} is VALID [2022-04-15 12:16:10,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-15 12:16:10,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3851#true} {3851#true} #64#return; {3851#true} is VALID [2022-04-15 12:16:10,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {3851#true} call #t~ret6 := main(); {3851#true} is VALID [2022-04-15 12:16:10,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {3851#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3856#(= main_~i~0 0)} is VALID [2022-04-15 12:16:10,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {3856#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3856#(= main_~i~0 0)} is VALID [2022-04-15 12:16:10,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {3856#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3857#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:10,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {3857#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3857#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:10,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {3857#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3858#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:10,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {3858#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3858#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:10,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {3858#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3859#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:10,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {3859#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3859#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:10,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {3859#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3860#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:10,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {3860#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3860#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:10,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {3860#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3861#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:10,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {3861#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3861#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:10,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {3861#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3862#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:10,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {3862#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3862#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:10,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {3862#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3863#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:10,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {3863#(<= main_~i~0 7)} assume !(~i~0 < 1024); {3852#false} is VALID [2022-04-15 12:16:10,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {3852#false} ~i~0 := 0; {3852#false} is VALID [2022-04-15 12:16:10,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 12:16:10,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 12:16:10,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 12:16:10,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-15 12:16:10,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 12:16:10,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 12:16:10,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 12:16:10,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-15 12:16:10,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 12:16:10,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 12:16:10,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {3852#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 12:16:10,683 INFO L272 TraceCheckUtils]: 33: Hoare triple {3852#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3852#false} is VALID [2022-04-15 12:16:10,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {3852#false} ~cond := #in~cond; {3852#false} is VALID [2022-04-15 12:16:10,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {3852#false} assume 0 == ~cond; {3852#false} is VALID [2022-04-15 12:16:10,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {3852#false} assume !false; {3852#false} is VALID [2022-04-15 12:16:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:10,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:10,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061951424] [2022-04-15 12:16:10,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061951424] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:10,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657110507] [2022-04-15 12:16:10,684 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:10,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:10,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:10,685 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:10,686 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:10,736 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:10,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:10,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:16:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:10,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:10,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {3851#true} call ULTIMATE.init(); {3851#true} is VALID [2022-04-15 12:16:10,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3851#true} is VALID [2022-04-15 12:16:10,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-15 12:16:10,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3851#true} {3851#true} #64#return; {3851#true} is VALID [2022-04-15 12:16:10,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {3851#true} call #t~ret6 := main(); {3851#true} is VALID [2022-04-15 12:16:10,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {3851#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3883#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:10,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {3883#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3883#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:10,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {3883#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3857#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:10,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {3857#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3857#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:10,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {3857#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3858#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:10,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {3858#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3858#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:10,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {3858#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3859#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:10,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {3859#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3859#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:10,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {3859#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3860#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:10,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {3860#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3860#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:10,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {3860#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3861#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:10,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {3861#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3861#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:10,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {3861#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3862#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:10,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {3862#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3862#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:10,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {3862#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3863#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:10,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {3863#(<= main_~i~0 7)} assume !(~i~0 < 1024); {3852#false} is VALID [2022-04-15 12:16:10,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {3852#false} ~i~0 := 0; {3852#false} is VALID [2022-04-15 12:16:10,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 12:16:10,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 12:16:10,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 12:16:10,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-15 12:16:10,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 12:16:10,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 12:16:10,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 12:16:10,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-15 12:16:10,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 12:16:10,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 12:16:10,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {3852#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 12:16:10,856 INFO L272 TraceCheckUtils]: 33: Hoare triple {3852#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3852#false} is VALID [2022-04-15 12:16:10,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {3852#false} ~cond := #in~cond; {3852#false} is VALID [2022-04-15 12:16:10,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {3852#false} assume 0 == ~cond; {3852#false} is VALID [2022-04-15 12:16:10,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {3852#false} assume !false; {3852#false} is VALID [2022-04-15 12:16:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:10,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:11,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {3852#false} assume !false; {3852#false} is VALID [2022-04-15 12:16:11,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {3852#false} assume 0 == ~cond; {3852#false} is VALID [2022-04-15 12:16:11,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {3852#false} ~cond := #in~cond; {3852#false} is VALID [2022-04-15 12:16:11,085 INFO L272 TraceCheckUtils]: 33: Hoare triple {3852#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3852#false} is VALID [2022-04-15 12:16:11,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {3852#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 12:16:11,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 12:16:11,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 12:16:11,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-15 12:16:11,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 12:16:11,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 12:16:11,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 12:16:11,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-15 12:16:11,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 12:16:11,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 12:16:11,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 12:16:11,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {3852#false} ~i~0 := 0; {3852#false} is VALID [2022-04-15 12:16:11,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {4025#(< main_~i~0 1024)} assume !(~i~0 < 1024); {3852#false} is VALID [2022-04-15 12:16:11,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {4029#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4025#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:11,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {4029#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4029#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:11,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {4036#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4029#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:11,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {4036#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4036#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:11,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {4043#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4036#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:11,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {4043#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4043#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:11,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {4050#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4043#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:11,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {4050#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4050#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:11,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {4057#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4050#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:11,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {4057#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4057#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:11,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {4064#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4057#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:11,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {4064#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4064#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:11,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {4071#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4064#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:11,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {4071#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4071#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:11,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {3851#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4071#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:11,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {3851#true} call #t~ret6 := main(); {3851#true} is VALID [2022-04-15 12:16:11,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3851#true} {3851#true} #64#return; {3851#true} is VALID [2022-04-15 12:16:11,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-15 12:16:11,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {3851#true} is VALID [2022-04-15 12:16:11,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {3851#true} call ULTIMATE.init(); {3851#true} is VALID [2022-04-15 12:16:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:11,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657110507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:11,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:11,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 12:16:11,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:11,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [959589112] [2022-04-15 12:16:11,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [959589112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:11,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:11,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:16:11,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037589493] [2022-04-15 12:16:11,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:11,093 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 12:16:11,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:11,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:11,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:11,124 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:16:11,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:11,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:16:11,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:16:11,124 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:11,495 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2022-04-15 12:16:11,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:16:11,495 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 12:16:11,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-04-15 12:16:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-04-15 12:16:11,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 100 transitions. [2022-04-15 12:16:11,563 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:16:11,565 INFO L225 Difference]: With dead ends: 89 [2022-04-15 12:16:11,565 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 12:16:11,565 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=326, Invalid=430, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:16:11,566 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 129 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:11,566 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 32 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:11,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 12:16:11,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2022-04-15 12:16:11,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:11,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:11,612 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:11,612 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:11,617 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-04-15 12:16:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2022-04-15 12:16:11,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:11,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:11,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 12:16:11,618 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 12:16:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:11,619 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-04-15 12:16:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2022-04-15 12:16:11,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:11,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:11,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:11,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-15 12:16:11,620 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 37 [2022-04-15 12:16:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:11,620 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-15 12:16:11,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:11,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2022-04-15 12:16:11,656 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:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-15 12:16:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 12:16:11,656 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:11,656 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:11,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 12:16:11,867 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:11,867 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:11,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:11,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2109438419, now seen corresponding path program 17 times [2022-04-15 12:16:11,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:11,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [189686784] [2022-04-15 12:16:11,873 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:11,873 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:11,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2109438419, now seen corresponding path program 18 times [2022-04-15 12:16:11,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:11,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587648392] [2022-04-15 12:16:11,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:11,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:11,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {4527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {4513#true} is VALID [2022-04-15 12:16:11,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {4513#true} assume true; {4513#true} is VALID [2022-04-15 12:16:11,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4513#true} {4513#true} #64#return; {4513#true} is VALID [2022-04-15 12:16:11,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {4513#true} call ULTIMATE.init(); {4527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:11,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {4527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {4513#true} is VALID [2022-04-15 12:16:11,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {4513#true} assume true; {4513#true} is VALID [2022-04-15 12:16:11,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4513#true} {4513#true} #64#return; {4513#true} is VALID [2022-04-15 12:16:11,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {4513#true} call #t~ret6 := main(); {4513#true} is VALID [2022-04-15 12:16:11,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {4513#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4518#(= main_~i~0 0)} is VALID [2022-04-15 12:16:11,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {4518#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4518#(= main_~i~0 0)} is VALID [2022-04-15 12:16:11,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {4518#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4519#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:11,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {4519#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4519#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:11,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {4519#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4520#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:11,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {4520#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4520#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:11,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {4520#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4521#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:11,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {4521#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4521#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:11,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {4521#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4522#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:11,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {4522#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4522#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:11,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {4522#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4523#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:11,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {4523#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4523#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:11,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {4523#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4524#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:11,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {4524#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4524#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:11,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {4524#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4525#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:11,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {4525#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4525#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:11,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {4525#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4526#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:11,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {4526#(<= main_~i~0 8)} assume !(~i~0 < 1024); {4514#false} is VALID [2022-04-15 12:16:11,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {4514#false} ~i~0 := 0; {4514#false} is VALID [2022-04-15 12:16:11,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {4514#false} #t~short5 := ~i~0 < 1024; {4514#false} is VALID [2022-04-15 12:16:11,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {4514#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4514#false} is VALID [2022-04-15 12:16:11,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {4514#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4514#false} is VALID [2022-04-15 12:16:11,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {4514#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4514#false} is VALID [2022-04-15 12:16:11,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {4514#false} #t~short5 := ~i~0 < 1024; {4514#false} is VALID [2022-04-15 12:16:11,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {4514#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4514#false} is VALID [2022-04-15 12:16:11,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {4514#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4514#false} is VALID [2022-04-15 12:16:11,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {4514#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4514#false} is VALID [2022-04-15 12:16:11,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {4514#false} #t~short5 := ~i~0 < 1024; {4514#false} is VALID [2022-04-15 12:16:11,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {4514#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4514#false} is VALID [2022-04-15 12:16:11,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {4514#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {4514#false} is VALID [2022-04-15 12:16:11,958 INFO L272 TraceCheckUtils]: 35: Hoare triple {4514#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {4514#false} is VALID [2022-04-15 12:16:11,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {4514#false} ~cond := #in~cond; {4514#false} is VALID [2022-04-15 12:16:11,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {4514#false} assume 0 == ~cond; {4514#false} is VALID [2022-04-15 12:16:11,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {4514#false} assume !false; {4514#false} is VALID [2022-04-15 12:16:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:11,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:11,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587648392] [2022-04-15 12:16:11,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587648392] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:11,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502691553] [2022-04-15 12:16:11,959 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:11,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:11,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:11,960 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:11,979 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:12,028 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:16:12,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:12,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:12,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:12,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {4513#true} call ULTIMATE.init(); {4513#true} is VALID [2022-04-15 12:16:12,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {4513#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {4513#true} is VALID [2022-04-15 12:16:12,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {4513#true} assume true; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4513#true} {4513#true} #64#return; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {4513#true} call #t~ret6 := main(); {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {4513#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {4513#true} assume !(~i~0 < 1024); {4513#true} is VALID [2022-04-15 12:16:12,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {4513#true} ~i~0 := 0; {4600#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:12,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {4600#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {4600#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:12,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {4600#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4600#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:12,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {4600#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4600#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:12,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {4600#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4519#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:12,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {4519#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {4519#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:12,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {4519#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4519#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:12,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {4519#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4519#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:12,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {4519#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4520#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:12,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {4520#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {4520#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:12,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {4520#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4520#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:12,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {4520#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {4520#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:12,210 INFO L272 TraceCheckUtils]: 35: Hoare triple {4520#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {4637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:12,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {4637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:12,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {4641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4514#false} is VALID [2022-04-15 12:16:12,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {4514#false} assume !false; {4514#false} is VALID [2022-04-15 12:16:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 12:16:12,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:12,350 INFO L290 TraceCheckUtils]: 38: Hoare triple {4514#false} assume !false; {4514#false} is VALID [2022-04-15 12:16:12,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {4641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4514#false} is VALID [2022-04-15 12:16:12,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {4637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:12,352 INFO L272 TraceCheckUtils]: 35: Hoare triple {4657#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {4637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:12,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {4657#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {4657#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:12,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {4657#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4657#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:12,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {4657#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {4657#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:12,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {4670#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4657#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:12,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {4670#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4670#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:12,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {4670#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4670#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:12,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {4670#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {4670#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:12,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {4683#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4670#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:12,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4683#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:12,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {4683#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4683#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:12,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {4683#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {4683#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:12,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {4513#true} ~i~0 := 0; {4683#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:12,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {4513#true} assume !(~i~0 < 1024); {4513#true} is VALID [2022-04-15 12:16:12,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 12:16:12,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 12:16:12,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {4513#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4513#true} is VALID [2022-04-15 12:16:12,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {4513#true} call #t~ret6 := main(); {4513#true} is VALID [2022-04-15 12:16:12,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4513#true} {4513#true} #64#return; {4513#true} is VALID [2022-04-15 12:16:12,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {4513#true} assume true; {4513#true} is VALID [2022-04-15 12:16:12,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {4513#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {4513#true} is VALID [2022-04-15 12:16:12,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {4513#true} call ULTIMATE.init(); {4513#true} is VALID [2022-04-15 12:16:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 12:16:12,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502691553] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:12,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:12,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2022-04-15 12:16:12,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:12,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [189686784] [2022-04-15 12:16:12,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [189686784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:12,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:12,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:16:12,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209541174] [2022-04-15 12:16:12,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:12,361 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 12:16:12,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:12,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,378 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:12,378 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:16:12,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:12,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:16:12,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:16:12,379 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:12,850 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-15 12:16:12,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:16:12,850 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 12:16:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2022-04-15 12:16:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2022-04-15 12:16:12,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 109 transitions. [2022-04-15 12:16:12,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:12,941 INFO L225 Difference]: With dead ends: 96 [2022-04-15 12:16:12,941 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 12:16:12,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:16:12,942 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 156 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:12,942 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 32 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 12:16:12,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 42. [2022-04-15 12:16:12,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:12,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,996 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,996 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:12,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:12,998 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-04-15 12:16:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-15 12:16:12,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:12,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:12,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 12:16:12,998 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 12:16:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:13,000 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-04-15 12:16:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-15 12:16:13,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:13,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:13,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:13,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-15 12:16:13,002 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 39 [2022-04-15 12:16:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:13,002 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-15 12:16:13,002 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:13,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2022-04-15 12:16:13,049 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:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-15 12:16:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 12:16:13,050 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:13,050 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:13,070 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:13,250 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:13,250 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:13,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:13,251 INFO L85 PathProgramCache]: Analyzing trace with hash -560708021, now seen corresponding path program 19 times [2022-04-15 12:16:13,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:13,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1010510529] [2022-04-15 12:16:13,256 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:13,256 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash -560708021, now seen corresponding path program 20 times [2022-04-15 12:16:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:13,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804046435] [2022-04-15 12:16:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:13,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:13,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:13,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {5234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {5219#true} is VALID [2022-04-15 12:16:13,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-15 12:16:13,395 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5219#true} {5219#true} #64#return; {5219#true} is VALID [2022-04-15 12:16:13,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {5219#true} call ULTIMATE.init(); {5234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:13,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {5234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {5219#true} is VALID [2022-04-15 12:16:13,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-15 12:16:13,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#true} {5219#true} #64#return; {5219#true} is VALID [2022-04-15 12:16:13,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#true} call #t~ret6 := main(); {5219#true} is VALID [2022-04-15 12:16:13,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5224#(= main_~i~0 0)} is VALID [2022-04-15 12:16:13,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {5224#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5224#(= main_~i~0 0)} is VALID [2022-04-15 12:16:13,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {5224#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5225#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:13,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {5225#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5225#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:13,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {5225#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5226#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:13,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {5226#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5226#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:13,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {5226#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5227#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:13,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {5227#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5227#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:13,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {5227#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5228#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:13,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {5228#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5228#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:13,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {5228#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5229#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:13,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {5229#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5229#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:13,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {5229#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5230#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:13,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {5230#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5230#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:13,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {5230#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5231#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:13,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {5231#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5231#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:13,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {5231#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5232#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:13,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {5232#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5232#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:13,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {5232#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5233#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:13,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {5233#(<= main_~i~0 9)} assume !(~i~0 < 1024); {5220#false} is VALID [2022-04-15 12:16:13,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {5220#false} ~i~0 := 0; {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {5220#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L272 TraceCheckUtils]: 37: Hoare triple {5220#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {5220#false} ~cond := #in~cond; {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {5220#false} assume 0 == ~cond; {5220#false} is VALID [2022-04-15 12:16:13,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {5220#false} assume !false; {5220#false} is VALID [2022-04-15 12:16:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:13,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:13,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804046435] [2022-04-15 12:16:13,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804046435] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:13,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070850043] [2022-04-15 12:16:13,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:13,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:13,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:13,405 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:13,407 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:13,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:13,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:13,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:16:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:13,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:13,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {5219#true} call ULTIMATE.init(); {5219#true} is VALID [2022-04-15 12:16:13,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {5219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {5219#true} is VALID [2022-04-15 12:16:13,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-15 12:16:13,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#true} {5219#true} #64#return; {5219#true} is VALID [2022-04-15 12:16:13,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#true} call #t~ret6 := main(); {5219#true} is VALID [2022-04-15 12:16:13,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5253#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:13,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {5253#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5253#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:13,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {5253#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5225#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:13,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {5225#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5225#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:13,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {5225#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5226#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:13,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {5226#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5226#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:13,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {5226#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5227#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:13,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {5227#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5227#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:13,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {5227#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5228#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:13,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {5228#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5228#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:13,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {5228#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5229#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:13,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {5229#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5229#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:13,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {5229#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5230#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:13,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {5230#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5230#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:13,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {5230#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5231#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:13,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {5231#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5231#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:13,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {5231#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5232#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:13,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {5232#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5232#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:13,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {5232#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5233#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:13,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {5233#(<= main_~i~0 9)} assume !(~i~0 < 1024); {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {5220#false} ~i~0 := 0; {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {5220#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L272 TraceCheckUtils]: 37: Hoare triple {5220#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {5220#false} ~cond := #in~cond; {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {5220#false} assume 0 == ~cond; {5220#false} is VALID [2022-04-15 12:16:13,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {5220#false} assume !false; {5220#false} is VALID [2022-04-15 12:16:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:13,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:13,942 INFO L290 TraceCheckUtils]: 40: Hoare triple {5220#false} assume !false; {5220#false} is VALID [2022-04-15 12:16:13,942 INFO L290 TraceCheckUtils]: 39: Hoare triple {5220#false} assume 0 == ~cond; {5220#false} is VALID [2022-04-15 12:16:13,942 INFO L290 TraceCheckUtils]: 38: Hoare triple {5220#false} ~cond := #in~cond; {5220#false} is VALID [2022-04-15 12:16:13,942 INFO L272 TraceCheckUtils]: 37: Hoare triple {5220#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5220#false} is VALID [2022-04-15 12:16:13,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {5220#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 12:16:13,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 12:16:13,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 12:16:13,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-15 12:16:13,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 12:16:13,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 12:16:13,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 12:16:13,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-15 12:16:13,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 12:16:13,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 12:16:13,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 12:16:13,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {5220#false} ~i~0 := 0; {5220#false} is VALID [2022-04-15 12:16:13,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {5407#(< main_~i~0 1024)} assume !(~i~0 < 1024); {5220#false} is VALID [2022-04-15 12:16:13,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {5411#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5407#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:13,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {5411#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5411#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:13,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {5418#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5411#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:13,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {5418#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5418#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:13,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {5425#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5418#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:13,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {5425#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5425#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:13,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {5432#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5425#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:13,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {5432#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5432#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:13,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {5439#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5432#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:13,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {5439#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5439#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:13,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {5446#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5439#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:13,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {5446#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5446#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:13,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {5453#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5446#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:13,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {5453#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5453#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:13,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {5460#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5453#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:13,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {5460#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5460#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:13,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {5467#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5460#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:13,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {5467#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5467#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:13,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5467#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:13,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#true} call #t~ret6 := main(); {5219#true} is VALID [2022-04-15 12:16:13,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#true} {5219#true} #64#return; {5219#true} is VALID [2022-04-15 12:16:13,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-15 12:16:13,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {5219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {5219#true} is VALID [2022-04-15 12:16:13,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {5219#true} call ULTIMATE.init(); {5219#true} is VALID [2022-04-15 12:16:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:13,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070850043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:13,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:13,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-15 12:16:13,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:13,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1010510529] [2022-04-15 12:16:13,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1010510529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:13,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:13,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:16:13,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361121418] [2022-04-15 12:16:13,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:13,955 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 12:16:13,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:13,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:13,975 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:13,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:16:13,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:13,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:16:13,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:16:13,976 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:14,513 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-15 12:16:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:16:14,513 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 12:16:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2022-04-15 12:16:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2022-04-15 12:16:14,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 118 transitions. [2022-04-15 12:16:14,598 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:16:14,599 INFO L225 Difference]: With dead ends: 103 [2022-04-15 12:16:14,599 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 12:16:14,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=486, Invalid=636, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:16:14,600 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 205 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:14,600 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 27 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:14,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 12:16:14,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 44. [2022-04-15 12:16:14,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:14,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,660 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,660 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:14,661 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2022-04-15 12:16:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2022-04-15 12:16:14,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:14,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:14,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-15 12:16:14,662 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-15 12:16:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:14,663 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2022-04-15 12:16:14,663 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2022-04-15 12:16:14,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:14,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:14,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:14,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-15 12:16:14,664 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 41 [2022-04-15 12:16:14,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:14,664 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-15 12:16:14,664 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:14,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2022-04-15 12:16:14,719 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:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-15 12:16:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 12:16:14,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:14,720 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:14,739 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:14,931 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:14,932 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:14,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:14,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1710520041, now seen corresponding path program 21 times [2022-04-15 12:16:14,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:14,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119754174] [2022-04-15 12:16:14,936 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:14,936 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1710520041, now seen corresponding path program 22 times [2022-04-15 12:16:14,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:14,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828019152] [2022-04-15 12:16:14,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:14,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:15,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {5993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {5977#true} is VALID [2022-04-15 12:16:15,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {5977#true} assume true; {5977#true} is VALID [2022-04-15 12:16:15,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5977#true} {5977#true} #64#return; {5977#true} is VALID [2022-04-15 12:16:15,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {5977#true} call ULTIMATE.init(); {5993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:15,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {5993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {5977#true} is VALID [2022-04-15 12:16:15,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {5977#true} assume true; {5977#true} is VALID [2022-04-15 12:16:15,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5977#true} {5977#true} #64#return; {5977#true} is VALID [2022-04-15 12:16:15,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {5977#true} call #t~ret6 := main(); {5977#true} is VALID [2022-04-15 12:16:15,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {5977#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5982#(= main_~i~0 0)} is VALID [2022-04-15 12:16:15,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {5982#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5982#(= main_~i~0 0)} is VALID [2022-04-15 12:16:15,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {5982#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5983#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:15,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {5983#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5983#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:15,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {5983#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5984#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:15,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {5984#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5984#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:15,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {5984#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5985#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:15,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {5985#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5985#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:15,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {5985#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5986#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:15,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {5986#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5986#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:15,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {5986#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5987#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:15,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {5987#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5987#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:15,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {5987#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5988#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:15,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {5988#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5988#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:15,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {5988#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5989#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:15,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {5989#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5989#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:15,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {5989#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5990#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:15,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {5990#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5990#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:15,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {5990#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5991#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:15,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {5991#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5991#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:15,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {5991#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5992#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:15,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {5992#(<= main_~i~0 10)} assume !(~i~0 < 1024); {5978#false} is VALID [2022-04-15 12:16:15,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {5978#false} ~i~0 := 0; {5978#false} is VALID [2022-04-15 12:16:15,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 12:16:15,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 12:16:15,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 12:16:15,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-15 12:16:15,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 12:16:15,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 12:16:15,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 12:16:15,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-15 12:16:15,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 12:16:15,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 12:16:15,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {5978#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 12:16:15,059 INFO L272 TraceCheckUtils]: 39: Hoare triple {5978#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5978#false} is VALID [2022-04-15 12:16:15,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {5978#false} ~cond := #in~cond; {5978#false} is VALID [2022-04-15 12:16:15,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {5978#false} assume 0 == ~cond; {5978#false} is VALID [2022-04-15 12:16:15,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {5978#false} assume !false; {5978#false} is VALID [2022-04-15 12:16:15,060 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:15,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:15,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828019152] [2022-04-15 12:16:15,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828019152] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:15,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804154700] [2022-04-15 12:16:15,060 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:15,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:15,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:15,061 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:15,062 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:15,121 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:15,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:15,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:16:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:15,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:15,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {5977#true} call ULTIMATE.init(); {5977#true} is VALID [2022-04-15 12:16:15,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {5977#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {5977#true} is VALID [2022-04-15 12:16:15,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {5977#true} assume true; {5977#true} is VALID [2022-04-15 12:16:15,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5977#true} {5977#true} #64#return; {5977#true} is VALID [2022-04-15 12:16:15,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {5977#true} call #t~ret6 := main(); {5977#true} is VALID [2022-04-15 12:16:15,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {5977#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6012#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:15,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {6012#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6012#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:15,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {6012#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5983#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:15,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {5983#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5983#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:15,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {5983#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5984#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:15,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {5984#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5984#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:15,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {5984#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5985#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:15,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {5985#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5985#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:15,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {5985#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5986#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:15,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {5986#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5986#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:15,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {5986#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5987#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:15,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {5987#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5987#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:15,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {5987#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5988#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:15,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {5988#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5988#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:15,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {5988#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5989#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:15,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {5989#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5989#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:15,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {5989#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5990#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:15,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {5990#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5990#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:15,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {5990#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5991#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:15,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {5991#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5991#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:15,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {5991#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5992#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:15,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {5992#(<= main_~i~0 10)} assume !(~i~0 < 1024); {5978#false} is VALID [2022-04-15 12:16:15,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {5978#false} ~i~0 := 0; {5978#false} is VALID [2022-04-15 12:16:15,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 12:16:15,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 12:16:15,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 12:16:15,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-15 12:16:15,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 12:16:15,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 12:16:15,285 INFO L290 TraceCheckUtils]: 34: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 12:16:15,285 INFO L290 TraceCheckUtils]: 35: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-15 12:16:15,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 12:16:15,286 INFO L290 TraceCheckUtils]: 37: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 12:16:15,286 INFO L290 TraceCheckUtils]: 38: Hoare triple {5978#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 12:16:15,286 INFO L272 TraceCheckUtils]: 39: Hoare triple {5978#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5978#false} is VALID [2022-04-15 12:16:15,286 INFO L290 TraceCheckUtils]: 40: Hoare triple {5978#false} ~cond := #in~cond; {5978#false} is VALID [2022-04-15 12:16:15,286 INFO L290 TraceCheckUtils]: 41: Hoare triple {5978#false} assume 0 == ~cond; {5978#false} is VALID [2022-04-15 12:16:15,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {5978#false} assume !false; {5978#false} is VALID [2022-04-15 12:16:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:15,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:15,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {5978#false} assume !false; {5978#false} is VALID [2022-04-15 12:16:15,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {5978#false} assume 0 == ~cond; {5978#false} is VALID [2022-04-15 12:16:15,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {5978#false} ~cond := #in~cond; {5978#false} is VALID [2022-04-15 12:16:15,573 INFO L272 TraceCheckUtils]: 39: Hoare triple {5978#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5978#false} is VALID [2022-04-15 12:16:15,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {5978#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 12:16:15,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 12:16:15,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 12:16:15,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-15 12:16:15,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 12:16:15,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 12:16:15,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 12:16:15,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-15 12:16:15,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 12:16:15,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 12:16:15,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 12:16:15,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {5978#false} ~i~0 := 0; {5978#false} is VALID [2022-04-15 12:16:15,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {6172#(< main_~i~0 1024)} assume !(~i~0 < 1024); {5978#false} is VALID [2022-04-15 12:16:15,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {6176#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6172#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:15,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {6176#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6176#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:15,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {6183#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6176#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:15,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {6183#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6183#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:15,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {6190#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6183#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:15,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {6190#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6190#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:15,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {6197#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6190#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:15,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {6197#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6197#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:15,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {6204#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6197#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:15,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {6204#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6204#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:15,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {6211#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6204#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:15,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {6211#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6211#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:15,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {6218#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6211#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:15,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {6218#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6218#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:15,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {6225#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6218#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:15,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {6225#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6225#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:15,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {6232#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6225#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:15,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {6232#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6232#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:15,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {6239#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6232#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:15,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {6239#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6239#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:15,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {5977#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6239#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:15,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {5977#true} call #t~ret6 := main(); {5977#true} is VALID [2022-04-15 12:16:15,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5977#true} {5977#true} #64#return; {5977#true} is VALID [2022-04-15 12:16:15,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {5977#true} assume true; {5977#true} is VALID [2022-04-15 12:16:15,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {5977#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {5977#true} is VALID [2022-04-15 12:16:15,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {5977#true} call ULTIMATE.init(); {5977#true} is VALID [2022-04-15 12:16:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:15,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804154700] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:15,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:15,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-15 12:16:15,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:15,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119754174] [2022-04-15 12:16:15,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119754174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:15,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:15,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:16:15,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196243338] [2022-04-15 12:16:15,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:15,582 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 12:16:15,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:15,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:15,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:15,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:16:15,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:15,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:16:15,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:16:15,605 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:16,295 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2022-04-15 12:16:16,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:16:16,295 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 12:16:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:16,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2022-04-15 12:16:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2022-04-15 12:16:16,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 127 transitions. [2022-04-15 12:16:16,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:16,382 INFO L225 Difference]: With dead ends: 110 [2022-04-15 12:16:16,382 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 12:16:16,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=578, Invalid=754, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:16:16,383 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 198 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:16,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 37 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:16,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 12:16:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 46. [2022-04-15 12:16:16,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:16,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:16,438 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:16,438 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:16,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:16,439 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-04-15 12:16:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-04-15 12:16:16,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:16,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:16,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-15 12:16:16,440 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-15 12:16:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:16,441 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-04-15 12:16:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-04-15 12:16:16,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:16,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:16,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:16,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-15 12:16:16,443 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 43 [2022-04-15 12:16:16,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:16,444 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-15 12:16:16,444 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call 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,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 50 transitions. [2022-04-15 12:16:16,489 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:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-15 12:16:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 12:16:16,490 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:16,490 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:16,509 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:16,695 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:16,695 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:16,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:16,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1777666041, now seen corresponding path program 23 times [2022-04-15 12:16:16,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:16,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [941306119] [2022-04-15 12:16:16,700 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:16,700 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:16,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1777666041, now seen corresponding path program 24 times [2022-04-15 12:16:16,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:16,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812088779] [2022-04-15 12:16:16,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:16,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:16,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {6800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {6783#true} is VALID [2022-04-15 12:16:16,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {6783#true} assume true; {6783#true} is VALID [2022-04-15 12:16:16,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6783#true} {6783#true} #64#return; {6783#true} is VALID [2022-04-15 12:16:16,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {6783#true} call ULTIMATE.init(); {6800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:16,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {6800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {6783#true} is VALID [2022-04-15 12:16:16,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {6783#true} assume true; {6783#true} is VALID [2022-04-15 12:16:16,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6783#true} {6783#true} #64#return; {6783#true} is VALID [2022-04-15 12:16:16,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {6783#true} call #t~ret6 := main(); {6783#true} is VALID [2022-04-15 12:16:16,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {6783#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6788#(= main_~i~0 0)} is VALID [2022-04-15 12:16:16,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {6788#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6788#(= main_~i~0 0)} is VALID [2022-04-15 12:16:16,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {6788#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6789#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:16,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {6789#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6789#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:16,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {6789#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6790#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:16,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {6790#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6790#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:16,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {6790#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6791#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:16,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {6791#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6791#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:16,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {6791#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6792#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:16,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {6792#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6792#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:16,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {6792#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6793#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:16,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {6793#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6793#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:16,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {6793#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6794#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:16,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {6794#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6794#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:16,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {6794#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6795#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:16,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {6795#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6795#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:16,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {6795#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6796#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:16,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {6796#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6796#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:16,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {6796#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6797#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:16,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {6797#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6797#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:16,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {6797#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6798#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:16,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {6798#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6798#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:16,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {6798#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6799#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:16,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {6799#(<= main_~i~0 11)} assume !(~i~0 < 1024); {6784#false} is VALID [2022-04-15 12:16:16,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {6784#false} ~i~0 := 0; {6784#false} is VALID [2022-04-15 12:16:16,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {6784#false} #t~short5 := ~i~0 < 1024; {6784#false} is VALID [2022-04-15 12:16:16,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {6784#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6784#false} is VALID [2022-04-15 12:16:16,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {6784#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6784#false} is VALID [2022-04-15 12:16:16,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {6784#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6784#false} is VALID [2022-04-15 12:16:16,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {6784#false} #t~short5 := ~i~0 < 1024; {6784#false} is VALID [2022-04-15 12:16:16,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {6784#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6784#false} is VALID [2022-04-15 12:16:16,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {6784#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6784#false} is VALID [2022-04-15 12:16:16,841 INFO L290 TraceCheckUtils]: 37: Hoare triple {6784#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6784#false} is VALID [2022-04-15 12:16:16,841 INFO L290 TraceCheckUtils]: 38: Hoare triple {6784#false} #t~short5 := ~i~0 < 1024; {6784#false} is VALID [2022-04-15 12:16:16,841 INFO L290 TraceCheckUtils]: 39: Hoare triple {6784#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6784#false} is VALID [2022-04-15 12:16:16,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {6784#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {6784#false} is VALID [2022-04-15 12:16:16,841 INFO L272 TraceCheckUtils]: 41: Hoare triple {6784#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {6784#false} is VALID [2022-04-15 12:16:16,841 INFO L290 TraceCheckUtils]: 42: Hoare triple {6784#false} ~cond := #in~cond; {6784#false} is VALID [2022-04-15 12:16:16,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {6784#false} assume 0 == ~cond; {6784#false} is VALID [2022-04-15 12:16:16,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {6784#false} assume !false; {6784#false} is VALID [2022-04-15 12:16:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:16,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:16,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812088779] [2022-04-15 12:16:16,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812088779] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:16,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115505405] [2022-04-15 12:16:16,842 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:16,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:16,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:16,843 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:16,844 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:16,899 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:16:16,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:16,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:16,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:17,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {6783#true} call ULTIMATE.init(); {6783#true} is VALID [2022-04-15 12:16:17,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {6783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {6783#true} is VALID [2022-04-15 12:16:17,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {6783#true} assume true; {6783#true} is VALID [2022-04-15 12:16:17,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6783#true} {6783#true} #64#return; {6783#true} is VALID [2022-04-15 12:16:17,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {6783#true} call #t~ret6 := main(); {6783#true} is VALID [2022-04-15 12:16:17,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {6783#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6783#true} is VALID [2022-04-15 12:16:17,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {6783#true} assume !(~i~0 < 1024); {6783#true} is VALID [2022-04-15 12:16:17,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {6783#true} ~i~0 := 0; {6891#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:17,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {6891#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {6891#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:17,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {6891#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6891#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:17,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {6891#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6891#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:17,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {6891#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6789#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:17,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {6789#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {6789#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:17,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {6789#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6789#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:17,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {6789#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6789#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:17,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {6789#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6790#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:17,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {6790#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {6790#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:17,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {6790#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6790#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:17,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {6790#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {6790#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:17,052 INFO L272 TraceCheckUtils]: 41: Hoare triple {6790#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {6928#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:17,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {6928#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6932#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:17,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {6932#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6784#false} is VALID [2022-04-15 12:16:17,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {6784#false} assume !false; {6784#false} is VALID [2022-04-15 12:16:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 12:16:17,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:17,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {6784#false} assume !false; {6784#false} is VALID [2022-04-15 12:16:17,211 INFO L290 TraceCheckUtils]: 43: Hoare triple {6932#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6784#false} is VALID [2022-04-15 12:16:17,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {6928#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6932#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:17,211 INFO L272 TraceCheckUtils]: 41: Hoare triple {6948#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {6928#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:17,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {6948#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {6948#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:17,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {6948#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6948#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:17,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {6948#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {6948#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:17,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {6961#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6948#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:17,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {6961#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6961#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:17,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {6961#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6961#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:17,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {6961#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {6961#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:17,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {6974#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6961#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:17,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {6974#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6974#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:17,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {6974#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6974#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:17,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {6974#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {6974#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:17,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {6783#true} ~i~0 := 0; {6974#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:17,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {6783#true} assume !(~i~0 < 1024); {6783#true} is VALID [2022-04-15 12:16:17,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 12:16:17,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 12:16:17,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {6783#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6783#true} is VALID [2022-04-15 12:16:17,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {6783#true} call #t~ret6 := main(); {6783#true} is VALID [2022-04-15 12:16:17,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6783#true} {6783#true} #64#return; {6783#true} is VALID [2022-04-15 12:16:17,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {6783#true} assume true; {6783#true} is VALID [2022-04-15 12:16:17,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {6783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {6783#true} is VALID [2022-04-15 12:16:17,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {6783#true} call ULTIMATE.init(); {6783#true} is VALID [2022-04-15 12:16:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 12:16:17,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115505405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:17,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:17,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 21 [2022-04-15 12:16:17,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:17,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [941306119] [2022-04-15 12:16:17,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [941306119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:17,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:17,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:16:17,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971983466] [2022-04-15 12:16:17,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:17,218 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 12:16:17,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:17,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:17,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:16:17,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:17,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:16:17,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:16:17,246 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:17,882 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2022-04-15 12:16:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:16:17,882 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 12:16:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 136 transitions. [2022-04-15 12:16:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 136 transitions. [2022-04-15 12:16:17,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 136 transitions. [2022-04-15 12:16:17,983 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:17,984 INFO L225 Difference]: With dead ends: 117 [2022-04-15 12:16:17,984 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 12:16:17,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=376, Invalid=680, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:16:17,985 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 235 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:17,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 32 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:17,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 12:16:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 48. [2022-04-15 12:16:18,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:18,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,059 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,059 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:18,060 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2022-04-15 12:16:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2022-04-15 12:16:18,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:18,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:18,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-15 12:16:18,061 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-15 12:16:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:18,062 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2022-04-15 12:16:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2022-04-15 12:16:18,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:18,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:18,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:18,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:18,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-04-15 12:16:18,063 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 45 [2022-04-15 12:16:18,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:18,064 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-04-15 12:16:18,064 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 52 transitions. [2022-04-15 12:16:18,119 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:18,120 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-15 12:16:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 12:16:18,120 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:18,120 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:18,138 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:18,320 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:18,321 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:18,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:18,321 INFO L85 PathProgramCache]: Analyzing trace with hash 444967333, now seen corresponding path program 25 times [2022-04-15 12:16:18,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:18,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1248021723] [2022-04-15 12:16:18,325 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:18,325 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash 444967333, now seen corresponding path program 26 times [2022-04-15 12:16:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:18,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717175217] [2022-04-15 12:16:18,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:18,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:18,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {7648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {7630#true} is VALID [2022-04-15 12:16:18,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {7630#true} assume true; {7630#true} is VALID [2022-04-15 12:16:18,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7630#true} {7630#true} #64#return; {7630#true} is VALID [2022-04-15 12:16:18,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {7630#true} call ULTIMATE.init(); {7648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:18,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {7648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {7630#true} is VALID [2022-04-15 12:16:18,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {7630#true} assume true; {7630#true} is VALID [2022-04-15 12:16:18,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7630#true} {7630#true} #64#return; {7630#true} is VALID [2022-04-15 12:16:18,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {7630#true} call #t~ret6 := main(); {7630#true} is VALID [2022-04-15 12:16:18,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {7630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7635#(= main_~i~0 0)} is VALID [2022-04-15 12:16:18,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {7635#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7635#(= main_~i~0 0)} is VALID [2022-04-15 12:16:18,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {7635#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7636#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:18,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {7636#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7636#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:18,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {7636#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7637#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:18,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {7637#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7637#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:18,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {7637#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7638#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:18,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {7638#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7638#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:18,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {7638#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7639#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:18,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {7639#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7639#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:18,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {7639#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7640#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:18,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {7640#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7640#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:18,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {7640#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7641#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:18,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {7641#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7641#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:18,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {7641#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7642#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:18,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {7642#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7642#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:18,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {7642#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7643#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:18,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {7643#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7643#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:18,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {7643#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7644#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:18,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {7644#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7644#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:18,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {7644#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7645#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:18,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {7645#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7645#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:18,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {7645#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7646#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:18,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {7646#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7646#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:18,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {7646#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7647#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:18,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {7647#(<= main_~i~0 12)} assume !(~i~0 < 1024); {7631#false} is VALID [2022-04-15 12:16:18,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {7631#false} ~i~0 := 0; {7631#false} is VALID [2022-04-15 12:16:18,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 12:16:18,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 12:16:18,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 12:16:18,489 INFO L290 TraceCheckUtils]: 35: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-15 12:16:18,489 INFO L290 TraceCheckUtils]: 36: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 12:16:18,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 12:16:18,489 INFO L290 TraceCheckUtils]: 38: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 12:16:18,489 INFO L290 TraceCheckUtils]: 39: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-15 12:16:18,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 12:16:18,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 12:16:18,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {7631#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 12:16:18,490 INFO L272 TraceCheckUtils]: 43: Hoare triple {7631#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {7631#false} is VALID [2022-04-15 12:16:18,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {7631#false} ~cond := #in~cond; {7631#false} is VALID [2022-04-15 12:16:18,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {7631#false} assume 0 == ~cond; {7631#false} is VALID [2022-04-15 12:16:18,490 INFO L290 TraceCheckUtils]: 46: Hoare triple {7631#false} assume !false; {7631#false} is VALID [2022-04-15 12:16:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:18,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:18,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717175217] [2022-04-15 12:16:18,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717175217] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:18,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245096912] [2022-04-15 12:16:18,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:18,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:18,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:18,491 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:18,492 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:18,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:18,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:18,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:16:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:18,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:18,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {7630#true} call ULTIMATE.init(); {7630#true} is VALID [2022-04-15 12:16:18,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {7630#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {7630#true} is VALID [2022-04-15 12:16:18,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {7630#true} assume true; {7630#true} is VALID [2022-04-15 12:16:18,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7630#true} {7630#true} #64#return; {7630#true} is VALID [2022-04-15 12:16:18,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {7630#true} call #t~ret6 := main(); {7630#true} is VALID [2022-04-15 12:16:18,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {7630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7667#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:18,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {7667#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7667#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:18,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {7667#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7636#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:18,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {7636#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7636#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:18,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {7636#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7637#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:18,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {7637#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7637#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:18,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {7637#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7638#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:18,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {7638#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7638#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:18,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {7638#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7639#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:18,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {7639#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7639#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:18,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {7639#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7640#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:18,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {7640#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7640#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:18,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {7640#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7641#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:18,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {7641#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7641#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:18,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {7641#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7642#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:18,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {7642#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7642#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:18,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {7642#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7643#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:18,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {7643#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7643#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:18,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {7643#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7644#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:18,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {7644#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7644#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:18,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {7644#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7645#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:18,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {7645#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7645#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:18,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {7645#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7646#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:18,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {7646#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7646#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:18,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {7646#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7647#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:18,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {7647#(<= main_~i~0 12)} assume !(~i~0 < 1024); {7631#false} is VALID [2022-04-15 12:16:18,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {7631#false} ~i~0 := 0; {7631#false} is VALID [2022-04-15 12:16:18,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 12:16:18,776 INFO L290 TraceCheckUtils]: 33: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 12:16:18,776 INFO L290 TraceCheckUtils]: 34: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 12:16:18,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-15 12:16:18,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 12:16:18,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 12:16:18,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 12:16:18,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-15 12:16:18,777 INFO L290 TraceCheckUtils]: 40: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 12:16:18,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 12:16:18,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {7631#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 12:16:18,777 INFO L272 TraceCheckUtils]: 43: Hoare triple {7631#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {7631#false} is VALID [2022-04-15 12:16:18,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {7631#false} ~cond := #in~cond; {7631#false} is VALID [2022-04-15 12:16:18,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {7631#false} assume 0 == ~cond; {7631#false} is VALID [2022-04-15 12:16:18,777 INFO L290 TraceCheckUtils]: 46: Hoare triple {7631#false} assume !false; {7631#false} is VALID [2022-04-15 12:16:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:18,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:19,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {7631#false} assume !false; {7631#false} is VALID [2022-04-15 12:16:19,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {7631#false} assume 0 == ~cond; {7631#false} is VALID [2022-04-15 12:16:19,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {7631#false} ~cond := #in~cond; {7631#false} is VALID [2022-04-15 12:16:19,159 INFO L272 TraceCheckUtils]: 43: Hoare triple {7631#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {7631#false} is VALID [2022-04-15 12:16:19,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {7631#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 12:16:19,159 INFO L290 TraceCheckUtils]: 41: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 12:16:19,159 INFO L290 TraceCheckUtils]: 40: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 12:16:19,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-15 12:16:19,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 12:16:19,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 12:16:19,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 12:16:19,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-15 12:16:19,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 12:16:19,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 12:16:19,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 12:16:19,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {7631#false} ~i~0 := 0; {7631#false} is VALID [2022-04-15 12:16:19,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {7839#(< main_~i~0 1024)} assume !(~i~0 < 1024); {7631#false} is VALID [2022-04-15 12:16:19,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {7843#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7839#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:19,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {7843#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7843#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:19,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {7850#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7843#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:19,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {7850#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7850#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:19,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {7857#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7850#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:19,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {7857#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7857#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:19,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {7864#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7857#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:19,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {7864#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7864#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:19,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {7871#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7864#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:19,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {7871#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7871#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:19,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {7878#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7871#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:19,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {7878#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7878#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:19,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {7885#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7878#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:19,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {7885#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7885#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:19,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {7892#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7885#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:19,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {7892#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7892#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:19,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {7899#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7892#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:19,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {7899#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7899#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:19,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {7906#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7899#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:19,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {7906#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7906#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:19,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {7913#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7906#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:19,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {7913#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7913#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:19,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {7920#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7913#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:19,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {7920#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7920#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:19,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {7630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7920#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:19,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {7630#true} call #t~ret6 := main(); {7630#true} is VALID [2022-04-15 12:16:19,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7630#true} {7630#true} #64#return; {7630#true} is VALID [2022-04-15 12:16:19,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {7630#true} assume true; {7630#true} is VALID [2022-04-15 12:16:19,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {7630#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {7630#true} is VALID [2022-04-15 12:16:19,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {7630#true} call ULTIMATE.init(); {7630#true} is VALID [2022-04-15 12:16:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:19,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245096912] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:19,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:19,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-15 12:16:19,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:19,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1248021723] [2022-04-15 12:16:19,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1248021723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:19,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:19,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:16:19,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657194031] [2022-04-15 12:16:19,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:19,169 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 12:16:19,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:19,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:19,194 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:16:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:19,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:16:19,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:16:19,195 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:19,946 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2022-04-15 12:16:19,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:16:19,946 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 12:16:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:19,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 145 transitions. [2022-04-15 12:16:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 145 transitions. [2022-04-15 12:16:19,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 145 transitions. [2022-04-15 12:16:20,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:20,052 INFO L225 Difference]: With dead ends: 124 [2022-04-15 12:16:20,052 INFO L226 Difference]: Without dead ends: 107 [2022-04-15 12:16:20,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=786, Invalid=1020, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:16:20,053 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 213 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:20,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 42 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-15 12:16:20,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 50. [2022-04-15 12:16:20,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:20,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,148 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,148 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:20,149 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2022-04-15 12:16:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2022-04-15 12:16:20,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:20,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:20,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-15 12:16:20,150 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-15 12:16:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:20,152 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2022-04-15 12:16:20,152 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2022-04-15 12:16:20,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:20,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:20,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:20,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-15 12:16:20,153 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 47 [2022-04-15 12:16:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:20,153 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-15 12:16:20,153 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-15 12:16:20,220 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:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-15 12:16:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 12:16:20,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:20,221 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:20,242 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:20,429 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:20,429 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:20,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:20,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1796893635, now seen corresponding path program 27 times [2022-04-15 12:16:20,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:20,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1166373380] [2022-04-15 12:16:20,434 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:20,434 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:20,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1796893635, now seen corresponding path program 28 times [2022-04-15 12:16:20,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:20,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498855821] [2022-04-15 12:16:20,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:20,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:20,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:20,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {8551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {8532#true} is VALID [2022-04-15 12:16:20,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {8532#true} assume true; {8532#true} is VALID [2022-04-15 12:16:20,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8532#true} {8532#true} #64#return; {8532#true} is VALID [2022-04-15 12:16:20,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {8532#true} call ULTIMATE.init(); {8551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:20,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {8551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {8532#true} is VALID [2022-04-15 12:16:20,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {8532#true} assume true; {8532#true} is VALID [2022-04-15 12:16:20,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8532#true} {8532#true} #64#return; {8532#true} is VALID [2022-04-15 12:16:20,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {8532#true} call #t~ret6 := main(); {8532#true} is VALID [2022-04-15 12:16:20,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {8532#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8537#(= main_~i~0 0)} is VALID [2022-04-15 12:16:20,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {8537#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8537#(= main_~i~0 0)} is VALID [2022-04-15 12:16:20,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {8537#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8538#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:20,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {8538#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8538#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:20,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {8538#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8539#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:20,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {8539#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8539#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:20,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {8539#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8540#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:20,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {8540#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8540#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:20,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {8540#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8541#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:20,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {8541#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8541#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:20,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {8541#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8542#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:20,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {8542#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8542#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:20,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {8542#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8543#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:20,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {8543#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8543#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:20,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {8543#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8544#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:20,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {8544#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8544#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:20,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {8544#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8545#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:20,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {8545#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8545#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:20,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {8545#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8546#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:20,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {8546#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8546#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:20,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {8546#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8547#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:20,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {8547#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8547#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:20,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {8547#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8548#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:20,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {8548#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8548#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:20,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {8548#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8549#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:20,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {8549#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8549#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:20,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {8549#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8550#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:20,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {8550#(<= main_~i~0 13)} assume !(~i~0 < 1024); {8533#false} is VALID [2022-04-15 12:16:20,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {8533#false} ~i~0 := 0; {8533#false} is VALID [2022-04-15 12:16:20,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 12:16:20,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 12:16:20,611 INFO L290 TraceCheckUtils]: 36: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 12:16:20,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-15 12:16:20,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 12:16:20,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 12:16:20,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 12:16:20,612 INFO L290 TraceCheckUtils]: 41: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-15 12:16:20,612 INFO L290 TraceCheckUtils]: 42: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 12:16:20,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 12:16:20,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {8533#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 12:16:20,612 INFO L272 TraceCheckUtils]: 45: Hoare triple {8533#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {8533#false} is VALID [2022-04-15 12:16:20,612 INFO L290 TraceCheckUtils]: 46: Hoare triple {8533#false} ~cond := #in~cond; {8533#false} is VALID [2022-04-15 12:16:20,612 INFO L290 TraceCheckUtils]: 47: Hoare triple {8533#false} assume 0 == ~cond; {8533#false} is VALID [2022-04-15 12:16:20,612 INFO L290 TraceCheckUtils]: 48: Hoare triple {8533#false} assume !false; {8533#false} is VALID [2022-04-15 12:16:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:20,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:20,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498855821] [2022-04-15 12:16:20,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498855821] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:20,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820997828] [2022-04-15 12:16:20,613 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:20,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:20,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:20,614 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:20,615 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:20,686 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:20,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:20,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 12:16:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:20,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:20,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {8532#true} call ULTIMATE.init(); {8532#true} is VALID [2022-04-15 12:16:20,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {8532#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {8532#true} is VALID [2022-04-15 12:16:20,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {8532#true} assume true; {8532#true} is VALID [2022-04-15 12:16:20,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8532#true} {8532#true} #64#return; {8532#true} is VALID [2022-04-15 12:16:20,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {8532#true} call #t~ret6 := main(); {8532#true} is VALID [2022-04-15 12:16:20,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {8532#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8570#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:20,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {8570#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8570#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:20,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {8570#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8538#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:20,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {8538#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8538#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:20,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {8538#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8539#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:20,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {8539#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8539#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:20,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {8539#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8540#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:20,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {8540#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8540#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:20,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {8540#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8541#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:20,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {8541#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8541#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:20,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {8541#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8542#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:20,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {8542#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8542#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:20,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {8542#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8543#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:20,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {8543#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8543#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:20,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {8543#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8544#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:20,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {8544#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8544#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:20,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {8544#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8545#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:20,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {8545#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8545#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:20,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {8545#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8546#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:20,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {8546#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8546#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:20,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {8546#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8547#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:20,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {8547#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8547#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:20,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {8547#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8548#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:20,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {8548#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8548#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:20,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {8548#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8549#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:20,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {8549#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8549#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:20,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {8549#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8550#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:20,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {8550#(<= main_~i~0 13)} assume !(~i~0 < 1024); {8533#false} is VALID [2022-04-15 12:16:20,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {8533#false} ~i~0 := 0; {8533#false} is VALID [2022-04-15 12:16:20,963 INFO L290 TraceCheckUtils]: 34: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 12:16:20,963 INFO L290 TraceCheckUtils]: 35: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 12:16:20,963 INFO L290 TraceCheckUtils]: 36: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 12:16:20,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-15 12:16:20,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 12:16:20,963 INFO L290 TraceCheckUtils]: 39: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 12:16:20,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 12:16:20,963 INFO L290 TraceCheckUtils]: 41: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-15 12:16:20,963 INFO L290 TraceCheckUtils]: 42: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 12:16:20,963 INFO L290 TraceCheckUtils]: 43: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 12:16:20,963 INFO L290 TraceCheckUtils]: 44: Hoare triple {8533#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 12:16:20,963 INFO L272 TraceCheckUtils]: 45: Hoare triple {8533#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {8533#false} is VALID [2022-04-15 12:16:20,964 INFO L290 TraceCheckUtils]: 46: Hoare triple {8533#false} ~cond := #in~cond; {8533#false} is VALID [2022-04-15 12:16:20,964 INFO L290 TraceCheckUtils]: 47: Hoare triple {8533#false} assume 0 == ~cond; {8533#false} is VALID [2022-04-15 12:16:20,964 INFO L290 TraceCheckUtils]: 48: Hoare triple {8533#false} assume !false; {8533#false} is VALID [2022-04-15 12:16:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:20,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:21,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {8533#false} assume !false; {8533#false} is VALID [2022-04-15 12:16:21,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {8533#false} assume 0 == ~cond; {8533#false} is VALID [2022-04-15 12:16:21,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {8533#false} ~cond := #in~cond; {8533#false} is VALID [2022-04-15 12:16:21,366 INFO L272 TraceCheckUtils]: 45: Hoare triple {8533#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {8533#false} is VALID [2022-04-15 12:16:21,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {8533#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 12:16:21,366 INFO L290 TraceCheckUtils]: 43: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 12:16:21,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 12:16:21,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-15 12:16:21,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 12:16:21,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 12:16:21,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 12:16:21,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-15 12:16:21,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 12:16:21,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 12:16:21,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 12:16:21,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {8533#false} ~i~0 := 0; {8533#false} is VALID [2022-04-15 12:16:21,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {8748#(< main_~i~0 1024)} assume !(~i~0 < 1024); {8533#false} is VALID [2022-04-15 12:16:21,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {8752#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8748#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:21,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {8752#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8752#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:21,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {8759#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8752#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:21,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {8759#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8759#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:21,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {8766#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8759#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:21,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {8766#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8766#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:21,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {8773#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8766#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:21,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {8773#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8773#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:21,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {8780#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8773#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:21,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {8780#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8780#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:21,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {8787#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8780#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:21,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {8787#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8787#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:21,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {8794#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8787#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:21,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {8794#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8794#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:21,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {8801#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8794#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:21,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {8801#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8801#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:21,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {8808#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8801#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:21,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {8808#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8808#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:21,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {8815#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8808#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:21,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {8815#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8815#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:21,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {8822#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8815#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:21,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {8822#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8822#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:21,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {8829#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8822#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:21,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {8829#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8829#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:21,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {8836#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8829#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:21,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {8836#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8836#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:21,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {8532#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8836#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:21,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {8532#true} call #t~ret6 := main(); {8532#true} is VALID [2022-04-15 12:16:21,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8532#true} {8532#true} #64#return; {8532#true} is VALID [2022-04-15 12:16:21,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {8532#true} assume true; {8532#true} is VALID [2022-04-15 12:16:21,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {8532#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {8532#true} is VALID [2022-04-15 12:16:21,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {8532#true} call ULTIMATE.init(); {8532#true} is VALID [2022-04-15 12:16:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:21,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820997828] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:21,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:21,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 12:16:21,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:21,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1166373380] [2022-04-15 12:16:21,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1166373380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:21,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:21,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:16:21,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561441449] [2022-04-15 12:16:21,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:21,377 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 12:16:21,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:21,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:21,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:16:21,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:21,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:16:21,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:16:21,403 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:22,316 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2022-04-15 12:16:22,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:16:22,316 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 12:16:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2022-04-15 12:16:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2022-04-15 12:16:22,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 154 transitions. [2022-04-15 12:16:22,424 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:16:22,425 INFO L225 Difference]: With dead ends: 131 [2022-04-15 12:16:22,425 INFO L226 Difference]: Without dead ends: 114 [2022-04-15 12:16:22,426 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=902, Invalid=1168, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:16:22,427 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 348 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:22,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 27 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:22,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-15 12:16:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 52. [2022-04-15 12:16:22,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:22,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,523 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,523 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:22,525 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2022-04-15 12:16:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 142 transitions. [2022-04-15 12:16:22,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:22,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:22,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-15 12:16:22,525 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-15 12:16:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:22,530 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2022-04-15 12:16:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 142 transitions. [2022-04-15 12:16:22,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:22,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:22,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:22,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-15 12:16:22,531 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 49 [2022-04-15 12:16:22,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:22,531 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-15 12:16:22,531 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-15 12:16:22,596 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:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-15 12:16:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:16:22,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:22,597 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:22,629 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:22,811 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:22,811 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:22,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash -377020831, now seen corresponding path program 29 times [2022-04-15 12:16:22,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:22,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [832014792] [2022-04-15 12:16:22,817 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:22,817 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:22,817 INFO L85 PathProgramCache]: Analyzing trace with hash -377020831, now seen corresponding path program 30 times [2022-04-15 12:16:22,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:22,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253076547] [2022-04-15 12:16:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:22,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:22,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:22,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {9502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {9482#true} is VALID [2022-04-15 12:16:22,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {9482#true} assume true; {9482#true} is VALID [2022-04-15 12:16:22,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9482#true} {9482#true} #64#return; {9482#true} is VALID [2022-04-15 12:16:22,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {9482#true} call ULTIMATE.init(); {9502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:22,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {9502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {9482#true} is VALID [2022-04-15 12:16:22,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {9482#true} assume true; {9482#true} is VALID [2022-04-15 12:16:22,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9482#true} {9482#true} #64#return; {9482#true} is VALID [2022-04-15 12:16:22,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {9482#true} call #t~ret6 := main(); {9482#true} is VALID [2022-04-15 12:16:22,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {9482#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9487#(= main_~i~0 0)} is VALID [2022-04-15 12:16:22,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {9487#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9487#(= main_~i~0 0)} is VALID [2022-04-15 12:16:22,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {9487#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:22,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {9488#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9488#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:22,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {9488#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9489#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:22,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {9489#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9489#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:22,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {9489#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9490#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:22,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {9490#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9490#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:22,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {9490#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9491#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:22,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {9491#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9491#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:22,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {9491#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9492#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:22,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {9492#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9492#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:22,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {9492#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9493#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:22,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {9493#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9493#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:22,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {9493#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9494#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:22,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {9494#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9494#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:22,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {9494#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9495#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:22,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {9495#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9495#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:22,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {9495#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9496#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:22,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {9496#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9496#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:22,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {9496#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9497#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:22,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {9497#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9497#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:22,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {9497#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9498#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:22,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {9498#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9498#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:22,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {9498#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9499#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:22,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {9499#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9499#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:22,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {9499#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9500#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:22,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {9500#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9500#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:23,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {9500#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9501#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:23,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {9501#(<= main_~i~0 14)} assume !(~i~0 < 1024); {9483#false} is VALID [2022-04-15 12:16:23,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {9483#false} ~i~0 := 0; {9483#false} is VALID [2022-04-15 12:16:23,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {9483#false} #t~short5 := ~i~0 < 1024; {9483#false} is VALID [2022-04-15 12:16:23,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {9483#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9483#false} is VALID [2022-04-15 12:16:23,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {9483#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9483#false} is VALID [2022-04-15 12:16:23,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {9483#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9483#false} is VALID [2022-04-15 12:16:23,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {9483#false} #t~short5 := ~i~0 < 1024; {9483#false} is VALID [2022-04-15 12:16:23,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {9483#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9483#false} is VALID [2022-04-15 12:16:23,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {9483#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9483#false} is VALID [2022-04-15 12:16:23,001 INFO L290 TraceCheckUtils]: 43: Hoare triple {9483#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9483#false} is VALID [2022-04-15 12:16:23,001 INFO L290 TraceCheckUtils]: 44: Hoare triple {9483#false} #t~short5 := ~i~0 < 1024; {9483#false} is VALID [2022-04-15 12:16:23,001 INFO L290 TraceCheckUtils]: 45: Hoare triple {9483#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9483#false} is VALID [2022-04-15 12:16:23,001 INFO L290 TraceCheckUtils]: 46: Hoare triple {9483#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {9483#false} is VALID [2022-04-15 12:16:23,001 INFO L272 TraceCheckUtils]: 47: Hoare triple {9483#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {9483#false} is VALID [2022-04-15 12:16:23,001 INFO L290 TraceCheckUtils]: 48: Hoare triple {9483#false} ~cond := #in~cond; {9483#false} is VALID [2022-04-15 12:16:23,001 INFO L290 TraceCheckUtils]: 49: Hoare triple {9483#false} assume 0 == ~cond; {9483#false} is VALID [2022-04-15 12:16:23,001 INFO L290 TraceCheckUtils]: 50: Hoare triple {9483#false} assume !false; {9483#false} is VALID [2022-04-15 12:16:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:23,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:23,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253076547] [2022-04-15 12:16:23,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253076547] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:23,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945385374] [2022-04-15 12:16:23,002 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:23,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:23,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:23,003 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:23,004 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:23,074 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:16:23,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:23,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:23,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:23,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {9482#true} call ULTIMATE.init(); {9482#true} is VALID [2022-04-15 12:16:23,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {9482#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {9482#true} is VALID [2022-04-15 12:16:23,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {9482#true} assume true; {9482#true} is VALID [2022-04-15 12:16:23,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9482#true} {9482#true} #64#return; {9482#true} is VALID [2022-04-15 12:16:23,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {9482#true} call #t~ret6 := main(); {9482#true} is VALID [2022-04-15 12:16:23,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {9482#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9482#true} is VALID [2022-04-15 12:16:23,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {9482#true} assume !(~i~0 < 1024); {9482#true} is VALID [2022-04-15 12:16:23,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {9482#true} ~i~0 := 0; {9611#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:23,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {9611#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {9611#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:23,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {9611#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9611#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:23,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {9611#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9611#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:23,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {9611#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:23,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {9488#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {9488#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:23,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {9488#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9488#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:23,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {9488#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9488#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:23,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {9488#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9489#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:23,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {9489#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {9489#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:23,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {9489#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9489#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:23,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {9489#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {9489#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:23,245 INFO L272 TraceCheckUtils]: 47: Hoare triple {9489#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {9648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:23,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {9648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:23,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {9652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9483#false} is VALID [2022-04-15 12:16:23,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {9483#false} assume !false; {9483#false} is VALID [2022-04-15 12:16:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-15 12:16:23,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:23,431 INFO L290 TraceCheckUtils]: 50: Hoare triple {9483#false} assume !false; {9483#false} is VALID [2022-04-15 12:16:23,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {9652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9483#false} is VALID [2022-04-15 12:16:23,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {9648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:23,432 INFO L272 TraceCheckUtils]: 47: Hoare triple {9668#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {9648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:23,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {9668#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {9668#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:23,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {9668#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9668#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:23,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {9668#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {9668#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:23,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {9681#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9668#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:23,434 INFO L290 TraceCheckUtils]: 42: Hoare triple {9681#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9681#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:23,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {9681#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9681#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:23,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {9681#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {9681#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:23,435 INFO L290 TraceCheckUtils]: 39: Hoare triple {9694#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9681#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:23,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {9694#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9694#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:23,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {9694#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9694#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:23,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {9694#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {9694#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:23,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {9482#true} ~i~0 := 0; {9694#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:23,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {9482#true} assume !(~i~0 < 1024); {9482#true} is VALID [2022-04-15 12:16:23,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 12:16:23,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 12:16:23,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {9482#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9482#true} is VALID [2022-04-15 12:16:23,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {9482#true} call #t~ret6 := main(); {9482#true} is VALID [2022-04-15 12:16:23,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9482#true} {9482#true} #64#return; {9482#true} is VALID [2022-04-15 12:16:23,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {9482#true} assume true; {9482#true} is VALID [2022-04-15 12:16:23,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {9482#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {9482#true} is VALID [2022-04-15 12:16:23,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {9482#true} call ULTIMATE.init(); {9482#true} is VALID [2022-04-15 12:16:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-15 12:16:23,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945385374] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:23,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:23,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 24 [2022-04-15 12:16:23,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:23,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [832014792] [2022-04-15 12:16:23,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [832014792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:23,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:23,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:16:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216707322] [2022-04-15 12:16:23,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:23,445 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 12:16:23,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:23,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,476 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:23,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:16:23,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:23,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:16:23,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:16:23,477 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:24,449 INFO L93 Difference]: Finished difference Result 138 states and 172 transitions. [2022-04-15 12:16:24,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:16:24,449 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 12:16:24,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 163 transitions. [2022-04-15 12:16:24,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 163 transitions. [2022-04-15 12:16:24,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 163 transitions. [2022-04-15 12:16:24,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:24,593 INFO L225 Difference]: With dead ends: 138 [2022-04-15 12:16:24,593 INFO L226 Difference]: Without dead ends: 121 [2022-04-15 12:16:24,594 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=532, Invalid=950, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:16:24,594 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 275 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:24,594 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 37 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:24,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-15 12:16:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 54. [2022-04-15 12:16:24,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:24,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,726 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,727 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:24,729 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-15 12:16:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-15 12:16:24,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:24,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:24,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-15 12:16:24,730 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-15 12:16:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:24,732 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-15 12:16:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-15 12:16:24,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:24,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:24,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:24,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-15 12:16:24,734 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 51 [2022-04-15 12:16:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:24,734 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-15 12:16:24,734 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 58 transitions. [2022-04-15 12:16:24,812 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:24,812 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-15 12:16:24,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 12:16:24,813 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:24,813 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:24,838 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:25,035 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:25,036 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2140250495, now seen corresponding path program 31 times [2022-04-15 12:16:25,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:25,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [501814914] [2022-04-15 12:16:25,041 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:25,041 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:25,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2140250495, now seen corresponding path program 32 times [2022-04-15 12:16:25,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:25,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152964395] [2022-04-15 12:16:25,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:25,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:25,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:25,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {10491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {10470#true} is VALID [2022-04-15 12:16:25,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {10470#true} assume true; {10470#true} is VALID [2022-04-15 12:16:25,238 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10470#true} {10470#true} #64#return; {10470#true} is VALID [2022-04-15 12:16:25,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {10470#true} call ULTIMATE.init(); {10491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:25,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {10491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {10470#true} is VALID [2022-04-15 12:16:25,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {10470#true} assume true; {10470#true} is VALID [2022-04-15 12:16:25,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10470#true} {10470#true} #64#return; {10470#true} is VALID [2022-04-15 12:16:25,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {10470#true} call #t~ret6 := main(); {10470#true} is VALID [2022-04-15 12:16:25,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {10470#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10475#(= main_~i~0 0)} is VALID [2022-04-15 12:16:25,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {10475#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10475#(= main_~i~0 0)} is VALID [2022-04-15 12:16:25,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {10475#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10476#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:25,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {10476#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10476#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:25,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {10476#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10477#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:25,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {10477#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10477#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:25,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {10477#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10478#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:25,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {10478#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10478#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:25,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {10478#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10479#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:25,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {10479#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10479#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:25,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {10479#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10480#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:25,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {10480#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10480#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:25,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {10480#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10481#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:25,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {10481#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10481#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:25,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {10481#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10482#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:25,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {10482#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10482#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:25,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {10482#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10483#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:25,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {10483#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10483#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:25,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {10483#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10484#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:25,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {10484#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10484#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:25,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {10484#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10485#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:25,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {10485#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10485#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:25,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {10485#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10486#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:25,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {10486#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10486#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:25,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {10486#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10487#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:25,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {10487#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10487#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:25,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {10487#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10488#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:25,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {10488#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10488#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:25,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {10488#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10489#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:25,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {10489#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10489#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:25,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {10489#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10490#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:25,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {10490#(<= main_~i~0 15)} assume !(~i~0 < 1024); {10471#false} is VALID [2022-04-15 12:16:25,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {10471#false} ~i~0 := 0; {10471#false} is VALID [2022-04-15 12:16:25,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 12:16:25,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 12:16:25,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 12:16:25,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-15 12:16:25,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 12:16:25,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 12:16:25,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 12:16:25,253 INFO L290 TraceCheckUtils]: 45: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-15 12:16:25,253 INFO L290 TraceCheckUtils]: 46: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 12:16:25,253 INFO L290 TraceCheckUtils]: 47: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 12:16:25,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {10471#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 12:16:25,253 INFO L272 TraceCheckUtils]: 49: Hoare triple {10471#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {10471#false} is VALID [2022-04-15 12:16:25,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {10471#false} ~cond := #in~cond; {10471#false} is VALID [2022-04-15 12:16:25,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {10471#false} assume 0 == ~cond; {10471#false} is VALID [2022-04-15 12:16:25,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {10471#false} assume !false; {10471#false} is VALID [2022-04-15 12:16:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:25,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:25,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152964395] [2022-04-15 12:16:25,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152964395] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:25,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275795614] [2022-04-15 12:16:25,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:25,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:25,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:25,255 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:25,257 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:25,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:25,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:25,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 12:16:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:25,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:25,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {10470#true} call ULTIMATE.init(); {10470#true} is VALID [2022-04-15 12:16:25,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {10470#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {10470#true} is VALID [2022-04-15 12:16:25,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {10470#true} assume true; {10470#true} is VALID [2022-04-15 12:16:25,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10470#true} {10470#true} #64#return; {10470#true} is VALID [2022-04-15 12:16:25,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {10470#true} call #t~ret6 := main(); {10470#true} is VALID [2022-04-15 12:16:25,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {10470#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10510#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:25,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {10510#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10510#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:25,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {10510#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10476#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:25,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {10476#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10476#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:25,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {10476#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10477#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:25,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {10477#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10477#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:25,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {10477#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10478#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:25,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {10478#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10478#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:25,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {10478#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10479#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:25,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {10479#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10479#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:25,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {10479#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10480#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:25,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {10480#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10480#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:25,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {10480#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10481#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:25,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {10481#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10481#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:25,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {10481#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10482#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:25,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {10482#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10482#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:25,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {10482#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10483#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:25,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {10483#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10483#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:25,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {10483#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10484#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:25,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {10484#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10484#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:25,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {10484#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10485#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:25,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {10485#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10485#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:25,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {10485#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10486#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:25,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {10486#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10486#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:25,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {10486#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10487#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:25,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {10487#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10487#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:25,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {10487#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10488#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:25,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {10488#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10488#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:25,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {10488#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10489#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:25,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {10489#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10489#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:25,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {10489#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10490#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:25,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {10490#(<= main_~i~0 15)} assume !(~i~0 < 1024); {10471#false} is VALID [2022-04-15 12:16:25,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {10471#false} ~i~0 := 0; {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L290 TraceCheckUtils]: 44: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L290 TraceCheckUtils]: 45: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L290 TraceCheckUtils]: 46: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L290 TraceCheckUtils]: 47: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {10471#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L272 TraceCheckUtils]: 49: Hoare triple {10471#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L290 TraceCheckUtils]: 50: Hoare triple {10471#false} ~cond := #in~cond; {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L290 TraceCheckUtils]: 51: Hoare triple {10471#false} assume 0 == ~cond; {10471#false} is VALID [2022-04-15 12:16:25,599 INFO L290 TraceCheckUtils]: 52: Hoare triple {10471#false} assume !false; {10471#false} is VALID [2022-04-15 12:16:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:25,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:26,127 INFO L290 TraceCheckUtils]: 52: Hoare triple {10471#false} assume !false; {10471#false} is VALID [2022-04-15 12:16:26,127 INFO L290 TraceCheckUtils]: 51: Hoare triple {10471#false} assume 0 == ~cond; {10471#false} is VALID [2022-04-15 12:16:26,127 INFO L290 TraceCheckUtils]: 50: Hoare triple {10471#false} ~cond := #in~cond; {10471#false} is VALID [2022-04-15 12:16:26,127 INFO L272 TraceCheckUtils]: 49: Hoare triple {10471#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {10471#false} is VALID [2022-04-15 12:16:26,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {10471#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 12:16:26,127 INFO L290 TraceCheckUtils]: 47: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 12:16:26,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 12:16:26,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-15 12:16:26,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 12:16:26,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 12:16:26,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 12:16:26,128 INFO L290 TraceCheckUtils]: 41: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-15 12:16:26,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 12:16:26,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 12:16:26,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 12:16:26,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {10471#false} ~i~0 := 0; {10471#false} is VALID [2022-04-15 12:16:26,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {10700#(< main_~i~0 1024)} assume !(~i~0 < 1024); {10471#false} is VALID [2022-04-15 12:16:26,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {10704#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10700#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:26,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {10704#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10704#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:26,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {10711#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10704#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:26,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {10711#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10711#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:26,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {10718#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10711#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:26,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {10718#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10718#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:26,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {10725#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10718#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:26,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {10725#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10725#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:26,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {10732#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10725#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:26,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {10732#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10732#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:26,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {10739#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10732#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:26,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {10739#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10739#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:26,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {10746#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10739#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:26,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {10746#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10746#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {10753#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10746#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {10753#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10753#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:26,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {10760#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10753#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {10760#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10760#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {10767#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10760#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:26,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {10767#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10767#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:26,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {10774#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10767#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:26,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {10774#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10774#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:26,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {10781#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10774#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:26,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {10781#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10781#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:26,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {10788#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10781#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:26,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {10788#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10788#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:26,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {10795#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10788#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:26,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {10795#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10795#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:26,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {10802#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10795#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:26,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {10802#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10802#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:26,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {10470#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10802#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:26,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {10470#true} call #t~ret6 := main(); {10470#true} is VALID [2022-04-15 12:16:26,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10470#true} {10470#true} #64#return; {10470#true} is VALID [2022-04-15 12:16:26,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {10470#true} assume true; {10470#true} is VALID [2022-04-15 12:16:26,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {10470#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {10470#true} is VALID [2022-04-15 12:16:26,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {10470#true} call ULTIMATE.init(); {10470#true} is VALID [2022-04-15 12:16:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:26,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275795614] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:26,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:26,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-15 12:16:26,139 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:26,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [501814914] [2022-04-15 12:16:26,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [501814914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:26,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:26,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:16:26,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797928778] [2022-04-15 12:16:26,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:26,139 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 12:16:26,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:26,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:26,166 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:26,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:16:26,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:26,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:16:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:16:26,167 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:27,373 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2022-04-15 12:16:27,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:16:27,373 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 12:16:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 172 transitions. [2022-04-15 12:16:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 172 transitions. [2022-04-15 12:16:27,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 172 transitions. [2022-04-15 12:16:27,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:27,511 INFO L225 Difference]: With dead ends: 145 [2022-04-15 12:16:27,511 INFO L226 Difference]: Without dead ends: 128 [2022-04-15 12:16:27,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1158, Invalid=1494, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 12:16:27,512 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 294 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:27,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 37 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:27,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-15 12:16:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 56. [2022-04-15 12:16:27,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:27,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,617 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,618 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:27,619 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-04-15 12:16:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-04-15 12:16:27,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:27,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:27,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 128 states. [2022-04-15 12:16:27,620 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 128 states. [2022-04-15 12:16:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:27,622 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-04-15 12:16:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-04-15 12:16:27,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:27,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:27,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:27,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-15 12:16:27,624 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 53 [2022-04-15 12:16:27,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:27,624 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-15 12:16:27,624 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-15 12:16:27,704 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:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-15 12:16:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 12:16:27,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:27,705 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:27,730 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:27,906 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:27,907 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:27,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:27,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1123560163, now seen corresponding path program 33 times [2022-04-15 12:16:27,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:27,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855546151] [2022-04-15 12:16:27,912 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:27,913 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:27,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1123560163, now seen corresponding path program 34 times [2022-04-15 12:16:27,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:27,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684411385] [2022-04-15 12:16:27,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:27,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:28,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {11538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {11516#true} is VALID [2022-04-15 12:16:28,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {11516#true} assume true; {11516#true} is VALID [2022-04-15 12:16:28,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11516#true} {11516#true} #64#return; {11516#true} is VALID [2022-04-15 12:16:28,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {11516#true} call ULTIMATE.init(); {11538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:28,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {11538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {11516#true} is VALID [2022-04-15 12:16:28,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {11516#true} assume true; {11516#true} is VALID [2022-04-15 12:16:28,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11516#true} {11516#true} #64#return; {11516#true} is VALID [2022-04-15 12:16:28,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {11516#true} call #t~ret6 := main(); {11516#true} is VALID [2022-04-15 12:16:28,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {11516#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11521#(= main_~i~0 0)} is VALID [2022-04-15 12:16:28,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {11521#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11521#(= main_~i~0 0)} is VALID [2022-04-15 12:16:28,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {11521#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11522#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:28,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {11522#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11522#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:28,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {11522#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11523#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:28,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {11523#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11523#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:28,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {11523#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11524#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:28,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {11524#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11524#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:28,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {11524#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11525#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:28,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {11525#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11525#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:28,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {11525#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11526#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:28,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {11526#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11526#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:28,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {11526#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11527#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:28,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {11527#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11527#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:28,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {11527#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11528#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:28,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {11528#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11528#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:28,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {11528#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11529#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:28,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {11529#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11529#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:28,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {11529#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11530#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:28,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {11530#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11530#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:28,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {11530#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11531#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:28,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {11531#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11531#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:28,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {11531#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11532#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:28,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {11532#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11532#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:28,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {11532#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11533#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:28,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {11533#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11533#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:28,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {11533#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11534#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:28,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {11534#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11534#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:28,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {11534#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11535#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:28,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {11535#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11535#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:28,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {11535#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11536#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:28,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {11536#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11536#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:28,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {11536#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11537#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:28,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {11537#(<= main_~i~0 16)} assume !(~i~0 < 1024); {11517#false} is VALID [2022-04-15 12:16:28,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {11517#false} ~i~0 := 0; {11517#false} is VALID [2022-04-15 12:16:28,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 12:16:28,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 12:16:28,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 12:16:28,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-15 12:16:28,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 12:16:28,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 12:16:28,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 12:16:28,150 INFO L290 TraceCheckUtils]: 47: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-15 12:16:28,150 INFO L290 TraceCheckUtils]: 48: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 12:16:28,150 INFO L290 TraceCheckUtils]: 49: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 12:16:28,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {11517#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 12:16:28,150 INFO L272 TraceCheckUtils]: 51: Hoare triple {11517#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {11517#false} is VALID [2022-04-15 12:16:28,150 INFO L290 TraceCheckUtils]: 52: Hoare triple {11517#false} ~cond := #in~cond; {11517#false} is VALID [2022-04-15 12:16:28,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {11517#false} assume 0 == ~cond; {11517#false} is VALID [2022-04-15 12:16:28,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {11517#false} assume !false; {11517#false} is VALID [2022-04-15 12:16:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:28,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:28,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684411385] [2022-04-15 12:16:28,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684411385] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:28,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133798844] [2022-04-15 12:16:28,151 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:28,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:28,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:28,161 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:28,165 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:28,259 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:28,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:28,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 12:16:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:28,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:28,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {11516#true} call ULTIMATE.init(); {11516#true} is VALID [2022-04-15 12:16:28,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {11516#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {11516#true} is VALID [2022-04-15 12:16:28,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {11516#true} assume true; {11516#true} is VALID [2022-04-15 12:16:28,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11516#true} {11516#true} #64#return; {11516#true} is VALID [2022-04-15 12:16:28,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {11516#true} call #t~ret6 := main(); {11516#true} is VALID [2022-04-15 12:16:28,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {11516#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11557#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:28,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {11557#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11557#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:28,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {11557#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11522#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:28,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {11522#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11522#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:28,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {11522#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11523#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:28,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {11523#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11523#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:28,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {11523#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11524#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:28,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {11524#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11524#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:28,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {11524#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11525#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:28,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {11525#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11525#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:28,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {11525#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11526#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:28,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {11526#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11526#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:28,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {11526#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11527#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:28,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {11527#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11527#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:28,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {11527#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11528#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:28,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {11528#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11528#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:28,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {11528#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11529#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:28,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {11529#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11529#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:28,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {11529#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11530#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:28,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {11530#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11530#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:28,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {11530#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11531#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:28,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {11531#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11531#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:28,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {11531#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11532#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:28,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {11532#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11532#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:28,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {11532#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11533#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:28,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {11533#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11533#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:28,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {11533#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11534#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:28,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {11534#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11534#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:28,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {11534#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11535#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:28,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {11535#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11535#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:28,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {11535#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11536#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:28,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {11536#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11536#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:28,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {11536#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11537#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:28,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {11537#(<= main_~i~0 16)} assume !(~i~0 < 1024); {11517#false} is VALID [2022-04-15 12:16:28,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {11517#false} ~i~0 := 0; {11517#false} is VALID [2022-04-15 12:16:28,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 12:16:28,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 12:16:28,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 12:16:28,550 INFO L290 TraceCheckUtils]: 43: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-15 12:16:28,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 12:16:28,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 12:16:28,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 12:16:28,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-15 12:16:28,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 12:16:28,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 12:16:28,551 INFO L290 TraceCheckUtils]: 50: Hoare triple {11517#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 12:16:28,551 INFO L272 TraceCheckUtils]: 51: Hoare triple {11517#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {11517#false} is VALID [2022-04-15 12:16:28,551 INFO L290 TraceCheckUtils]: 52: Hoare triple {11517#false} ~cond := #in~cond; {11517#false} is VALID [2022-04-15 12:16:28,551 INFO L290 TraceCheckUtils]: 53: Hoare triple {11517#false} assume 0 == ~cond; {11517#false} is VALID [2022-04-15 12:16:28,551 INFO L290 TraceCheckUtils]: 54: Hoare triple {11517#false} assume !false; {11517#false} is VALID [2022-04-15 12:16:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:28,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:29,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {11517#false} assume !false; {11517#false} is VALID [2022-04-15 12:16:29,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {11517#false} assume 0 == ~cond; {11517#false} is VALID [2022-04-15 12:16:29,182 INFO L290 TraceCheckUtils]: 52: Hoare triple {11517#false} ~cond := #in~cond; {11517#false} is VALID [2022-04-15 12:16:29,182 INFO L272 TraceCheckUtils]: 51: Hoare triple {11517#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {11517#false} is VALID [2022-04-15 12:16:29,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {11517#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 12:16:29,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 12:16:29,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 12:16:29,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-15 12:16:29,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 12:16:29,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 12:16:29,182 INFO L290 TraceCheckUtils]: 44: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 12:16:29,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-15 12:16:29,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 12:16:29,182 INFO L290 TraceCheckUtils]: 41: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 12:16:29,182 INFO L290 TraceCheckUtils]: 40: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 12:16:29,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {11517#false} ~i~0 := 0; {11517#false} is VALID [2022-04-15 12:16:29,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {11753#(< main_~i~0 1024)} assume !(~i~0 < 1024); {11517#false} is VALID [2022-04-15 12:16:29,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {11757#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11753#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:29,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {11757#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11757#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:29,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {11764#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11757#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:29,184 INFO L290 TraceCheckUtils]: 34: Hoare triple {11764#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11764#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:29,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {11771#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11764#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:29,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {11771#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11771#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:29,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {11778#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11771#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:29,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {11778#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11778#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:29,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {11785#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11778#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:29,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {11785#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11785#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:29,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {11792#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11785#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:29,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {11792#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11792#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:29,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {11799#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11792#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:29,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {11799#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11799#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:29,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {11806#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11799#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:29,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {11806#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11806#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:29,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {11813#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11806#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:29,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {11813#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11813#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:29,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {11820#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11813#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:29,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {11820#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11820#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:29,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {11827#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11820#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:29,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {11827#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11827#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:29,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {11834#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11827#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:29,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {11834#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11834#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:29,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {11841#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11834#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:29,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {11841#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11841#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:29,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {11848#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11841#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:29,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {11848#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11848#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:29,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {11855#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11848#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:29,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {11855#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11855#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:29,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {11862#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11855#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:29,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {11862#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11862#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:29,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {11516#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11862#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:29,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {11516#true} call #t~ret6 := main(); {11516#true} is VALID [2022-04-15 12:16:29,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11516#true} {11516#true} #64#return; {11516#true} is VALID [2022-04-15 12:16:29,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {11516#true} assume true; {11516#true} is VALID [2022-04-15 12:16:29,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {11516#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {11516#true} is VALID [2022-04-15 12:16:29,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {11516#true} call ULTIMATE.init(); {11516#true} is VALID [2022-04-15 12:16:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:29,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133798844] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:29,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:29,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-15 12:16:29,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:29,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855546151] [2022-04-15 12:16:29,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855546151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:29,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:29,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:16:29,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655268702] [2022-04-15 12:16:29,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:29,197 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 12:16:29,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:29,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:29,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:29,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:16:29,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:29,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:16:29,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:16:29,233 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:30,588 INFO L93 Difference]: Finished difference Result 152 states and 190 transitions. [2022-04-15 12:16:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:16:30,589 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 12:16:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 181 transitions. [2022-04-15 12:16:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 181 transitions. [2022-04-15 12:16:30,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 181 transitions. [2022-04-15 12:16:30,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:30,725 INFO L225 Difference]: With dead ends: 152 [2022-04-15 12:16:30,725 INFO L226 Difference]: Without dead ends: 135 [2022-04-15 12:16:30,726 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1298, Invalid=1672, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 12:16:30,729 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 329 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:30,729 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 37 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-15 12:16:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 58. [2022-04-15 12:16:30,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:30,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,855 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,855 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:30,857 INFO L93 Difference]: Finished difference Result 135 states and 169 transitions. [2022-04-15 12:16:30,857 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2022-04-15 12:16:30,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:30,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:30,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 135 states. [2022-04-15 12:16:30,858 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 135 states. [2022-04-15 12:16:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:30,860 INFO L93 Difference]: Finished difference Result 135 states and 169 transitions. [2022-04-15 12:16:30,860 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2022-04-15 12:16:30,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:30,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:30,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:30,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-04-15 12:16:30,861 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 55 [2022-04-15 12:16:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:30,862 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-04-15 12:16:30,862 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 62 transitions. [2022-04-15 12:16:30,940 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:16:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-15 12:16:30,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 12:16:30,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:30,941 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:30,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-15 12:16:31,143 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:31,144 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:31,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:31,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1975490875, now seen corresponding path program 35 times [2022-04-15 12:16:31,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:31,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [169198599] [2022-04-15 12:16:31,149 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:31,149 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:31,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1975490875, now seen corresponding path program 36 times [2022-04-15 12:16:31,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:31,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111021734] [2022-04-15 12:16:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:31,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:31,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:31,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {12633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {12610#true} is VALID [2022-04-15 12:16:31,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {12610#true} assume true; {12610#true} is VALID [2022-04-15 12:16:31,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12610#true} {12610#true} #64#return; {12610#true} is VALID [2022-04-15 12:16:31,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {12610#true} call ULTIMATE.init(); {12633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:31,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {12633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {12610#true} is VALID [2022-04-15 12:16:31,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {12610#true} assume true; {12610#true} is VALID [2022-04-15 12:16:31,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12610#true} {12610#true} #64#return; {12610#true} is VALID [2022-04-15 12:16:31,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {12610#true} call #t~ret6 := main(); {12610#true} is VALID [2022-04-15 12:16:31,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {12610#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12615#(= main_~i~0 0)} is VALID [2022-04-15 12:16:31,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {12615#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12615#(= main_~i~0 0)} is VALID [2022-04-15 12:16:31,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {12615#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12616#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:31,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {12616#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12616#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:31,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {12616#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12617#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:31,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {12617#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12617#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:31,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {12617#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12618#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:31,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {12618#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12618#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:31,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {12618#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12619#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:31,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {12619#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12619#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:31,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {12619#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12620#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:31,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {12620#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12620#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:31,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {12620#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12621#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:31,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {12621#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12621#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:31,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {12621#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12622#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:31,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {12622#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12622#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:31,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {12622#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12623#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:31,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {12623#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12623#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:31,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {12623#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12624#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:31,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {12624#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12624#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:31,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {12624#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12625#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:31,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {12625#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12625#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:31,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {12625#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12626#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:31,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {12626#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12626#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:31,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {12626#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12627#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:31,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {12627#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12627#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:31,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {12627#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12628#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:31,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {12628#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12628#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:31,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {12628#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12629#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:31,387 INFO L290 TraceCheckUtils]: 34: Hoare triple {12629#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12629#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:31,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {12629#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12630#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:31,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {12630#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12630#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:31,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {12630#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12631#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:31,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {12631#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12631#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:31,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {12631#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12632#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:31,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {12632#(<= main_~i~0 17)} assume !(~i~0 < 1024); {12611#false} is VALID [2022-04-15 12:16:31,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {12611#false} ~i~0 := 0; {12611#false} is VALID [2022-04-15 12:16:31,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {12611#false} #t~short5 := ~i~0 < 1024; {12611#false} is VALID [2022-04-15 12:16:31,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {12611#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12611#false} is VALID [2022-04-15 12:16:31,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {12611#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12611#false} is VALID [2022-04-15 12:16:31,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {12611#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12611#false} is VALID [2022-04-15 12:16:31,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {12611#false} #t~short5 := ~i~0 < 1024; {12611#false} is VALID [2022-04-15 12:16:31,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {12611#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12611#false} is VALID [2022-04-15 12:16:31,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {12611#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12611#false} is VALID [2022-04-15 12:16:31,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {12611#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12611#false} is VALID [2022-04-15 12:16:31,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {12611#false} #t~short5 := ~i~0 < 1024; {12611#false} is VALID [2022-04-15 12:16:31,390 INFO L290 TraceCheckUtils]: 51: Hoare triple {12611#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12611#false} is VALID [2022-04-15 12:16:31,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {12611#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {12611#false} is VALID [2022-04-15 12:16:31,390 INFO L272 TraceCheckUtils]: 53: Hoare triple {12611#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {12611#false} is VALID [2022-04-15 12:16:31,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {12611#false} ~cond := #in~cond; {12611#false} is VALID [2022-04-15 12:16:31,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {12611#false} assume 0 == ~cond; {12611#false} is VALID [2022-04-15 12:16:31,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {12611#false} assume !false; {12611#false} is VALID [2022-04-15 12:16:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:31,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:31,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111021734] [2022-04-15 12:16:31,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111021734] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:31,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064530025] [2022-04-15 12:16:31,392 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:31,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:31,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:31,393 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:31,406 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:31,498 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:16:31,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:31,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:31,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:31,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {12610#true} call ULTIMATE.init(); {12610#true} is VALID [2022-04-15 12:16:31,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {12610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {12610#true} is VALID [2022-04-15 12:16:31,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {12610#true} assume true; {12610#true} is VALID [2022-04-15 12:16:31,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12610#true} {12610#true} #64#return; {12610#true} is VALID [2022-04-15 12:16:31,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {12610#true} call #t~ret6 := main(); {12610#true} is VALID [2022-04-15 12:16:31,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {12610#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12610#true} is VALID [2022-04-15 12:16:31,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,690 INFO L290 TraceCheckUtils]: 39: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {12610#true} assume !(~i~0 < 1024); {12610#true} is VALID [2022-04-15 12:16:31,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {12610#true} ~i~0 := 0; {12760#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:31,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {12760#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {12760#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:31,691 INFO L290 TraceCheckUtils]: 43: Hoare triple {12760#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12760#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:31,691 INFO L290 TraceCheckUtils]: 44: Hoare triple {12760#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12760#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:31,692 INFO L290 TraceCheckUtils]: 45: Hoare triple {12760#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12616#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:31,692 INFO L290 TraceCheckUtils]: 46: Hoare triple {12616#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {12616#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:31,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {12616#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12616#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:31,693 INFO L290 TraceCheckUtils]: 48: Hoare triple {12616#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12616#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:31,693 INFO L290 TraceCheckUtils]: 49: Hoare triple {12616#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12617#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:31,693 INFO L290 TraceCheckUtils]: 50: Hoare triple {12617#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {12617#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:31,694 INFO L290 TraceCheckUtils]: 51: Hoare triple {12617#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12617#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:31,694 INFO L290 TraceCheckUtils]: 52: Hoare triple {12617#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {12617#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:31,695 INFO L272 TraceCheckUtils]: 53: Hoare triple {12617#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {12797#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:31,695 INFO L290 TraceCheckUtils]: 54: Hoare triple {12797#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12801#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:31,695 INFO L290 TraceCheckUtils]: 55: Hoare triple {12801#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12611#false} is VALID [2022-04-15 12:16:31,695 INFO L290 TraceCheckUtils]: 56: Hoare triple {12611#false} assume !false; {12611#false} is VALID [2022-04-15 12:16:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-15 12:16:31,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:31,894 INFO L290 TraceCheckUtils]: 56: Hoare triple {12611#false} assume !false; {12611#false} is VALID [2022-04-15 12:16:31,894 INFO L290 TraceCheckUtils]: 55: Hoare triple {12801#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12611#false} is VALID [2022-04-15 12:16:31,894 INFO L290 TraceCheckUtils]: 54: Hoare triple {12797#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12801#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:31,895 INFO L272 TraceCheckUtils]: 53: Hoare triple {12817#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {12797#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:31,895 INFO L290 TraceCheckUtils]: 52: Hoare triple {12817#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {12817#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:31,895 INFO L290 TraceCheckUtils]: 51: Hoare triple {12817#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12817#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:31,896 INFO L290 TraceCheckUtils]: 50: Hoare triple {12817#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {12817#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:31,896 INFO L290 TraceCheckUtils]: 49: Hoare triple {12830#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12817#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:31,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {12830#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12830#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:31,897 INFO L290 TraceCheckUtils]: 47: Hoare triple {12830#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12830#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:31,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {12830#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {12830#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:31,897 INFO L290 TraceCheckUtils]: 45: Hoare triple {12843#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12830#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:31,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {12843#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12843#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:31,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {12843#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12843#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:31,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {12843#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {12843#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:31,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {12610#true} ~i~0 := 0; {12843#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:31,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {12610#true} assume !(~i~0 < 1024); {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 32: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 12:16:31,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 12:16:31,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {12610#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12610#true} is VALID [2022-04-15 12:16:31,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {12610#true} call #t~ret6 := main(); {12610#true} is VALID [2022-04-15 12:16:31,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12610#true} {12610#true} #64#return; {12610#true} is VALID [2022-04-15 12:16:31,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {12610#true} assume true; {12610#true} is VALID [2022-04-15 12:16:31,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {12610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {12610#true} is VALID [2022-04-15 12:16:31,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {12610#true} call ULTIMATE.init(); {12610#true} is VALID [2022-04-15 12:16:31,901 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-15 12:16:31,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064530025] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:31,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:31,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 27 [2022-04-15 12:16:31,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:31,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [169198599] [2022-04-15 12:16:31,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [169198599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:31,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:31,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:16:31,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485707236] [2022-04-15 12:16:31,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:31,903 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-15 12:16:31,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:31,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:31,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:31,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:16:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:31,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:16:31,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:16:31,935 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:33,403 INFO L93 Difference]: Finished difference Result 159 states and 199 transitions. [2022-04-15 12:16:33,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:16:33,403 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-15 12:16:33,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 190 transitions. [2022-04-15 12:16:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 190 transitions. [2022-04-15 12:16:33,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 190 transitions. [2022-04-15 12:16:33,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:33,558 INFO L225 Difference]: With dead ends: 159 [2022-04-15 12:16:33,558 INFO L226 Difference]: Without dead ends: 142 [2022-04-15 12:16:33,558 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=715, Invalid=1265, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:16:33,559 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 581 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:33,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 22 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-15 12:16:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 60. [2022-04-15 12:16:33,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:33,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,720 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,720 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:33,722 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2022-04-15 12:16:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2022-04-15 12:16:33,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:33,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:33,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 142 states. [2022-04-15 12:16:33,723 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 142 states. [2022-04-15 12:16:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:33,725 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2022-04-15 12:16:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2022-04-15 12:16:33,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:33,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:33,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:33,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-04-15 12:16:33,727 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 57 [2022-04-15 12:16:33,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:33,727 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-04-15 12:16:33,727 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 64 transitions. [2022-04-15 12:16:33,814 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:16:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-15 12:16:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 12:16:33,815 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:33,816 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:33,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-15 12:16:34,022 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:34,022 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:34,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:34,022 INFO L85 PathProgramCache]: Analyzing trace with hash -543765031, now seen corresponding path program 37 times [2022-04-15 12:16:34,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:34,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [141572562] [2022-04-15 12:16:34,027 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:34,027 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:34,027 INFO L85 PathProgramCache]: Analyzing trace with hash -543765031, now seen corresponding path program 38 times [2022-04-15 12:16:34,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:34,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135045393] [2022-04-15 12:16:34,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:34,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:34,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:34,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {13763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {13739#true} is VALID [2022-04-15 12:16:34,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {13739#true} assume true; {13739#true} is VALID [2022-04-15 12:16:34,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13739#true} {13739#true} #64#return; {13739#true} is VALID [2022-04-15 12:16:34,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {13739#true} call ULTIMATE.init(); {13763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:34,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {13763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {13739#true} is VALID [2022-04-15 12:16:34,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {13739#true} assume true; {13739#true} is VALID [2022-04-15 12:16:34,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13739#true} {13739#true} #64#return; {13739#true} is VALID [2022-04-15 12:16:34,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {13739#true} call #t~ret6 := main(); {13739#true} is VALID [2022-04-15 12:16:34,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {13739#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {13744#(= main_~i~0 0)} is VALID [2022-04-15 12:16:34,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {13744#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13744#(= main_~i~0 0)} is VALID [2022-04-15 12:16:34,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {13744#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13745#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:34,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {13745#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13745#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:34,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {13745#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13746#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:34,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {13746#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13746#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:34,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {13746#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13747#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:34,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {13747#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13747#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:34,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {13747#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13748#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:34,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {13748#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13748#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:34,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {13748#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13749#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:34,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {13749#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13749#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:34,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {13749#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13750#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:34,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {13750#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13750#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:34,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {13750#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13751#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:34,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {13751#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13751#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:34,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {13751#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13752#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:34,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {13752#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13752#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:34,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {13752#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13753#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:34,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {13753#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13753#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:34,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {13753#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13754#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:34,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {13754#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13754#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:34,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {13754#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13755#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:34,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {13755#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13755#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:34,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {13755#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13756#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:34,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {13756#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13756#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:34,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {13756#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13757#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:34,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {13757#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13757#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:34,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {13757#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13758#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:34,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {13758#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13758#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:34,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {13758#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13759#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:34,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {13759#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13759#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:34,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {13759#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13760#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:34,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {13760#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13760#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:34,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {13760#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13761#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:34,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {13761#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13761#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:34,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {13761#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13762#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:34,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {13762#(<= main_~i~0 18)} assume !(~i~0 < 1024); {13740#false} is VALID [2022-04-15 12:16:34,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {13740#false} ~i~0 := 0; {13740#false} is VALID [2022-04-15 12:16:34,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 12:16:34,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 12:16:34,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 12:16:34,306 INFO L290 TraceCheckUtils]: 47: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-15 12:16:34,306 INFO L290 TraceCheckUtils]: 48: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 12:16:34,306 INFO L290 TraceCheckUtils]: 49: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 12:16:34,306 INFO L290 TraceCheckUtils]: 50: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 12:16:34,306 INFO L290 TraceCheckUtils]: 51: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-15 12:16:34,306 INFO L290 TraceCheckUtils]: 52: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 12:16:34,306 INFO L290 TraceCheckUtils]: 53: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 12:16:34,306 INFO L290 TraceCheckUtils]: 54: Hoare triple {13740#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 12:16:34,306 INFO L272 TraceCheckUtils]: 55: Hoare triple {13740#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {13740#false} is VALID [2022-04-15 12:16:34,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {13740#false} ~cond := #in~cond; {13740#false} is VALID [2022-04-15 12:16:34,306 INFO L290 TraceCheckUtils]: 57: Hoare triple {13740#false} assume 0 == ~cond; {13740#false} is VALID [2022-04-15 12:16:34,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {13740#false} assume !false; {13740#false} is VALID [2022-04-15 12:16:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:34,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:34,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135045393] [2022-04-15 12:16:34,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135045393] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:34,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59796208] [2022-04-15 12:16:34,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:34,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:34,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:34,310 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:34,314 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:34,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:34,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:34,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:16:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:34,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:34,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {13739#true} call ULTIMATE.init(); {13739#true} is VALID [2022-04-15 12:16:34,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {13739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {13739#true} is VALID [2022-04-15 12:16:34,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {13739#true} assume true; {13739#true} is VALID [2022-04-15 12:16:34,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13739#true} {13739#true} #64#return; {13739#true} is VALID [2022-04-15 12:16:34,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {13739#true} call #t~ret6 := main(); {13739#true} is VALID [2022-04-15 12:16:34,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {13739#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {13782#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:34,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {13782#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13782#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:34,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {13782#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13745#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:34,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {13745#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13745#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:34,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {13745#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13746#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:34,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {13746#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13746#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:34,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {13746#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13747#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:34,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {13747#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13747#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:34,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {13747#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13748#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:34,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {13748#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13748#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:34,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {13748#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13749#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:34,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {13749#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13749#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:34,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {13749#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13750#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:34,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {13750#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13750#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:34,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {13750#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13751#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:34,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {13751#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13751#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:34,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {13751#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13752#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:34,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {13752#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13752#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:34,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {13752#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13753#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:34,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {13753#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13753#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:34,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {13753#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13754#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:34,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {13754#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13754#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:34,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {13754#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13755#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:34,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {13755#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13755#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:34,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {13755#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13756#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:34,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {13756#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13756#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:34,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {13756#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13757#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:34,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {13757#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13757#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:34,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {13757#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13758#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:34,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {13758#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13758#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:34,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {13758#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13759#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:34,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {13759#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13759#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:34,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {13759#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13760#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:34,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {13760#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13760#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:34,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {13760#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13761#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:34,747 INFO L290 TraceCheckUtils]: 40: Hoare triple {13761#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13761#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:34,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {13761#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13762#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:34,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {13762#(<= main_~i~0 18)} assume !(~i~0 < 1024); {13740#false} is VALID [2022-04-15 12:16:34,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {13740#false} ~i~0 := 0; {13740#false} is VALID [2022-04-15 12:16:34,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 12:16:34,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 12:16:34,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 12:16:34,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-15 12:16:34,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 12:16:34,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 12:16:34,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 12:16:34,748 INFO L290 TraceCheckUtils]: 51: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-15 12:16:34,748 INFO L290 TraceCheckUtils]: 52: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 12:16:34,748 INFO L290 TraceCheckUtils]: 53: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 12:16:34,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {13740#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 12:16:34,748 INFO L272 TraceCheckUtils]: 55: Hoare triple {13740#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {13740#false} is VALID [2022-04-15 12:16:34,748 INFO L290 TraceCheckUtils]: 56: Hoare triple {13740#false} ~cond := #in~cond; {13740#false} is VALID [2022-04-15 12:16:34,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {13740#false} assume 0 == ~cond; {13740#false} is VALID [2022-04-15 12:16:34,749 INFO L290 TraceCheckUtils]: 58: Hoare triple {13740#false} assume !false; {13740#false} is VALID [2022-04-15 12:16:34,749 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:34,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:35,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {13740#false} assume !false; {13740#false} is VALID [2022-04-15 12:16:35,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {13740#false} assume 0 == ~cond; {13740#false} is VALID [2022-04-15 12:16:35,382 INFO L290 TraceCheckUtils]: 56: Hoare triple {13740#false} ~cond := #in~cond; {13740#false} is VALID [2022-04-15 12:16:35,382 INFO L272 TraceCheckUtils]: 55: Hoare triple {13740#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {13740#false} is VALID [2022-04-15 12:16:35,382 INFO L290 TraceCheckUtils]: 54: Hoare triple {13740#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 12:16:35,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 12:16:35,382 INFO L290 TraceCheckUtils]: 52: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 12:16:35,382 INFO L290 TraceCheckUtils]: 51: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-15 12:16:35,382 INFO L290 TraceCheckUtils]: 50: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 12:16:35,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 12:16:35,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 12:16:35,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-15 12:16:35,383 INFO L290 TraceCheckUtils]: 46: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 12:16:35,383 INFO L290 TraceCheckUtils]: 45: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 12:16:35,383 INFO L290 TraceCheckUtils]: 44: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 12:16:35,383 INFO L290 TraceCheckUtils]: 43: Hoare triple {13740#false} ~i~0 := 0; {13740#false} is VALID [2022-04-15 12:16:35,383 INFO L290 TraceCheckUtils]: 42: Hoare triple {13990#(< main_~i~0 1024)} assume !(~i~0 < 1024); {13740#false} is VALID [2022-04-15 12:16:35,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {13994#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:35,384 INFO L290 TraceCheckUtils]: 40: Hoare triple {13994#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13994#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:35,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {14001#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13994#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:35,385 INFO L290 TraceCheckUtils]: 38: Hoare triple {14001#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14001#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:35,385 INFO L290 TraceCheckUtils]: 37: Hoare triple {14008#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14001#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:35,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {14008#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14008#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:35,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {14015#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14008#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:35,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {14015#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14015#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:35,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {14022#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14015#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:35,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {14022#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14022#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:35,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {14029#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14022#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:35,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {14029#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14029#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:35,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {14036#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14029#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:35,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {14036#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14036#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:35,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {14043#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14036#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:35,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {14043#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14043#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:35,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {14050#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14043#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:35,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {14050#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14050#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:35,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {14057#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14050#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:35,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {14057#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14057#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:35,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {14064#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14057#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:35,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {14064#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14064#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:35,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {14071#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14064#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:35,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {14071#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14071#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:35,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {14078#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14071#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:35,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {14078#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14078#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:35,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {14085#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14078#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:35,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {14085#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14085#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:35,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {14092#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14085#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:35,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {14092#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14092#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:35,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {14099#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14092#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:35,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {14099#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14099#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:35,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {14106#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14099#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:35,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {14106#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14106#(< main_~i~0 1007)} is VALID [2022-04-15 12:16:35,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {14113#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14106#(< main_~i~0 1007)} is VALID [2022-04-15 12:16:35,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {14113#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14113#(< main_~i~0 1006)} is VALID [2022-04-15 12:16:35,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {13739#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14113#(< main_~i~0 1006)} is VALID [2022-04-15 12:16:35,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {13739#true} call #t~ret6 := main(); {13739#true} is VALID [2022-04-15 12:16:35,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13739#true} {13739#true} #64#return; {13739#true} is VALID [2022-04-15 12:16:35,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {13739#true} assume true; {13739#true} is VALID [2022-04-15 12:16:35,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {13739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {13739#true} is VALID [2022-04-15 12:16:35,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {13739#true} call ULTIMATE.init(); {13739#true} is VALID [2022-04-15 12:16:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:35,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59796208] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:35,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:35,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-15 12:16:35,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:35,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [141572562] [2022-04-15 12:16:35,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [141572562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:35,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:35,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:16:35,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535043066] [2022-04-15 12:16:35,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:35,398 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 12:16:35,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:35,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:35,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:35,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:16:35,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:35,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:16:35,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:16:35,446 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:37,024 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-15 12:16:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:16:37,024 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 12:16:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:37,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 199 transitions. [2022-04-15 12:16:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 199 transitions. [2022-04-15 12:16:37,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 199 transitions. [2022-04-15 12:16:37,181 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:16:37,183 INFO L225 Difference]: With dead ends: 166 [2022-04-15 12:16:37,183 INFO L226 Difference]: Without dead ends: 149 [2022-04-15 12:16:37,184 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1602, Invalid=2058, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 12:16:37,185 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 394 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:37,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 42 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-15 12:16:37,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 62. [2022-04-15 12:16:37,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:37,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,342 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,342 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:37,344 INFO L93 Difference]: Finished difference Result 149 states and 187 transitions. [2022-04-15 12:16:37,344 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 187 transitions. [2022-04-15 12:16:37,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:37,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:37,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-15 12:16:37,345 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-15 12:16:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:37,348 INFO L93 Difference]: Finished difference Result 149 states and 187 transitions. [2022-04-15 12:16:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 187 transitions. [2022-04-15 12:16:37,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:37,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:37,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:37,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-04-15 12:16:37,349 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 59 [2022-04-15 12:16:37,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:37,349 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-04-15 12:16:37,350 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 66 transitions. [2022-04-15 12:16:37,436 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:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-15 12:16:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 12:16:37,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:37,437 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:37,462 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:37,659 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:37,659 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:37,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:37,660 INFO L85 PathProgramCache]: Analyzing trace with hash 812864247, now seen corresponding path program 39 times [2022-04-15 12:16:37,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:37,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1495332138] [2022-04-15 12:16:37,664 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:37,665 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:37,665 INFO L85 PathProgramCache]: Analyzing trace with hash 812864247, now seen corresponding path program 40 times [2022-04-15 12:16:37,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:37,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749507355] [2022-04-15 12:16:37,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:37,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:37,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:37,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {14954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {14929#true} is VALID [2022-04-15 12:16:37,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {14929#true} assume true; {14929#true} is VALID [2022-04-15 12:16:37,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14929#true} {14929#true} #64#return; {14929#true} is VALID [2022-04-15 12:16:37,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {14929#true} call ULTIMATE.init(); {14954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:37,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {14954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {14929#true} is VALID [2022-04-15 12:16:37,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {14929#true} assume true; {14929#true} is VALID [2022-04-15 12:16:37,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14929#true} {14929#true} #64#return; {14929#true} is VALID [2022-04-15 12:16:37,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {14929#true} call #t~ret6 := main(); {14929#true} is VALID [2022-04-15 12:16:37,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {14929#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14934#(= main_~i~0 0)} is VALID [2022-04-15 12:16:37,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {14934#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14934#(= main_~i~0 0)} is VALID [2022-04-15 12:16:37,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {14934#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14935#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:37,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {14935#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14935#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:37,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {14935#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14936#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:37,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {14936#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14936#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:37,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {14936#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14937#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:37,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {14937#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14937#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:37,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {14937#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14938#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:37,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {14938#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14938#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:37,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {14938#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14939#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:37,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {14939#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14939#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:37,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {14939#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14940#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:37,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {14940#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14940#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:37,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {14940#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14941#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:37,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {14941#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14941#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:37,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {14941#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14942#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:37,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {14942#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14942#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:37,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {14942#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14943#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:37,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {14943#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14943#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:37,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {14943#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14944#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:37,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {14944#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14944#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:37,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {14944#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14945#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:37,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {14945#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14945#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:37,917 INFO L290 TraceCheckUtils]: 29: Hoare triple {14945#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14946#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:37,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {14946#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14946#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:37,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {14946#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14947#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:37,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {14947#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14947#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:37,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {14947#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14948#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:37,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {14948#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14948#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:37,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {14948#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14949#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:37,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {14949#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14949#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:37,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {14949#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14950#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:37,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {14950#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14950#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:37,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {14950#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14951#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:37,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {14951#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14951#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:37,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {14951#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14952#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:37,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {14952#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14952#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:37,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {14952#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14953#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:37,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {14953#(<= main_~i~0 19)} assume !(~i~0 < 1024); {14930#false} is VALID [2022-04-15 12:16:37,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {14930#false} ~i~0 := 0; {14930#false} is VALID [2022-04-15 12:16:37,923 INFO L290 TraceCheckUtils]: 46: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 12:16:37,923 INFO L290 TraceCheckUtils]: 47: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 12:16:37,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 12:16:37,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-15 12:16:37,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 12:16:37,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 12:16:37,923 INFO L290 TraceCheckUtils]: 52: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 12:16:37,923 INFO L290 TraceCheckUtils]: 53: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-15 12:16:37,923 INFO L290 TraceCheckUtils]: 54: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 12:16:37,923 INFO L290 TraceCheckUtils]: 55: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 12:16:37,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {14930#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 12:16:37,923 INFO L272 TraceCheckUtils]: 57: Hoare triple {14930#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {14930#false} is VALID [2022-04-15 12:16:37,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {14930#false} ~cond := #in~cond; {14930#false} is VALID [2022-04-15 12:16:37,932 INFO L290 TraceCheckUtils]: 59: Hoare triple {14930#false} assume 0 == ~cond; {14930#false} is VALID [2022-04-15 12:16:37,932 INFO L290 TraceCheckUtils]: 60: Hoare triple {14930#false} assume !false; {14930#false} is VALID [2022-04-15 12:16:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:37,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:37,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749507355] [2022-04-15 12:16:37,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749507355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:37,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040593307] [2022-04-15 12:16:37,933 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:37,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:37,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:37,934 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:37,935 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:38,051 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:38,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:38,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 12:16:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:38,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:38,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {14929#true} call ULTIMATE.init(); {14929#true} is VALID [2022-04-15 12:16:38,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {14929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {14929#true} is VALID [2022-04-15 12:16:38,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {14929#true} assume true; {14929#true} is VALID [2022-04-15 12:16:38,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14929#true} {14929#true} #64#return; {14929#true} is VALID [2022-04-15 12:16:38,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {14929#true} call #t~ret6 := main(); {14929#true} is VALID [2022-04-15 12:16:38,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {14929#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14973#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:38,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {14973#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14973#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:38,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {14973#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14935#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:38,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {14935#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14935#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:38,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {14935#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14936#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:38,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {14936#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14936#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:38,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {14936#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14937#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:38,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {14937#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14937#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:38,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {14937#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14938#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:38,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {14938#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14938#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:38,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {14938#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14939#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:38,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {14939#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14939#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:38,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {14939#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14940#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:38,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {14940#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14940#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:38,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {14940#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14941#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:38,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {14941#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14941#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:38,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {14941#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14942#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:38,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {14942#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14942#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:38,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {14942#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14943#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:38,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {14943#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14943#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:38,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {14943#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14944#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:38,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {14944#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14944#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:38,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {14944#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14945#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:38,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {14945#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14945#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:38,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {14945#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14946#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:38,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {14946#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14946#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:38,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {14946#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14947#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:38,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {14947#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14947#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:38,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {14947#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14948#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:38,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {14948#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14948#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:38,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {14948#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14949#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:38,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {14949#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14949#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:38,383 INFO L290 TraceCheckUtils]: 37: Hoare triple {14949#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14950#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:38,383 INFO L290 TraceCheckUtils]: 38: Hoare triple {14950#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14950#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:38,384 INFO L290 TraceCheckUtils]: 39: Hoare triple {14950#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14951#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:38,384 INFO L290 TraceCheckUtils]: 40: Hoare triple {14951#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14951#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:38,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {14951#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14952#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:38,384 INFO L290 TraceCheckUtils]: 42: Hoare triple {14952#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14952#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:38,385 INFO L290 TraceCheckUtils]: 43: Hoare triple {14952#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14953#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:38,385 INFO L290 TraceCheckUtils]: 44: Hoare triple {14953#(<= main_~i~0 19)} assume !(~i~0 < 1024); {14930#false} is VALID [2022-04-15 12:16:38,385 INFO L290 TraceCheckUtils]: 45: Hoare triple {14930#false} ~i~0 := 0; {14930#false} is VALID [2022-04-15 12:16:38,385 INFO L290 TraceCheckUtils]: 46: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 12:16:38,385 INFO L290 TraceCheckUtils]: 47: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 12:16:38,385 INFO L290 TraceCheckUtils]: 48: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 12:16:38,385 INFO L290 TraceCheckUtils]: 49: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-15 12:16:38,386 INFO L290 TraceCheckUtils]: 50: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 12:16:38,386 INFO L290 TraceCheckUtils]: 51: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 12:16:38,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 12:16:38,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-15 12:16:38,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 12:16:38,386 INFO L290 TraceCheckUtils]: 55: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 12:16:38,386 INFO L290 TraceCheckUtils]: 56: Hoare triple {14930#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 12:16:38,386 INFO L272 TraceCheckUtils]: 57: Hoare triple {14930#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {14930#false} is VALID [2022-04-15 12:16:38,386 INFO L290 TraceCheckUtils]: 58: Hoare triple {14930#false} ~cond := #in~cond; {14930#false} is VALID [2022-04-15 12:16:38,386 INFO L290 TraceCheckUtils]: 59: Hoare triple {14930#false} assume 0 == ~cond; {14930#false} is VALID [2022-04-15 12:16:38,386 INFO L290 TraceCheckUtils]: 60: Hoare triple {14930#false} assume !false; {14930#false} is VALID [2022-04-15 12:16:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:38,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:39,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {14930#false} assume !false; {14930#false} is VALID [2022-04-15 12:16:39,158 INFO L290 TraceCheckUtils]: 59: Hoare triple {14930#false} assume 0 == ~cond; {14930#false} is VALID [2022-04-15 12:16:39,158 INFO L290 TraceCheckUtils]: 58: Hoare triple {14930#false} ~cond := #in~cond; {14930#false} is VALID [2022-04-15 12:16:39,158 INFO L272 TraceCheckUtils]: 57: Hoare triple {14930#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {14930#false} is VALID [2022-04-15 12:16:39,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {14930#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 12:16:39,158 INFO L290 TraceCheckUtils]: 55: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 12:16:39,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 12:16:39,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-15 12:16:39,158 INFO L290 TraceCheckUtils]: 52: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 12:16:39,158 INFO L290 TraceCheckUtils]: 51: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 12:16:39,158 INFO L290 TraceCheckUtils]: 50: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 12:16:39,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-15 12:16:39,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 12:16:39,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 12:16:39,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 12:16:39,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {14930#false} ~i~0 := 0; {14930#false} is VALID [2022-04-15 12:16:39,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {15187#(< main_~i~0 1024)} assume !(~i~0 < 1024); {14930#false} is VALID [2022-04-15 12:16:39,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {15191#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15187#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:39,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {15191#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15191#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:39,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {15198#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15191#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:39,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {15198#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15198#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:39,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {15205#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15198#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:39,162 INFO L290 TraceCheckUtils]: 38: Hoare triple {15205#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15205#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:39,162 INFO L290 TraceCheckUtils]: 37: Hoare triple {15212#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15205#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:39,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {15212#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15212#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:39,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {15219#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15212#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:39,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {15219#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15219#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:39,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {15226#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15219#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:39,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {15226#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15226#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:39,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {15233#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15226#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:39,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {15233#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15233#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:39,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {15240#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15233#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:39,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {15240#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15240#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:39,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {15247#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15240#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:39,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {15247#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15247#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:39,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {15254#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15247#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:39,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {15254#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15254#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:39,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {15261#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15254#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:39,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {15261#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15261#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:39,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {15268#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15261#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:39,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {15268#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15268#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:39,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {15275#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15268#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:39,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {15275#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15275#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:39,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {15282#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15275#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:39,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {15282#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15282#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:39,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {15289#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15282#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:39,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {15289#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15289#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:39,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {15296#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15289#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:39,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {15296#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15296#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:39,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {15303#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15296#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:39,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {15303#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15303#(< main_~i~0 1007)} is VALID [2022-04-15 12:16:39,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {15310#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15303#(< main_~i~0 1007)} is VALID [2022-04-15 12:16:39,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {15310#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15310#(< main_~i~0 1006)} is VALID [2022-04-15 12:16:39,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {15317#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15310#(< main_~i~0 1006)} is VALID [2022-04-15 12:16:39,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {15317#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15317#(< main_~i~0 1005)} is VALID [2022-04-15 12:16:39,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {14929#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {15317#(< main_~i~0 1005)} is VALID [2022-04-15 12:16:39,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {14929#true} call #t~ret6 := main(); {14929#true} is VALID [2022-04-15 12:16:39,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14929#true} {14929#true} #64#return; {14929#true} is VALID [2022-04-15 12:16:39,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {14929#true} assume true; {14929#true} is VALID [2022-04-15 12:16:39,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {14929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {14929#true} is VALID [2022-04-15 12:16:39,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {14929#true} call ULTIMATE.init(); {14929#true} is VALID [2022-04-15 12:16:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:39,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040593307] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:39,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:39,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-15 12:16:39,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:39,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1495332138] [2022-04-15 12:16:39,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1495332138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:39,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:39,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:16:39,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975314299] [2022-04-15 12:16:39,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:39,177 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 12:16:39,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:39,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:39,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:16:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:39,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:16:39,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:16:39,224 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:40,841 INFO L93 Difference]: Finished difference Result 173 states and 217 transitions. [2022-04-15 12:16:40,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:16:40,842 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 12:16:40,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 208 transitions. [2022-04-15 12:16:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 208 transitions. [2022-04-15 12:16:40,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 208 transitions. [2022-04-15 12:16:41,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:41,004 INFO L225 Difference]: With dead ends: 173 [2022-04-15 12:16:41,004 INFO L226 Difference]: Without dead ends: 156 [2022-04-15 12:16:41,005 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1766, Invalid=2266, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 12:16:41,005 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 462 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:41,005 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [462 Valid, 32 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-15 12:16:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 64. [2022-04-15 12:16:41,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:41,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:41,151 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:41,151 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:41,157 INFO L93 Difference]: Finished difference Result 156 states and 196 transitions. [2022-04-15 12:16:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 196 transitions. [2022-04-15 12:16:41,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:41,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:41,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 156 states. [2022-04-15 12:16:41,158 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 156 states. [2022-04-15 12:16:41,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:41,159 INFO L93 Difference]: Finished difference Result 156 states and 196 transitions. [2022-04-15 12:16:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 196 transitions. [2022-04-15 12:16:41,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:41,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:41,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:41,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-04-15 12:16:41,160 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 61 [2022-04-15 12:16:41,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:41,160 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-04-15 12:16:41,161 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:41,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 68 transitions. [2022-04-15 12:16:41,252 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:16:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-04-15 12:16:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 12:16:41,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:41,253 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:41,270 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:16:41,470 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:16:41,470 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:41,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:41,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1136457579, now seen corresponding path program 41 times [2022-04-15 12:16:41,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:41,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1972620617] [2022-04-15 12:16:41,475 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:41,475 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:41,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1136457579, now seen corresponding path program 42 times [2022-04-15 12:16:41,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:41,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997331046] [2022-04-15 12:16:41,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:41,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:41,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:41,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {16193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {16167#true} is VALID [2022-04-15 12:16:41,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {16167#true} assume true; {16167#true} is VALID [2022-04-15 12:16:41,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16167#true} {16167#true} #64#return; {16167#true} is VALID [2022-04-15 12:16:41,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {16167#true} call ULTIMATE.init(); {16193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:41,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {16193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {16167#true} is VALID [2022-04-15 12:16:41,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {16167#true} assume true; {16167#true} is VALID [2022-04-15 12:16:41,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16167#true} {16167#true} #64#return; {16167#true} is VALID [2022-04-15 12:16:41,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {16167#true} call #t~ret6 := main(); {16167#true} is VALID [2022-04-15 12:16:41,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {16167#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {16172#(= main_~i~0 0)} is VALID [2022-04-15 12:16:41,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {16172#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16172#(= main_~i~0 0)} is VALID [2022-04-15 12:16:41,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {16172#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16173#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:41,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {16173#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16173#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:41,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {16173#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16174#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:41,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {16174#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16174#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:41,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {16174#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16175#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:41,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {16175#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16175#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:41,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {16175#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16176#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:41,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {16176#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16176#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:41,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {16176#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16177#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:41,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {16177#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16177#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:41,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {16177#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16178#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:41,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {16178#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16178#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:41,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {16178#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16179#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:41,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {16179#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16179#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:41,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {16179#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16180#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:41,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {16180#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16180#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:41,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {16180#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16181#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:41,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {16181#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16181#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:41,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {16181#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16182#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:41,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {16182#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16182#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:41,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {16182#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16183#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:41,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {16183#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16183#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:41,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {16183#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16184#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:41,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {16184#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16184#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:41,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {16184#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16185#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:41,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {16185#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16185#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:41,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {16185#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16186#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:41,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {16186#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16186#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:41,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {16186#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16187#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:41,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {16187#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16187#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:41,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {16187#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16188#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:41,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {16188#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16188#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:41,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {16188#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16189#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:41,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {16189#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16189#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:41,736 INFO L290 TraceCheckUtils]: 41: Hoare triple {16189#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16190#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:41,736 INFO L290 TraceCheckUtils]: 42: Hoare triple {16190#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16190#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:41,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {16190#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16191#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:41,737 INFO L290 TraceCheckUtils]: 44: Hoare triple {16191#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16191#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:41,737 INFO L290 TraceCheckUtils]: 45: Hoare triple {16191#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16192#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:41,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {16192#(<= main_~i~0 20)} assume !(~i~0 < 1024); {16168#false} is VALID [2022-04-15 12:16:41,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {16168#false} ~i~0 := 0; {16168#false} is VALID [2022-04-15 12:16:41,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {16168#false} #t~short5 := ~i~0 < 1024; {16168#false} is VALID [2022-04-15 12:16:41,738 INFO L290 TraceCheckUtils]: 49: Hoare triple {16168#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16168#false} is VALID [2022-04-15 12:16:41,738 INFO L290 TraceCheckUtils]: 50: Hoare triple {16168#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16168#false} is VALID [2022-04-15 12:16:41,738 INFO L290 TraceCheckUtils]: 51: Hoare triple {16168#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16168#false} is VALID [2022-04-15 12:16:41,738 INFO L290 TraceCheckUtils]: 52: Hoare triple {16168#false} #t~short5 := ~i~0 < 1024; {16168#false} is VALID [2022-04-15 12:16:41,738 INFO L290 TraceCheckUtils]: 53: Hoare triple {16168#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16168#false} is VALID [2022-04-15 12:16:41,738 INFO L290 TraceCheckUtils]: 54: Hoare triple {16168#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16168#false} is VALID [2022-04-15 12:16:41,738 INFO L290 TraceCheckUtils]: 55: Hoare triple {16168#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16168#false} is VALID [2022-04-15 12:16:41,739 INFO L290 TraceCheckUtils]: 56: Hoare triple {16168#false} #t~short5 := ~i~0 < 1024; {16168#false} is VALID [2022-04-15 12:16:41,739 INFO L290 TraceCheckUtils]: 57: Hoare triple {16168#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16168#false} is VALID [2022-04-15 12:16:41,739 INFO L290 TraceCheckUtils]: 58: Hoare triple {16168#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {16168#false} is VALID [2022-04-15 12:16:41,739 INFO L272 TraceCheckUtils]: 59: Hoare triple {16168#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {16168#false} is VALID [2022-04-15 12:16:41,739 INFO L290 TraceCheckUtils]: 60: Hoare triple {16168#false} ~cond := #in~cond; {16168#false} is VALID [2022-04-15 12:16:41,739 INFO L290 TraceCheckUtils]: 61: Hoare triple {16168#false} assume 0 == ~cond; {16168#false} is VALID [2022-04-15 12:16:41,739 INFO L290 TraceCheckUtils]: 62: Hoare triple {16168#false} assume !false; {16168#false} is VALID [2022-04-15 12:16:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:41,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:41,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997331046] [2022-04-15 12:16:41,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997331046] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:41,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795644966] [2022-04-15 12:16:41,740 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:41,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:41,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:41,741 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:16:41,743 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:16:41,842 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:16:41,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:41,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:41,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:42,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {16167#true} call ULTIMATE.init(); {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {16167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {16167#true} assume true; {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16167#true} {16167#true} #64#return; {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {16167#true} call #t~ret6 := main(); {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {16167#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 37: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 38: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 41: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 42: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 44: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 45: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,023 INFO L290 TraceCheckUtils]: 46: Hoare triple {16167#true} assume !(~i~0 < 1024); {16167#true} is VALID [2022-04-15 12:16:42,024 INFO L290 TraceCheckUtils]: 47: Hoare triple {16167#true} ~i~0 := 0; {16338#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:42,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {16338#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {16338#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:42,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {16338#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16338#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:42,024 INFO L290 TraceCheckUtils]: 50: Hoare triple {16338#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16338#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:42,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {16338#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16173#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:42,025 INFO L290 TraceCheckUtils]: 52: Hoare triple {16173#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {16173#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:42,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {16173#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16173#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:42,026 INFO L290 TraceCheckUtils]: 54: Hoare triple {16173#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16173#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:42,045 INFO L290 TraceCheckUtils]: 55: Hoare triple {16173#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16174#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:42,045 INFO L290 TraceCheckUtils]: 56: Hoare triple {16174#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {16174#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:42,046 INFO L290 TraceCheckUtils]: 57: Hoare triple {16174#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16174#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:42,046 INFO L290 TraceCheckUtils]: 58: Hoare triple {16174#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {16174#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:42,046 INFO L272 TraceCheckUtils]: 59: Hoare triple {16174#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:42,047 INFO L290 TraceCheckUtils]: 60: Hoare triple {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:42,047 INFO L290 TraceCheckUtils]: 61: Hoare triple {16379#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16168#false} is VALID [2022-04-15 12:16:42,047 INFO L290 TraceCheckUtils]: 62: Hoare triple {16168#false} assume !false; {16168#false} is VALID [2022-04-15 12:16:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 12:16:42,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:42,322 INFO L290 TraceCheckUtils]: 62: Hoare triple {16168#false} assume !false; {16168#false} is VALID [2022-04-15 12:16:42,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {16379#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16168#false} is VALID [2022-04-15 12:16:42,323 INFO L290 TraceCheckUtils]: 60: Hoare triple {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:42,324 INFO L272 TraceCheckUtils]: 59: Hoare triple {16395#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:42,324 INFO L290 TraceCheckUtils]: 58: Hoare triple {16395#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {16395#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:42,325 INFO L290 TraceCheckUtils]: 57: Hoare triple {16395#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16395#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:42,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {16395#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {16395#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:42,325 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16395#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:42,326 INFO L290 TraceCheckUtils]: 54: Hoare triple {16408#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16408#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:42,326 INFO L290 TraceCheckUtils]: 53: Hoare triple {16408#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16408#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:42,326 INFO L290 TraceCheckUtils]: 52: Hoare triple {16408#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {16408#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:42,327 INFO L290 TraceCheckUtils]: 51: Hoare triple {16421#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16408#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:42,327 INFO L290 TraceCheckUtils]: 50: Hoare triple {16421#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16421#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:42,327 INFO L290 TraceCheckUtils]: 49: Hoare triple {16421#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16421#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:42,328 INFO L290 TraceCheckUtils]: 48: Hoare triple {16421#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {16421#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:42,328 INFO L290 TraceCheckUtils]: 47: Hoare triple {16167#true} ~i~0 := 0; {16421#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:42,328 INFO L290 TraceCheckUtils]: 46: Hoare triple {16167#true} assume !(~i~0 < 1024); {16167#true} is VALID [2022-04-15 12:16:42,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,328 INFO L290 TraceCheckUtils]: 43: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,328 INFO L290 TraceCheckUtils]: 42: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {16167#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {16167#true} call #t~ret6 := main(); {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16167#true} {16167#true} #64#return; {16167#true} is VALID [2022-04-15 12:16:42,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {16167#true} assume true; {16167#true} is VALID [2022-04-15 12:16:42,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {16167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {16167#true} is VALID [2022-04-15 12:16:42,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {16167#true} call ULTIMATE.init(); {16167#true} is VALID [2022-04-15 12:16:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 12:16:42,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795644966] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:42,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:42,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 7, 7] total 30 [2022-04-15 12:16:42,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:42,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1972620617] [2022-04-15 12:16:42,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1972620617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:42,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:42,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:16:42,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104730736] [2022-04-15 12:16:42,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:42,332 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-15 12:16:42,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:42,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:42,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:42,373 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:16:42,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:42,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:16:42,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=513, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:16:42,374 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:44,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:44,134 INFO L93 Difference]: Finished difference Result 180 states and 226 transitions. [2022-04-15 12:16:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:16:44,142 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-15 12:16:44,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 217 transitions. [2022-04-15 12:16:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 217 transitions. [2022-04-15 12:16:44,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 217 transitions. [2022-04-15 12:16:44,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:44,294 INFO L225 Difference]: With dead ends: 180 [2022-04-15 12:16:44,294 INFO L226 Difference]: Without dead ends: 163 [2022-04-15 12:16:44,294 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=925, Invalid=1625, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:16:44,295 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 415 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:44,295 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [415 Valid, 37 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-15 12:16:44,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 66. [2022-04-15 12:16:44,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:44,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:44,450 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:44,450 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:44,453 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-15 12:16:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-15 12:16:44,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:44,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:44,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states. [2022-04-15 12:16:44,454 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states. [2022-04-15 12:16:44,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:44,457 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-15 12:16:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-15 12:16:44,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:44,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:44,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:44,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:44,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-04-15 12:16:44,460 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 63 [2022-04-15 12:16:44,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:44,460 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-04-15 12:16:44,460 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:44,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 70 transitions. [2022-04-15 12:16:44,599 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:16:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-15 12:16:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 12:16:44,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:44,601 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:44,620 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:16:44,801 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:16:44,801 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:44,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1828991309, now seen corresponding path program 43 times [2022-04-15 12:16:44,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:44,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1665395303] [2022-04-15 12:16:44,805 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:44,805 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1828991309, now seen corresponding path program 44 times [2022-04-15 12:16:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:44,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171291074] [2022-04-15 12:16:44,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:44,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:45,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:45,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {17464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {17437#true} is VALID [2022-04-15 12:16:45,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {17437#true} assume true; {17437#true} is VALID [2022-04-15 12:16:45,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17437#true} {17437#true} #64#return; {17437#true} is VALID [2022-04-15 12:16:45,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {17437#true} call ULTIMATE.init(); {17464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:45,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {17464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {17437#true} is VALID [2022-04-15 12:16:45,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {17437#true} assume true; {17437#true} is VALID [2022-04-15 12:16:45,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17437#true} {17437#true} #64#return; {17437#true} is VALID [2022-04-15 12:16:45,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {17437#true} call #t~ret6 := main(); {17437#true} is VALID [2022-04-15 12:16:45,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {17437#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {17442#(= main_~i~0 0)} is VALID [2022-04-15 12:16:45,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {17442#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17442#(= main_~i~0 0)} is VALID [2022-04-15 12:16:45,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {17442#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17443#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:45,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {17443#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17443#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:45,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {17443#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17444#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:45,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {17444#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17444#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:45,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {17444#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17445#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:45,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {17445#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17445#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:45,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {17445#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17446#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:45,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {17446#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17446#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:45,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {17446#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17447#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:45,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {17447#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17447#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:45,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {17447#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17448#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:45,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {17448#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17448#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:45,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {17448#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17449#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:45,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {17449#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17449#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:45,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {17449#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17450#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:45,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {17450#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17450#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:45,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {17450#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17451#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:45,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {17451#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17451#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:45,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {17451#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17452#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:45,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {17452#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17452#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:45,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {17452#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17453#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:45,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {17453#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17453#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:45,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {17453#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17454#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:45,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {17454#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17454#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:45,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {17454#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17455#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:45,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {17455#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17455#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:45,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {17455#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17456#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:45,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {17456#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17456#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:45,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {17456#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17457#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:45,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {17457#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17457#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:45,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {17457#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17458#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:45,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {17458#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17458#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:45,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {17458#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17459#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:45,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {17459#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17459#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:45,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {17459#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17460#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:45,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {17460#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17460#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:45,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {17460#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17461#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:45,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {17461#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17461#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:45,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {17461#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17462#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:45,246 INFO L290 TraceCheckUtils]: 46: Hoare triple {17462#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17462#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:45,246 INFO L290 TraceCheckUtils]: 47: Hoare triple {17462#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17463#(<= main_~i~0 21)} is VALID [2022-04-15 12:16:45,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {17463#(<= main_~i~0 21)} assume !(~i~0 < 1024); {17438#false} is VALID [2022-04-15 12:16:45,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {17438#false} ~i~0 := 0; {17438#false} is VALID [2022-04-15 12:16:45,247 INFO L290 TraceCheckUtils]: 50: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 12:16:45,247 INFO L290 TraceCheckUtils]: 51: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 12:16:45,247 INFO L290 TraceCheckUtils]: 52: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 12:16:45,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-15 12:16:45,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 12:16:45,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 12:16:45,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 12:16:45,247 INFO L290 TraceCheckUtils]: 57: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-15 12:16:45,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 12:16:45,248 INFO L290 TraceCheckUtils]: 59: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 12:16:45,248 INFO L290 TraceCheckUtils]: 60: Hoare triple {17438#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 12:16:45,248 INFO L272 TraceCheckUtils]: 61: Hoare triple {17438#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {17438#false} is VALID [2022-04-15 12:16:45,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {17438#false} ~cond := #in~cond; {17438#false} is VALID [2022-04-15 12:16:45,248 INFO L290 TraceCheckUtils]: 63: Hoare triple {17438#false} assume 0 == ~cond; {17438#false} is VALID [2022-04-15 12:16:45,248 INFO L290 TraceCheckUtils]: 64: Hoare triple {17438#false} assume !false; {17438#false} is VALID [2022-04-15 12:16:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:45,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:45,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171291074] [2022-04-15 12:16:45,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171291074] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:45,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129140050] [2022-04-15 12:16:45,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:45,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:45,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:45,250 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:16:45,271 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:16:45,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:45,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:45,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 12:16:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:45,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:45,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {17437#true} call ULTIMATE.init(); {17437#true} is VALID [2022-04-15 12:16:45,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {17437#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {17437#true} is VALID [2022-04-15 12:16:45,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {17437#true} assume true; {17437#true} is VALID [2022-04-15 12:16:45,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17437#true} {17437#true} #64#return; {17437#true} is VALID [2022-04-15 12:16:45,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {17437#true} call #t~ret6 := main(); {17437#true} is VALID [2022-04-15 12:16:45,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {17437#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {17483#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:45,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {17483#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17483#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:45,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {17483#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17443#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:45,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {17443#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17443#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:45,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {17443#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17444#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:45,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {17444#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17444#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:45,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {17444#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17445#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:45,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {17445#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17445#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:45,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {17445#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17446#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:45,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {17446#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17446#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:45,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {17446#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17447#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:45,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {17447#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17447#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:45,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {17447#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17448#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:45,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {17448#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17448#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:45,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {17448#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17449#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:45,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {17449#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17449#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:45,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {17449#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17450#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:45,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {17450#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17450#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:45,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {17450#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17451#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:45,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {17451#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17451#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:45,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {17451#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17452#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:45,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {17452#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17452#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:45,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {17452#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17453#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:45,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {17453#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17453#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:45,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {17453#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17454#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:45,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {17454#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17454#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:45,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {17454#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17455#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:45,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {17455#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17455#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:45,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {17455#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17456#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:45,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {17456#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17456#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:45,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {17456#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17457#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:45,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {17457#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17457#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:45,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {17457#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17458#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:45,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {17458#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17458#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:45,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {17458#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17459#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:45,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {17459#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17459#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:45,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {17459#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17460#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:45,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {17460#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17460#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:45,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {17460#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17461#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:45,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {17461#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17461#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:45,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {17461#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17462#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:45,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {17462#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17462#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:45,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {17462#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17463#(<= main_~i~0 21)} is VALID [2022-04-15 12:16:45,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {17463#(<= main_~i~0 21)} assume !(~i~0 < 1024); {17438#false} is VALID [2022-04-15 12:16:45,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {17438#false} ~i~0 := 0; {17438#false} is VALID [2022-04-15 12:16:45,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 12:16:45,719 INFO L290 TraceCheckUtils]: 51: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 12:16:45,719 INFO L290 TraceCheckUtils]: 52: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 12:16:45,719 INFO L290 TraceCheckUtils]: 53: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-15 12:16:45,719 INFO L290 TraceCheckUtils]: 54: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 12:16:45,719 INFO L290 TraceCheckUtils]: 55: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 12:16:45,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 12:16:45,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-15 12:16:45,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 12:16:45,719 INFO L290 TraceCheckUtils]: 59: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 12:16:45,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {17438#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 12:16:45,719 INFO L272 TraceCheckUtils]: 61: Hoare triple {17438#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {17438#false} is VALID [2022-04-15 12:16:45,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {17438#false} ~cond := #in~cond; {17438#false} is VALID [2022-04-15 12:16:45,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {17438#false} assume 0 == ~cond; {17438#false} is VALID [2022-04-15 12:16:45,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {17438#false} assume !false; {17438#false} is VALID [2022-04-15 12:16:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:45,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:46,513 INFO L290 TraceCheckUtils]: 64: Hoare triple {17438#false} assume !false; {17438#false} is VALID [2022-04-15 12:16:46,514 INFO L290 TraceCheckUtils]: 63: Hoare triple {17438#false} assume 0 == ~cond; {17438#false} is VALID [2022-04-15 12:16:46,514 INFO L290 TraceCheckUtils]: 62: Hoare triple {17438#false} ~cond := #in~cond; {17438#false} is VALID [2022-04-15 12:16:46,514 INFO L272 TraceCheckUtils]: 61: Hoare triple {17438#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {17438#false} is VALID [2022-04-15 12:16:46,514 INFO L290 TraceCheckUtils]: 60: Hoare triple {17438#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 12:16:46,514 INFO L290 TraceCheckUtils]: 59: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 12:16:46,514 INFO L290 TraceCheckUtils]: 58: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 12:16:46,514 INFO L290 TraceCheckUtils]: 57: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-15 12:16:46,514 INFO L290 TraceCheckUtils]: 56: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 12:16:46,514 INFO L290 TraceCheckUtils]: 55: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 12:16:46,514 INFO L290 TraceCheckUtils]: 54: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 12:16:46,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-15 12:16:46,514 INFO L290 TraceCheckUtils]: 52: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 12:16:46,514 INFO L290 TraceCheckUtils]: 51: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 12:16:46,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 12:16:46,515 INFO L290 TraceCheckUtils]: 49: Hoare triple {17438#false} ~i~0 := 0; {17438#false} is VALID [2022-04-15 12:16:46,515 INFO L290 TraceCheckUtils]: 48: Hoare triple {17709#(< main_~i~0 1024)} assume !(~i~0 < 1024); {17438#false} is VALID [2022-04-15 12:16:46,515 INFO L290 TraceCheckUtils]: 47: Hoare triple {17713#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17709#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:46,516 INFO L290 TraceCheckUtils]: 46: Hoare triple {17713#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17713#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:46,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {17720#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17713#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:46,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {17720#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17720#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:46,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {17727#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17720#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:46,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {17727#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17727#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:46,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {17734#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17727#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:46,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {17734#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17734#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:46,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {17741#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17734#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:46,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {17741#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17741#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:46,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {17748#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17741#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:46,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {17748#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17748#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:46,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {17755#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17748#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:46,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {17755#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17755#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:46,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {17762#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17755#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:46,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {17762#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17762#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:46,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {17769#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17762#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:46,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {17769#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17769#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:46,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {17776#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17769#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:46,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {17776#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17776#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:46,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {17783#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17776#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:46,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {17783#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17783#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:46,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {17790#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17783#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:46,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {17790#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17790#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:46,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {17797#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17790#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:46,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {17797#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17797#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:46,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {17804#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17797#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:46,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {17804#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17804#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:46,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {17811#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17804#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:46,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {17811#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17811#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:46,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {17818#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17811#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:46,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {17818#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17818#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:46,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {17825#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17818#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:46,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {17825#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17825#(< main_~i~0 1007)} is VALID [2022-04-15 12:16:46,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {17832#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17825#(< main_~i~0 1007)} is VALID [2022-04-15 12:16:46,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {17832#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17832#(< main_~i~0 1006)} is VALID [2022-04-15 12:16:46,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {17839#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17832#(< main_~i~0 1006)} is VALID [2022-04-15 12:16:46,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {17839#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17839#(< main_~i~0 1005)} is VALID [2022-04-15 12:16:46,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {17846#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17839#(< main_~i~0 1005)} is VALID [2022-04-15 12:16:46,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {17846#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17846#(< main_~i~0 1004)} is VALID [2022-04-15 12:16:46,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {17853#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17846#(< main_~i~0 1004)} is VALID [2022-04-15 12:16:46,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {17853#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17853#(< main_~i~0 1003)} is VALID [2022-04-15 12:16:46,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {17437#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {17853#(< main_~i~0 1003)} is VALID [2022-04-15 12:16:46,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {17437#true} call #t~ret6 := main(); {17437#true} is VALID [2022-04-15 12:16:46,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17437#true} {17437#true} #64#return; {17437#true} is VALID [2022-04-15 12:16:46,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {17437#true} assume true; {17437#true} is VALID [2022-04-15 12:16:46,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {17437#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {17437#true} is VALID [2022-04-15 12:16:46,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {17437#true} call ULTIMATE.init(); {17437#true} is VALID [2022-04-15 12:16:46,529 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:46,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129140050] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:46,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:46,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-15 12:16:46,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:46,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1665395303] [2022-04-15 12:16:46,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1665395303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:46,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:46,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:16:46,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937657438] [2022-04-15 12:16:46,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:46,530 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 12:16:46,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:46,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:46,576 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:46,576 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:16:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:46,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:16:46,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:16:46,577 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:48,519 INFO L93 Difference]: Finished difference Result 187 states and 235 transitions. [2022-04-15 12:16:48,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:16:48,519 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 12:16:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 226 transitions. [2022-04-15 12:16:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 226 transitions. [2022-04-15 12:16:48,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 226 transitions. [2022-04-15 12:16:48,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:48,695 INFO L225 Difference]: With dead ends: 187 [2022-04-15 12:16:48,695 INFO L226 Difference]: Without dead ends: 170 [2022-04-15 12:16:48,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2118, Invalid=2712, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 12:16:48,697 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 454 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:48,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 37 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:48,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-04-15 12:16:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 68. [2022-04-15 12:16:48,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:48,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,866 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,867 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:48,868 INFO L93 Difference]: Finished difference Result 170 states and 214 transitions. [2022-04-15 12:16:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2022-04-15 12:16:48,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:48,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:48,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 170 states. [2022-04-15 12:16:48,869 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 170 states. [2022-04-15 12:16:48,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:48,871 INFO L93 Difference]: Finished difference Result 170 states and 214 transitions. [2022-04-15 12:16:48,871 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2022-04-15 12:16:48,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:48,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:48,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:48,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-15 12:16:48,872 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 65 [2022-04-15 12:16:48,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:48,872 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-15 12:16:48,872 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2022-04-15 12:16:48,967 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:16:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-15 12:16:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 12:16:48,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:48,967 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:48,984 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:16:49,168 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:16:49,168 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:49,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:49,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1633974959, now seen corresponding path program 45 times [2022-04-15 12:16:49,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:49,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1177433200] [2022-04-15 12:16:49,177 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:49,177 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:49,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1633974959, now seen corresponding path program 46 times [2022-04-15 12:16:49,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:49,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785041790] [2022-04-15 12:16:49,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:49,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:49,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {18799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {18771#true} is VALID [2022-04-15 12:16:49,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {18771#true} assume true; {18771#true} is VALID [2022-04-15 12:16:49,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18771#true} {18771#true} #64#return; {18771#true} is VALID [2022-04-15 12:16:49,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {18771#true} call ULTIMATE.init(); {18799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:49,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {18799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {18771#true} is VALID [2022-04-15 12:16:49,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {18771#true} assume true; {18771#true} is VALID [2022-04-15 12:16:49,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18771#true} {18771#true} #64#return; {18771#true} is VALID [2022-04-15 12:16:49,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {18771#true} call #t~ret6 := main(); {18771#true} is VALID [2022-04-15 12:16:49,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {18771#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {18776#(= main_~i~0 0)} is VALID [2022-04-15 12:16:49,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {18776#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18776#(= main_~i~0 0)} is VALID [2022-04-15 12:16:49,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {18776#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18777#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:49,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {18777#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18777#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:49,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {18777#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18778#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:49,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {18778#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18778#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:49,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {18778#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18779#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:49,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {18779#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18779#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:49,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {18779#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18780#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:49,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {18780#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18780#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:49,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {18780#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18781#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:49,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {18781#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18781#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:49,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {18781#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18782#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:49,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {18782#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18782#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:49,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {18782#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18783#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:49,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {18783#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18783#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:49,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {18783#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18784#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:49,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {18784#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18784#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:49,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {18784#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18785#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:49,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {18785#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18785#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:49,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {18785#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18786#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:49,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {18786#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18786#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:49,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {18786#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18787#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:49,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {18787#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18787#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:49,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {18787#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18788#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:49,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {18788#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18788#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:49,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {18788#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18789#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:49,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {18789#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18789#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:49,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {18789#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18790#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:49,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {18790#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18790#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:49,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {18790#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18791#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:49,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {18791#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18791#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:49,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {18791#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18792#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:49,447 INFO L290 TraceCheckUtils]: 38: Hoare triple {18792#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18792#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:49,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {18792#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18793#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:49,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {18793#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18793#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:49,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {18793#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18794#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:49,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {18794#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18794#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:49,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {18794#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18795#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:49,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {18795#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18795#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:49,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {18795#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18796#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:49,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {18796#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18796#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:49,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {18796#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18797#(<= main_~i~0 21)} is VALID [2022-04-15 12:16:49,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {18797#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18797#(<= main_~i~0 21)} is VALID [2022-04-15 12:16:49,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {18797#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18798#(<= main_~i~0 22)} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {18798#(<= main_~i~0 22)} assume !(~i~0 < 1024); {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 51: Hoare triple {18772#false} ~i~0 := 0; {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 53: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 54: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 55: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 56: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 58: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 59: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 60: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 62: Hoare triple {18772#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L272 TraceCheckUtils]: 63: Hoare triple {18772#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 64: Hoare triple {18772#false} ~cond := #in~cond; {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 65: Hoare triple {18772#false} assume 0 == ~cond; {18772#false} is VALID [2022-04-15 12:16:49,451 INFO L290 TraceCheckUtils]: 66: Hoare triple {18772#false} assume !false; {18772#false} is VALID [2022-04-15 12:16:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:49,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:49,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785041790] [2022-04-15 12:16:49,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785041790] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:49,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254674997] [2022-04-15 12:16:49,452 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:16:49,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:49,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:49,453 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:16:49,454 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:16:49,565 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:16:49,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:49,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:16:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:49,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:49,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {18771#true} call ULTIMATE.init(); {18771#true} is VALID [2022-04-15 12:16:49,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {18771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {18771#true} is VALID [2022-04-15 12:16:49,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {18771#true} assume true; {18771#true} is VALID [2022-04-15 12:16:49,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18771#true} {18771#true} #64#return; {18771#true} is VALID [2022-04-15 12:16:49,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {18771#true} call #t~ret6 := main(); {18771#true} is VALID [2022-04-15 12:16:49,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {18771#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {18818#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:49,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {18818#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18818#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:49,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {18818#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18777#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:49,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {18777#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18777#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:49,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {18777#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18778#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:49,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {18778#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18778#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:49,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {18778#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18779#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:49,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {18779#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18779#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {18779#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18780#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {18780#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18780#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {18780#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18781#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:49,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {18781#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18781#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:49,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {18781#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18782#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:49,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {18782#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18782#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:49,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {18782#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18783#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:49,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {18783#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18783#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:49,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {18783#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18784#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:49,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {18784#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18784#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:49,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {18784#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18785#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:49,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {18785#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18785#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:49,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {18785#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18786#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:49,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {18786#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18786#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:49,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {18786#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18787#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:49,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {18787#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18787#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:49,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {18787#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18788#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:49,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {18788#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18788#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:49,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {18788#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18789#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:49,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {18789#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18789#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:49,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {18789#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18790#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:49,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {18790#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18790#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:49,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {18790#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18791#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:49,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {18791#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18791#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:49,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {18791#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18792#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:49,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {18792#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18792#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:49,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {18792#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18793#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:49,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {18793#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18793#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:49,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {18793#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18794#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:49,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {18794#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18794#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:49,934 INFO L290 TraceCheckUtils]: 43: Hoare triple {18794#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18795#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:49,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {18795#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18795#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:49,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {18795#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18796#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:49,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {18796#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18796#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:49,935 INFO L290 TraceCheckUtils]: 47: Hoare triple {18796#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18797#(<= main_~i~0 21)} is VALID [2022-04-15 12:16:49,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {18797#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18797#(<= main_~i~0 21)} is VALID [2022-04-15 12:16:49,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {18797#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18798#(<= main_~i~0 22)} is VALID [2022-04-15 12:16:49,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {18798#(<= main_~i~0 22)} assume !(~i~0 < 1024); {18772#false} is VALID [2022-04-15 12:16:49,936 INFO L290 TraceCheckUtils]: 51: Hoare triple {18772#false} ~i~0 := 0; {18772#false} is VALID [2022-04-15 12:16:49,936 INFO L290 TraceCheckUtils]: 52: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 12:16:49,937 INFO L290 TraceCheckUtils]: 53: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 12:16:49,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 12:16:49,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-15 12:16:49,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 12:16:49,937 INFO L290 TraceCheckUtils]: 57: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 12:16:49,937 INFO L290 TraceCheckUtils]: 58: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 12:16:49,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-15 12:16:49,937 INFO L290 TraceCheckUtils]: 60: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 12:16:49,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 12:16:49,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {18772#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 12:16:49,937 INFO L272 TraceCheckUtils]: 63: Hoare triple {18772#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {18772#false} is VALID [2022-04-15 12:16:49,937 INFO L290 TraceCheckUtils]: 64: Hoare triple {18772#false} ~cond := #in~cond; {18772#false} is VALID [2022-04-15 12:16:49,937 INFO L290 TraceCheckUtils]: 65: Hoare triple {18772#false} assume 0 == ~cond; {18772#false} is VALID [2022-04-15 12:16:49,937 INFO L290 TraceCheckUtils]: 66: Hoare triple {18772#false} assume !false; {18772#false} is VALID [2022-04-15 12:16:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:49,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:50,755 INFO L290 TraceCheckUtils]: 66: Hoare triple {18772#false} assume !false; {18772#false} is VALID [2022-04-15 12:16:50,755 INFO L290 TraceCheckUtils]: 65: Hoare triple {18772#false} assume 0 == ~cond; {18772#false} is VALID [2022-04-15 12:16:50,756 INFO L290 TraceCheckUtils]: 64: Hoare triple {18772#false} ~cond := #in~cond; {18772#false} is VALID [2022-04-15 12:16:50,756 INFO L272 TraceCheckUtils]: 63: Hoare triple {18772#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {18772#false} is VALID [2022-04-15 12:16:50,756 INFO L290 TraceCheckUtils]: 62: Hoare triple {18772#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 12:16:50,756 INFO L290 TraceCheckUtils]: 61: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 12:16:50,756 INFO L290 TraceCheckUtils]: 60: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 12:16:50,756 INFO L290 TraceCheckUtils]: 59: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-15 12:16:50,756 INFO L290 TraceCheckUtils]: 58: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 12:16:50,756 INFO L290 TraceCheckUtils]: 57: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 12:16:50,756 INFO L290 TraceCheckUtils]: 56: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 12:16:50,756 INFO L290 TraceCheckUtils]: 55: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-15 12:16:50,756 INFO L290 TraceCheckUtils]: 54: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 12:16:50,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 12:16:50,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 12:16:50,756 INFO L290 TraceCheckUtils]: 51: Hoare triple {18772#false} ~i~0 := 0; {18772#false} is VALID [2022-04-15 12:16:50,757 INFO L290 TraceCheckUtils]: 50: Hoare triple {19050#(< main_~i~0 1024)} assume !(~i~0 < 1024); {18772#false} is VALID [2022-04-15 12:16:50,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {19054#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19050#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:50,757 INFO L290 TraceCheckUtils]: 48: Hoare triple {19054#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19054#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:50,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {19061#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19054#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:50,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {19061#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19061#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:50,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {19068#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19061#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:50,759 INFO L290 TraceCheckUtils]: 44: Hoare triple {19068#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19068#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:50,759 INFO L290 TraceCheckUtils]: 43: Hoare triple {19075#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19068#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:50,761 INFO L290 TraceCheckUtils]: 42: Hoare triple {19075#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19075#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:50,761 INFO L290 TraceCheckUtils]: 41: Hoare triple {19082#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19075#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:50,761 INFO L290 TraceCheckUtils]: 40: Hoare triple {19082#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19082#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:50,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {19089#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19082#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:50,762 INFO L290 TraceCheckUtils]: 38: Hoare triple {19089#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19089#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:50,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {19096#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19089#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:50,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {19096#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19096#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:50,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {19103#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19096#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:50,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {19103#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19103#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:50,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {19110#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19103#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:50,764 INFO L290 TraceCheckUtils]: 32: Hoare triple {19110#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19110#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:50,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {19117#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19110#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:50,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {19117#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19117#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:50,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {19124#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19117#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:50,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {19124#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19124#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:50,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {19131#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19124#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:50,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {19131#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19131#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:50,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {19138#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19131#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:50,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {19138#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19138#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:50,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {19145#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19138#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:50,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {19145#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19145#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:50,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {19152#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19145#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:50,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {19152#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19152#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:50,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {19159#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19152#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:50,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {19159#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19159#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:50,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {19166#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19159#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:50,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {19166#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19166#(< main_~i~0 1007)} is VALID [2022-04-15 12:16:50,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {19173#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19166#(< main_~i~0 1007)} is VALID [2022-04-15 12:16:50,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {19173#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19173#(< main_~i~0 1006)} is VALID [2022-04-15 12:16:50,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {19180#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19173#(< main_~i~0 1006)} is VALID [2022-04-15 12:16:50,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {19180#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19180#(< main_~i~0 1005)} is VALID [2022-04-15 12:16:50,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {19187#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19180#(< main_~i~0 1005)} is VALID [2022-04-15 12:16:50,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {19187#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19187#(< main_~i~0 1004)} is VALID [2022-04-15 12:16:50,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {19194#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19187#(< main_~i~0 1004)} is VALID [2022-04-15 12:16:50,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {19194#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19194#(< main_~i~0 1003)} is VALID [2022-04-15 12:16:50,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {19201#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19194#(< main_~i~0 1003)} is VALID [2022-04-15 12:16:50,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {19201#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19201#(< main_~i~0 1002)} is VALID [2022-04-15 12:16:50,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {18771#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {19201#(< main_~i~0 1002)} is VALID [2022-04-15 12:16:50,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {18771#true} call #t~ret6 := main(); {18771#true} is VALID [2022-04-15 12:16:50,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18771#true} {18771#true} #64#return; {18771#true} is VALID [2022-04-15 12:16:50,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {18771#true} assume true; {18771#true} is VALID [2022-04-15 12:16:50,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {18771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {18771#true} is VALID [2022-04-15 12:16:50,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {18771#true} call ULTIMATE.init(); {18771#true} is VALID [2022-04-15 12:16:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:50,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254674997] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:50,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:50,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-15 12:16:50,781 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:50,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1177433200] [2022-04-15 12:16:50,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1177433200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:50,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:50,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:16:50,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458963430] [2022-04-15 12:16:50,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:50,782 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 12:16:50,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:50,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:50,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:50,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:16:50,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:50,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:16:50,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 12:16:50,826 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:52,905 INFO L93 Difference]: Finished difference Result 194 states and 244 transitions. [2022-04-15 12:16:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:16:52,906 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 12:16:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:52,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 235 transitions. [2022-04-15 12:16:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 235 transitions. [2022-04-15 12:16:52,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 235 transitions. [2022-04-15 12:16:53,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:53,091 INFO L225 Difference]: With dead ends: 194 [2022-04-15 12:16:53,092 INFO L226 Difference]: Without dead ends: 177 [2022-04-15 12:16:53,093 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2306, Invalid=2950, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 12:16:53,093 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 534 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:53,093 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 27 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-15 12:16:53,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 70. [2022-04-15 12:16:53,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:53,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:53,273 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:53,274 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:53,275 INFO L93 Difference]: Finished difference Result 177 states and 223 transitions. [2022-04-15 12:16:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-15 12:16:53,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:53,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:53,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 177 states. [2022-04-15 12:16:53,276 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 177 states. [2022-04-15 12:16:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:53,278 INFO L93 Difference]: Finished difference Result 177 states and 223 transitions. [2022-04-15 12:16:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-15 12:16:53,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:53,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:53,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:53,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-04-15 12:16:53,279 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 67 [2022-04-15 12:16:53,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:53,280 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-04-15 12:16:53,280 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:53,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2022-04-15 12:16:53,385 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:16:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-04-15 12:16:53,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 12:16:53,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:53,386 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:53,406 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:16:53,604 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:16:53,605 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:53,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:53,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1093143663, now seen corresponding path program 47 times [2022-04-15 12:16:53,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:53,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1376697] [2022-04-15 12:16:53,609 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:53,609 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:53,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1093143663, now seen corresponding path program 48 times [2022-04-15 12:16:53,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:53,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883483199] [2022-04-15 12:16:53,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:53,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:53,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:53,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {20182#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {20153#true} is VALID [2022-04-15 12:16:53,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {20153#true} assume true; {20153#true} is VALID [2022-04-15 12:16:53,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20153#true} {20153#true} #64#return; {20153#true} is VALID [2022-04-15 12:16:53,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {20153#true} call ULTIMATE.init(); {20182#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:53,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {20182#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {20153#true} is VALID [2022-04-15 12:16:53,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {20153#true} assume true; {20153#true} is VALID [2022-04-15 12:16:53,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20153#true} {20153#true} #64#return; {20153#true} is VALID [2022-04-15 12:16:53,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {20153#true} call #t~ret6 := main(); {20153#true} is VALID [2022-04-15 12:16:53,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {20153#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {20158#(= main_~i~0 0)} is VALID [2022-04-15 12:16:53,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {20158#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20158#(= main_~i~0 0)} is VALID [2022-04-15 12:16:53,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {20158#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20159#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:53,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {20159#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20159#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:53,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {20159#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20160#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:53,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {20160#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20160#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:53,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {20160#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20161#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:53,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {20161#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20161#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:53,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {20161#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20162#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:53,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {20162#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20162#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:53,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {20162#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20163#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:53,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {20163#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20163#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:53,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {20163#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20164#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:53,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {20164#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20164#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:53,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {20164#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20165#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:53,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {20165#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20165#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:53,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {20165#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20166#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:53,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {20166#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20166#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:53,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {20166#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20167#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:53,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {20167#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20167#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:53,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {20167#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20168#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:53,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {20168#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20168#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:53,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {20168#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20169#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:53,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {20169#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20169#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:53,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {20169#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20170#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:53,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {20170#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20170#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:53,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {20170#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20171#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:53,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {20171#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20171#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:53,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {20171#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20172#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:53,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {20172#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20172#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:53,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {20172#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20173#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:53,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {20173#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20173#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:53,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {20173#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20174#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:53,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {20174#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20174#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:53,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {20174#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20175#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:53,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {20175#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20175#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:53,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {20175#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20176#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:53,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {20176#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20176#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:53,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {20176#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20177#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:53,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {20177#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20177#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:53,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {20177#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20178#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:53,936 INFO L290 TraceCheckUtils]: 46: Hoare triple {20178#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20178#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:53,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {20178#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20179#(<= main_~i~0 21)} is VALID [2022-04-15 12:16:53,937 INFO L290 TraceCheckUtils]: 48: Hoare triple {20179#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20179#(<= main_~i~0 21)} is VALID [2022-04-15 12:16:53,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {20179#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20180#(<= main_~i~0 22)} is VALID [2022-04-15 12:16:53,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {20180#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20180#(<= main_~i~0 22)} is VALID [2022-04-15 12:16:53,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {20180#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20181#(<= main_~i~0 23)} is VALID [2022-04-15 12:16:53,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {20181#(<= main_~i~0 23)} assume !(~i~0 < 1024); {20154#false} is VALID [2022-04-15 12:16:53,938 INFO L290 TraceCheckUtils]: 53: Hoare triple {20154#false} ~i~0 := 0; {20154#false} is VALID [2022-04-15 12:16:53,938 INFO L290 TraceCheckUtils]: 54: Hoare triple {20154#false} #t~short5 := ~i~0 < 1024; {20154#false} is VALID [2022-04-15 12:16:53,938 INFO L290 TraceCheckUtils]: 55: Hoare triple {20154#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20154#false} is VALID [2022-04-15 12:16:53,938 INFO L290 TraceCheckUtils]: 56: Hoare triple {20154#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20154#false} is VALID [2022-04-15 12:16:53,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {20154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20154#false} is VALID [2022-04-15 12:16:53,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {20154#false} #t~short5 := ~i~0 < 1024; {20154#false} is VALID [2022-04-15 12:16:53,939 INFO L290 TraceCheckUtils]: 59: Hoare triple {20154#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20154#false} is VALID [2022-04-15 12:16:53,939 INFO L290 TraceCheckUtils]: 60: Hoare triple {20154#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20154#false} is VALID [2022-04-15 12:16:53,939 INFO L290 TraceCheckUtils]: 61: Hoare triple {20154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20154#false} is VALID [2022-04-15 12:16:53,939 INFO L290 TraceCheckUtils]: 62: Hoare triple {20154#false} #t~short5 := ~i~0 < 1024; {20154#false} is VALID [2022-04-15 12:16:53,939 INFO L290 TraceCheckUtils]: 63: Hoare triple {20154#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20154#false} is VALID [2022-04-15 12:16:53,939 INFO L290 TraceCheckUtils]: 64: Hoare triple {20154#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {20154#false} is VALID [2022-04-15 12:16:53,939 INFO L272 TraceCheckUtils]: 65: Hoare triple {20154#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {20154#false} is VALID [2022-04-15 12:16:53,939 INFO L290 TraceCheckUtils]: 66: Hoare triple {20154#false} ~cond := #in~cond; {20154#false} is VALID [2022-04-15 12:16:53,939 INFO L290 TraceCheckUtils]: 67: Hoare triple {20154#false} assume 0 == ~cond; {20154#false} is VALID [2022-04-15 12:16:53,939 INFO L290 TraceCheckUtils]: 68: Hoare triple {20154#false} assume !false; {20154#false} is VALID [2022-04-15 12:16:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:53,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:53,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883483199] [2022-04-15 12:16:53,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883483199] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:53,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170778029] [2022-04-15 12:16:53,940 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:16:53,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:53,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:53,941 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:16:53,942 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:16:54,049 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:16:54,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:54,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:16:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:54,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:54,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {20153#true} call ULTIMATE.init(); {20153#true} is VALID [2022-04-15 12:16:54,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {20153#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {20153#true} assume true; {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20153#true} {20153#true} #64#return; {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {20153#true} call #t~ret6 := main(); {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {20153#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,227 INFO L290 TraceCheckUtils]: 49: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {20153#true} assume !(~i~0 < 1024); {20153#true} is VALID [2022-04-15 12:16:54,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {20153#true} ~i~0 := 0; {20345#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:54,233 INFO L290 TraceCheckUtils]: 54: Hoare triple {20345#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {20345#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:54,233 INFO L290 TraceCheckUtils]: 55: Hoare triple {20345#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20345#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:54,234 INFO L290 TraceCheckUtils]: 56: Hoare triple {20345#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20345#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:54,234 INFO L290 TraceCheckUtils]: 57: Hoare triple {20345#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20159#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:54,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {20159#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {20159#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:54,235 INFO L290 TraceCheckUtils]: 59: Hoare triple {20159#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20159#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:54,235 INFO L290 TraceCheckUtils]: 60: Hoare triple {20159#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20159#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:54,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {20159#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20160#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:54,236 INFO L290 TraceCheckUtils]: 62: Hoare triple {20160#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {20160#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:54,236 INFO L290 TraceCheckUtils]: 63: Hoare triple {20160#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20160#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:54,236 INFO L290 TraceCheckUtils]: 64: Hoare triple {20160#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {20160#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:54,237 INFO L272 TraceCheckUtils]: 65: Hoare triple {20160#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {20382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:54,237 INFO L290 TraceCheckUtils]: 66: Hoare triple {20382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:54,237 INFO L290 TraceCheckUtils]: 67: Hoare triple {20386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20154#false} is VALID [2022-04-15 12:16:54,238 INFO L290 TraceCheckUtils]: 68: Hoare triple {20154#false} assume !false; {20154#false} is VALID [2022-04-15 12:16:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-15 12:16:54,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:54,438 INFO L290 TraceCheckUtils]: 68: Hoare triple {20154#false} assume !false; {20154#false} is VALID [2022-04-15 12:16:54,439 INFO L290 TraceCheckUtils]: 67: Hoare triple {20386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20154#false} is VALID [2022-04-15 12:16:54,439 INFO L290 TraceCheckUtils]: 66: Hoare triple {20382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:16:54,440 INFO L272 TraceCheckUtils]: 65: Hoare triple {20402#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {20382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:16:54,440 INFO L290 TraceCheckUtils]: 64: Hoare triple {20402#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {20402#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:54,440 INFO L290 TraceCheckUtils]: 63: Hoare triple {20402#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20402#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:54,441 INFO L290 TraceCheckUtils]: 62: Hoare triple {20402#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {20402#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:54,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {20415#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20402#(<= main_~i~0 512)} is VALID [2022-04-15 12:16:54,441 INFO L290 TraceCheckUtils]: 60: Hoare triple {20415#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20415#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:54,441 INFO L290 TraceCheckUtils]: 59: Hoare triple {20415#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20415#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:54,442 INFO L290 TraceCheckUtils]: 58: Hoare triple {20415#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {20415#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:54,442 INFO L290 TraceCheckUtils]: 57: Hoare triple {20428#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20415#(<= main_~i~0 511)} is VALID [2022-04-15 12:16:54,442 INFO L290 TraceCheckUtils]: 56: Hoare triple {20428#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20428#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:54,443 INFO L290 TraceCheckUtils]: 55: Hoare triple {20428#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20428#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:54,443 INFO L290 TraceCheckUtils]: 54: Hoare triple {20428#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {20428#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:54,443 INFO L290 TraceCheckUtils]: 53: Hoare triple {20153#true} ~i~0 := 0; {20428#(<= main_~i~0 510)} is VALID [2022-04-15 12:16:54,443 INFO L290 TraceCheckUtils]: 52: Hoare triple {20153#true} assume !(~i~0 < 1024); {20153#true} is VALID [2022-04-15 12:16:54,443 INFO L290 TraceCheckUtils]: 51: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,443 INFO L290 TraceCheckUtils]: 50: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 48: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 47: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 46: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 45: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 44: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {20153#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {20153#true} call #t~ret6 := main(); {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20153#true} {20153#true} #64#return; {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {20153#true} assume true; {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {20153#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {20153#true} is VALID [2022-04-15 12:16:54,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {20153#true} call ULTIMATE.init(); {20153#true} is VALID [2022-04-15 12:16:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-15 12:16:54,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170778029] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:54,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:54,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 7, 7] total 33 [2022-04-15 12:16:54,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:54,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1376697] [2022-04-15 12:16:54,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1376697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:54,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:54,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:16:54,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056806681] [2022-04-15 12:16:54,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:54,448 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 12:16:54,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:54,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:54,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:54,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:16:54,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:54,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:16:54,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=615, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:16:54,489 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:56,692 INFO L93 Difference]: Finished difference Result 201 states and 253 transitions. [2022-04-15 12:16:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:16:56,693 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 12:16:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 244 transitions. [2022-04-15 12:16:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 244 transitions. [2022-04-15 12:16:56,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 244 transitions. [2022-04-15 12:16:56,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:56,868 INFO L225 Difference]: With dead ends: 201 [2022-04-15 12:16:56,868 INFO L226 Difference]: Without dead ends: 184 [2022-04-15 12:16:56,869 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1162, Invalid=2030, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:16:56,869 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 549 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:56,869 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 27 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-15 12:16:57,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 72. [2022-04-15 12:16:57,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:57,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:57,115 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:57,116 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:57,125 INFO L93 Difference]: Finished difference Result 184 states and 232 transitions. [2022-04-15 12:16:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2022-04-15 12:16:57,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:57,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:57,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 184 states. [2022-04-15 12:16:57,125 INFO L87 Difference]: Start difference. First operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 184 states. [2022-04-15 12:16:57,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:57,127 INFO L93 Difference]: Finished difference Result 184 states and 232 transitions. [2022-04-15 12:16:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2022-04-15 12:16:57,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:57,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:57,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:57,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-04-15 12:16:57,129 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 69 [2022-04-15 12:16:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:57,129 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-04-15 12:16:57,129 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:57,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 76 transitions. [2022-04-15 12:16:57,237 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:16:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-04-15 12:16:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 12:16:57,237 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:57,237 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:57,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-15 12:16:57,451 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:16:57,451 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:57,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1924088845, now seen corresponding path program 49 times [2022-04-15 12:16:57,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:57,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1747795658] [2022-04-15 12:16:57,455 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:16:57,455 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:16:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1924088845, now seen corresponding path program 50 times [2022-04-15 12:16:57,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:57,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493445474] [2022-04-15 12:16:57,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:57,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:57,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:57,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {21594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {21564#true} is VALID [2022-04-15 12:16:57,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {21564#true} assume true; {21564#true} is VALID [2022-04-15 12:16:57,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21564#true} {21564#true} #64#return; {21564#true} is VALID [2022-04-15 12:16:57,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {21564#true} call ULTIMATE.init(); {21594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:57,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {21594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {21564#true} is VALID [2022-04-15 12:16:57,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {21564#true} assume true; {21564#true} is VALID [2022-04-15 12:16:57,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21564#true} {21564#true} #64#return; {21564#true} is VALID [2022-04-15 12:16:57,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {21564#true} call #t~ret6 := main(); {21564#true} is VALID [2022-04-15 12:16:57,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {21564#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {21569#(= main_~i~0 0)} is VALID [2022-04-15 12:16:57,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {21569#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21569#(= main_~i~0 0)} is VALID [2022-04-15 12:16:57,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {21569#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21570#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:57,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {21570#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21570#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:57,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {21570#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21571#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:57,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {21571#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21571#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:57,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {21571#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21572#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:57,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {21572#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21572#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:57,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {21572#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21573#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:57,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {21573#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21573#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:57,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {21573#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21574#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:57,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {21574#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21574#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:57,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {21574#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21575#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:57,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {21575#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21575#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:57,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {21575#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21576#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:57,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {21576#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21576#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:57,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {21576#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21577#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:57,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {21577#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21577#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:57,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {21577#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21578#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:57,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {21578#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21578#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:57,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {21578#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21579#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:57,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {21579#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21579#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:57,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {21579#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21580#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:57,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {21580#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21580#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:57,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {21580#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21581#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:57,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {21581#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21581#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:57,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {21581#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21582#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:57,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {21582#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21582#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:57,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {21582#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21583#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:57,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {21583#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21583#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:57,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {21583#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21584#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:57,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {21584#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21584#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:57,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {21584#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21585#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:57,783 INFO L290 TraceCheckUtils]: 38: Hoare triple {21585#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21585#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:57,783 INFO L290 TraceCheckUtils]: 39: Hoare triple {21585#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21586#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:57,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {21586#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21586#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:57,784 INFO L290 TraceCheckUtils]: 41: Hoare triple {21586#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21587#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:57,784 INFO L290 TraceCheckUtils]: 42: Hoare triple {21587#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21587#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:57,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {21587#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21588#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:57,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {21588#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21588#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:57,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {21588#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21589#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:57,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {21589#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21589#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:57,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {21589#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21590#(<= main_~i~0 21)} is VALID [2022-04-15 12:16:57,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {21590#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21590#(<= main_~i~0 21)} is VALID [2022-04-15 12:16:57,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {21590#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21591#(<= main_~i~0 22)} is VALID [2022-04-15 12:16:57,787 INFO L290 TraceCheckUtils]: 50: Hoare triple {21591#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21591#(<= main_~i~0 22)} is VALID [2022-04-15 12:16:57,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {21591#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21592#(<= main_~i~0 23)} is VALID [2022-04-15 12:16:57,787 INFO L290 TraceCheckUtils]: 52: Hoare triple {21592#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21592#(<= main_~i~0 23)} is VALID [2022-04-15 12:16:57,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {21592#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21593#(<= main_~i~0 24)} is VALID [2022-04-15 12:16:57,788 INFO L290 TraceCheckUtils]: 54: Hoare triple {21593#(<= main_~i~0 24)} assume !(~i~0 < 1024); {21565#false} is VALID [2022-04-15 12:16:57,788 INFO L290 TraceCheckUtils]: 55: Hoare triple {21565#false} ~i~0 := 0; {21565#false} is VALID [2022-04-15 12:16:57,788 INFO L290 TraceCheckUtils]: 56: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 12:16:57,788 INFO L290 TraceCheckUtils]: 57: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 12:16:57,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 12:16:57,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-15 12:16:57,788 INFO L290 TraceCheckUtils]: 60: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 12:16:57,788 INFO L290 TraceCheckUtils]: 61: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 12:16:57,788 INFO L290 TraceCheckUtils]: 62: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 12:16:57,788 INFO L290 TraceCheckUtils]: 63: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-15 12:16:57,788 INFO L290 TraceCheckUtils]: 64: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 12:16:57,788 INFO L290 TraceCheckUtils]: 65: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 12:16:57,789 INFO L290 TraceCheckUtils]: 66: Hoare triple {21565#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 12:16:57,789 INFO L272 TraceCheckUtils]: 67: Hoare triple {21565#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {21565#false} is VALID [2022-04-15 12:16:57,789 INFO L290 TraceCheckUtils]: 68: Hoare triple {21565#false} ~cond := #in~cond; {21565#false} is VALID [2022-04-15 12:16:57,789 INFO L290 TraceCheckUtils]: 69: Hoare triple {21565#false} assume 0 == ~cond; {21565#false} is VALID [2022-04-15 12:16:57,789 INFO L290 TraceCheckUtils]: 70: Hoare triple {21565#false} assume !false; {21565#false} is VALID [2022-04-15 12:16:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:57,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:57,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493445474] [2022-04-15 12:16:57,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493445474] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:16:57,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490896352] [2022-04-15 12:16:57,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:16:57,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:16:57,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:57,791 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:16:57,811 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:16:57,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:16:57,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:16:57,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 12:16:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:57,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:16:58,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {21564#true} call ULTIMATE.init(); {21564#true} is VALID [2022-04-15 12:16:58,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {21564#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {21564#true} is VALID [2022-04-15 12:16:58,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {21564#true} assume true; {21564#true} is VALID [2022-04-15 12:16:58,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21564#true} {21564#true} #64#return; {21564#true} is VALID [2022-04-15 12:16:58,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {21564#true} call #t~ret6 := main(); {21564#true} is VALID [2022-04-15 12:16:58,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {21564#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {21613#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:58,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {21613#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21613#(<= main_~i~0 0)} is VALID [2022-04-15 12:16:58,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {21613#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21570#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:58,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {21570#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21570#(<= main_~i~0 1)} is VALID [2022-04-15 12:16:58,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {21570#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21571#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:58,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {21571#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21571#(<= main_~i~0 2)} is VALID [2022-04-15 12:16:58,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {21571#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21572#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:58,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {21572#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21572#(<= main_~i~0 3)} is VALID [2022-04-15 12:16:58,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {21572#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21573#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:58,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {21573#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21573#(<= main_~i~0 4)} is VALID [2022-04-15 12:16:58,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {21573#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21574#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:58,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {21574#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21574#(<= main_~i~0 5)} is VALID [2022-04-15 12:16:58,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {21574#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21575#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:58,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {21575#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21575#(<= main_~i~0 6)} is VALID [2022-04-15 12:16:58,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {21575#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21576#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:58,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {21576#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21576#(<= main_~i~0 7)} is VALID [2022-04-15 12:16:58,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {21576#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21577#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:58,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {21577#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21577#(<= main_~i~0 8)} is VALID [2022-04-15 12:16:58,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {21577#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21578#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:58,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {21578#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21578#(<= main_~i~0 9)} is VALID [2022-04-15 12:16:58,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {21578#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21579#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:58,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {21579#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21579#(<= main_~i~0 10)} is VALID [2022-04-15 12:16:58,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {21579#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21580#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:58,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {21580#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21580#(<= main_~i~0 11)} is VALID [2022-04-15 12:16:58,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {21580#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21581#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:58,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {21581#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21581#(<= main_~i~0 12)} is VALID [2022-04-15 12:16:58,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {21581#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21582#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:58,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {21582#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21582#(<= main_~i~0 13)} is VALID [2022-04-15 12:16:58,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {21582#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21583#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:58,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {21583#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21583#(<= main_~i~0 14)} is VALID [2022-04-15 12:16:58,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {21583#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21584#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:58,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {21584#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21584#(<= main_~i~0 15)} is VALID [2022-04-15 12:16:58,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {21584#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21585#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:58,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {21585#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21585#(<= main_~i~0 16)} is VALID [2022-04-15 12:16:58,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {21585#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21586#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:58,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {21586#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21586#(<= main_~i~0 17)} is VALID [2022-04-15 12:16:58,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {21586#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21587#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:58,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {21587#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21587#(<= main_~i~0 18)} is VALID [2022-04-15 12:16:58,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {21587#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21588#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:58,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {21588#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21588#(<= main_~i~0 19)} is VALID [2022-04-15 12:16:58,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {21588#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21589#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:58,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {21589#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21589#(<= main_~i~0 20)} is VALID [2022-04-15 12:16:58,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {21589#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21590#(<= main_~i~0 21)} is VALID [2022-04-15 12:16:58,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {21590#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21590#(<= main_~i~0 21)} is VALID [2022-04-15 12:16:58,249 INFO L290 TraceCheckUtils]: 49: Hoare triple {21590#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21591#(<= main_~i~0 22)} is VALID [2022-04-15 12:16:58,249 INFO L290 TraceCheckUtils]: 50: Hoare triple {21591#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21591#(<= main_~i~0 22)} is VALID [2022-04-15 12:16:58,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {21591#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21592#(<= main_~i~0 23)} is VALID [2022-04-15 12:16:58,250 INFO L290 TraceCheckUtils]: 52: Hoare triple {21592#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21592#(<= main_~i~0 23)} is VALID [2022-04-15 12:16:58,250 INFO L290 TraceCheckUtils]: 53: Hoare triple {21592#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21593#(<= main_~i~0 24)} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {21593#(<= main_~i~0 24)} assume !(~i~0 < 1024); {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 55: Hoare triple {21565#false} ~i~0 := 0; {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 57: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 58: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 59: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 60: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 61: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 62: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 63: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 64: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 65: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 66: Hoare triple {21565#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L272 TraceCheckUtils]: 67: Hoare triple {21565#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 68: Hoare triple {21565#false} ~cond := #in~cond; {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 69: Hoare triple {21565#false} assume 0 == ~cond; {21565#false} is VALID [2022-04-15 12:16:58,251 INFO L290 TraceCheckUtils]: 70: Hoare triple {21565#false} assume !false; {21565#false} is VALID [2022-04-15 12:16:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:58,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:16:59,115 INFO L290 TraceCheckUtils]: 70: Hoare triple {21565#false} assume !false; {21565#false} is VALID [2022-04-15 12:16:59,115 INFO L290 TraceCheckUtils]: 69: Hoare triple {21565#false} assume 0 == ~cond; {21565#false} is VALID [2022-04-15 12:16:59,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {21565#false} ~cond := #in~cond; {21565#false} is VALID [2022-04-15 12:16:59,116 INFO L272 TraceCheckUtils]: 67: Hoare triple {21565#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {21565#false} is VALID [2022-04-15 12:16:59,116 INFO L290 TraceCheckUtils]: 66: Hoare triple {21565#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 12:16:59,116 INFO L290 TraceCheckUtils]: 65: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 12:16:59,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 12:16:59,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-15 12:16:59,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 12:16:59,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 12:16:59,116 INFO L290 TraceCheckUtils]: 60: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 12:16:59,116 INFO L290 TraceCheckUtils]: 59: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-15 12:16:59,116 INFO L290 TraceCheckUtils]: 58: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 12:16:59,116 INFO L290 TraceCheckUtils]: 57: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 12:16:59,116 INFO L290 TraceCheckUtils]: 56: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 12:16:59,116 INFO L290 TraceCheckUtils]: 55: Hoare triple {21565#false} ~i~0 := 0; {21565#false} is VALID [2022-04-15 12:16:59,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {21857#(< main_~i~0 1024)} assume !(~i~0 < 1024); {21565#false} is VALID [2022-04-15 12:16:59,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {21861#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21857#(< main_~i~0 1024)} is VALID [2022-04-15 12:16:59,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {21861#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21861#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:59,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {21868#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21861#(< main_~i~0 1023)} is VALID [2022-04-15 12:16:59,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {21868#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21868#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:59,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {21875#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21868#(< main_~i~0 1022)} is VALID [2022-04-15 12:16:59,121 INFO L290 TraceCheckUtils]: 48: Hoare triple {21875#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21875#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:59,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {21882#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21875#(< main_~i~0 1021)} is VALID [2022-04-15 12:16:59,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {21882#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21882#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:59,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {21889#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21882#(< main_~i~0 1020)} is VALID [2022-04-15 12:16:59,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {21889#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21889#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:59,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {21896#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21889#(< main_~i~0 1019)} is VALID [2022-04-15 12:16:59,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {21896#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21896#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:59,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {21903#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21896#(< main_~i~0 1018)} is VALID [2022-04-15 12:16:59,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {21903#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21903#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:59,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {21910#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21903#(< main_~i~0 1017)} is VALID [2022-04-15 12:16:59,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {21910#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21910#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:59,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {21917#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21910#(< main_~i~0 1016)} is VALID [2022-04-15 12:16:59,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {21917#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21917#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:59,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {21924#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21917#(< main_~i~0 1015)} is VALID [2022-04-15 12:16:59,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {21924#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21924#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:59,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {21931#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21924#(< main_~i~0 1014)} is VALID [2022-04-15 12:16:59,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {21931#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21931#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:59,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {21938#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21931#(< main_~i~0 1013)} is VALID [2022-04-15 12:16:59,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {21938#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21938#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:59,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {21945#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21938#(< main_~i~0 1012)} is VALID [2022-04-15 12:16:59,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {21945#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21945#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:59,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {21952#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21945#(< main_~i~0 1011)} is VALID [2022-04-15 12:16:59,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {21952#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21952#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:59,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {21959#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21952#(< main_~i~0 1010)} is VALID [2022-04-15 12:16:59,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {21959#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21959#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:59,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {21966#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21959#(< main_~i~0 1009)} is VALID [2022-04-15 12:16:59,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {21966#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21966#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:59,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {21973#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21966#(< main_~i~0 1008)} is VALID [2022-04-15 12:16:59,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {21973#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21973#(< main_~i~0 1007)} is VALID [2022-04-15 12:16:59,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {21980#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21973#(< main_~i~0 1007)} is VALID [2022-04-15 12:16:59,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {21980#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21980#(< main_~i~0 1006)} is VALID [2022-04-15 12:16:59,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {21987#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21980#(< main_~i~0 1006)} is VALID [2022-04-15 12:16:59,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {21987#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21987#(< main_~i~0 1005)} is VALID [2022-04-15 12:16:59,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {21994#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21987#(< main_~i~0 1005)} is VALID [2022-04-15 12:16:59,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {21994#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21994#(< main_~i~0 1004)} is VALID [2022-04-15 12:16:59,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {22001#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21994#(< main_~i~0 1004)} is VALID [2022-04-15 12:16:59,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {22001#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22001#(< main_~i~0 1003)} is VALID [2022-04-15 12:16:59,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {22008#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22001#(< main_~i~0 1003)} is VALID [2022-04-15 12:16:59,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {22008#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22008#(< main_~i~0 1002)} is VALID [2022-04-15 12:16:59,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {22015#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22008#(< main_~i~0 1002)} is VALID [2022-04-15 12:16:59,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {22015#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22015#(< main_~i~0 1001)} is VALID [2022-04-15 12:16:59,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {22022#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22015#(< main_~i~0 1001)} is VALID [2022-04-15 12:16:59,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {22022#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22022#(< main_~i~0 1000)} is VALID [2022-04-15 12:16:59,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {21564#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {22022#(< main_~i~0 1000)} is VALID [2022-04-15 12:16:59,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {21564#true} call #t~ret6 := main(); {21564#true} is VALID [2022-04-15 12:16:59,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21564#true} {21564#true} #64#return; {21564#true} is VALID [2022-04-15 12:16:59,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {21564#true} assume true; {21564#true} is VALID [2022-04-15 12:16:59,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {21564#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {21564#true} is VALID [2022-04-15 12:16:59,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {21564#true} call ULTIMATE.init(); {21564#true} is VALID [2022-04-15 12:16:59,139 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:16:59,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490896352] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:16:59,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:16:59,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-15 12:16:59,139 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:59,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1747795658] [2022-04-15 12:16:59,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1747795658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:59,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:59,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:16:59,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129637108] [2022-04-15 12:16:59,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:59,140 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-15 12:16:59,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:59,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:59,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:59,177 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:16:59,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:59,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:16:59,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:16:59,179 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:01,549 INFO L93 Difference]: Finished difference Result 208 states and 262 transitions. [2022-04-15 12:17:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:17:01,549 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-15 12:17:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 253 transitions. [2022-04-15 12:17:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 253 transitions. [2022-04-15 12:17:01,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 253 transitions. [2022-04-15 12:17:01,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:01,716 INFO L225 Difference]: With dead ends: 208 [2022-04-15 12:17:01,716 INFO L226 Difference]: Without dead ends: 191 [2022-04-15 12:17:01,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2706, Invalid=3456, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 12:17:01,717 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 498 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:01,717 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 42 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-15 12:17:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 74. [2022-04-15 12:17:01,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:01,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:01,916 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:01,916 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:01,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:01,918 INFO L93 Difference]: Finished difference Result 191 states and 241 transitions. [2022-04-15 12:17:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 241 transitions. [2022-04-15 12:17:01,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:01,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:01,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-15 12:17:01,919 INFO L87 Difference]: Start difference. First operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-15 12:17:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:01,920 INFO L93 Difference]: Finished difference Result 191 states and 241 transitions. [2022-04-15 12:17:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 241 transitions. [2022-04-15 12:17:01,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:01,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:01,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:01,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-04-15 12:17:01,922 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 71 [2022-04-15 12:17:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:01,922 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-04-15 12:17:01,922 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:01,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 78 transitions. [2022-04-15 12:17:02,054 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:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-04-15 12:17:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 12:17:02,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:02,055 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:02,073 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:02,255 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:02,256 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1598491691, now seen corresponding path program 51 times [2022-04-15 12:17:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:02,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [55068415] [2022-04-15 12:17:02,260 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:02,260 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1598491691, now seen corresponding path program 52 times [2022-04-15 12:17:02,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:02,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587501681] [2022-04-15 12:17:02,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:02,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:02,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:02,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {23073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {23042#true} is VALID [2022-04-15 12:17:02,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {23042#true} assume true; {23042#true} is VALID [2022-04-15 12:17:02,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23042#true} {23042#true} #64#return; {23042#true} is VALID [2022-04-15 12:17:02,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {23042#true} call ULTIMATE.init(); {23073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:02,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {23073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {23042#true} is VALID [2022-04-15 12:17:02,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {23042#true} assume true; {23042#true} is VALID [2022-04-15 12:17:02,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23042#true} {23042#true} #64#return; {23042#true} is VALID [2022-04-15 12:17:02,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {23042#true} call #t~ret6 := main(); {23042#true} is VALID [2022-04-15 12:17:02,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {23042#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {23047#(= main_~i~0 0)} is VALID [2022-04-15 12:17:02,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {23047#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23047#(= main_~i~0 0)} is VALID [2022-04-15 12:17:02,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {23047#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23048#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:02,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {23048#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23048#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:02,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {23048#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23049#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:02,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {23049#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23049#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:02,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {23049#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23050#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:02,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {23050#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23050#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:02,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {23050#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23051#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:02,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {23051#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23051#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:02,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {23051#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23052#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:02,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {23052#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23052#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:02,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {23052#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23053#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:02,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {23053#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23053#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:02,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {23053#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23054#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:02,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {23054#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23054#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:02,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {23054#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23055#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:02,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {23055#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23055#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:02,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {23055#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23056#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:02,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {23056#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23056#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:02,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {23056#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23057#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:02,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {23057#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23057#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:02,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {23057#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23058#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:02,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {23058#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23058#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:02,627 INFO L290 TraceCheckUtils]: 29: Hoare triple {23058#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23059#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:02,627 INFO L290 TraceCheckUtils]: 30: Hoare triple {23059#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23059#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:02,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {23059#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23060#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:02,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {23060#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23060#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:02,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {23060#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23061#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:02,628 INFO L290 TraceCheckUtils]: 34: Hoare triple {23061#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23061#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:02,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {23061#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23062#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:02,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {23062#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23062#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:02,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {23062#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23063#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:02,629 INFO L290 TraceCheckUtils]: 38: Hoare triple {23063#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23063#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:02,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {23063#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23064#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:02,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {23064#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23064#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:02,630 INFO L290 TraceCheckUtils]: 41: Hoare triple {23064#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23065#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:02,630 INFO L290 TraceCheckUtils]: 42: Hoare triple {23065#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23065#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:02,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {23065#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23066#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:02,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {23066#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23066#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:02,631 INFO L290 TraceCheckUtils]: 45: Hoare triple {23066#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23067#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:02,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {23067#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23067#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:02,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {23067#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23068#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:02,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {23068#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23068#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:02,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {23068#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23069#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:02,633 INFO L290 TraceCheckUtils]: 50: Hoare triple {23069#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23069#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:02,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {23069#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23070#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:02,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {23070#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23070#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:02,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {23070#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23071#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:02,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {23071#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23071#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:02,634 INFO L290 TraceCheckUtils]: 55: Hoare triple {23071#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23072#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 56: Hoare triple {23072#(<= main_~i~0 25)} assume !(~i~0 < 1024); {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {23043#false} ~i~0 := 0; {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 58: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 59: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 60: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 61: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 63: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 64: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 65: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 66: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 67: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 68: Hoare triple {23043#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L272 TraceCheckUtils]: 69: Hoare triple {23043#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 70: Hoare triple {23043#false} ~cond := #in~cond; {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 71: Hoare triple {23043#false} assume 0 == ~cond; {23043#false} is VALID [2022-04-15 12:17:02,635 INFO L290 TraceCheckUtils]: 72: Hoare triple {23043#false} assume !false; {23043#false} is VALID [2022-04-15 12:17:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:02,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:02,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587501681] [2022-04-15 12:17:02,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587501681] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:02,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333273464] [2022-04-15 12:17:02,636 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:02,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:02,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:02,637 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:02,638 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:02,786 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:02,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:02,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:17:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:02,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:03,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {23042#true} call ULTIMATE.init(); {23042#true} is VALID [2022-04-15 12:17:03,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {23042#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {23042#true} is VALID [2022-04-15 12:17:03,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {23042#true} assume true; {23042#true} is VALID [2022-04-15 12:17:03,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23042#true} {23042#true} #64#return; {23042#true} is VALID [2022-04-15 12:17:03,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {23042#true} call #t~ret6 := main(); {23042#true} is VALID [2022-04-15 12:17:03,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {23042#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {23092#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:03,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {23092#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23092#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:03,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {23092#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23048#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:03,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {23048#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23048#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:03,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {23048#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23049#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:03,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {23049#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23049#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:03,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {23049#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23050#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:03,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {23050#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23050#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:03,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {23050#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23051#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:03,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {23051#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23051#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:03,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {23051#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23052#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:03,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {23052#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23052#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:03,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {23052#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23053#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:03,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {23053#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23053#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:03,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {23053#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23054#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:03,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {23054#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23054#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:03,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {23054#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23055#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:03,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {23055#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23055#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:03,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {23055#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23056#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:03,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {23056#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23056#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:03,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {23056#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23057#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:03,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {23057#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23057#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:03,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {23057#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23058#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:03,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {23058#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23058#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:03,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {23058#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23059#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:03,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {23059#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23059#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:03,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {23059#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23060#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:03,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {23060#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23060#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:03,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {23060#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23061#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:03,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {23061#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23061#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:03,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {23061#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23062#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:03,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {23062#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23062#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:03,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {23062#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23063#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:03,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {23063#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23063#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:03,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {23063#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23064#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:03,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {23064#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23064#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:03,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {23064#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23065#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:03,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {23065#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23065#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:03,147 INFO L290 TraceCheckUtils]: 43: Hoare triple {23065#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23066#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:03,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {23066#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23066#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:03,148 INFO L290 TraceCheckUtils]: 45: Hoare triple {23066#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23067#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:03,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {23067#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23067#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:03,148 INFO L290 TraceCheckUtils]: 47: Hoare triple {23067#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23068#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:03,148 INFO L290 TraceCheckUtils]: 48: Hoare triple {23068#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23068#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:03,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {23068#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23069#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:03,149 INFO L290 TraceCheckUtils]: 50: Hoare triple {23069#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23069#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:03,149 INFO L290 TraceCheckUtils]: 51: Hoare triple {23069#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23070#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:03,150 INFO L290 TraceCheckUtils]: 52: Hoare triple {23070#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23070#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:03,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {23070#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23071#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:03,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {23071#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23071#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:03,150 INFO L290 TraceCheckUtils]: 55: Hoare triple {23071#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23072#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:03,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {23072#(<= main_~i~0 25)} assume !(~i~0 < 1024); {23043#false} is VALID [2022-04-15 12:17:03,151 INFO L290 TraceCheckUtils]: 57: Hoare triple {23043#false} ~i~0 := 0; {23043#false} is VALID [2022-04-15 12:17:03,151 INFO L290 TraceCheckUtils]: 58: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 12:17:03,151 INFO L290 TraceCheckUtils]: 59: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 12:17:03,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 12:17:03,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-15 12:17:03,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 12:17:03,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 12:17:03,151 INFO L290 TraceCheckUtils]: 64: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 12:17:03,151 INFO L290 TraceCheckUtils]: 65: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-15 12:17:03,151 INFO L290 TraceCheckUtils]: 66: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 12:17:03,151 INFO L290 TraceCheckUtils]: 67: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 12:17:03,151 INFO L290 TraceCheckUtils]: 68: Hoare triple {23043#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 12:17:03,151 INFO L272 TraceCheckUtils]: 69: Hoare triple {23043#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {23043#false} is VALID [2022-04-15 12:17:03,152 INFO L290 TraceCheckUtils]: 70: Hoare triple {23043#false} ~cond := #in~cond; {23043#false} is VALID [2022-04-15 12:17:03,152 INFO L290 TraceCheckUtils]: 71: Hoare triple {23043#false} assume 0 == ~cond; {23043#false} is VALID [2022-04-15 12:17:03,152 INFO L290 TraceCheckUtils]: 72: Hoare triple {23043#false} assume !false; {23043#false} is VALID [2022-04-15 12:17:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:03,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:04,070 INFO L290 TraceCheckUtils]: 72: Hoare triple {23043#false} assume !false; {23043#false} is VALID [2022-04-15 12:17:04,070 INFO L290 TraceCheckUtils]: 71: Hoare triple {23043#false} assume 0 == ~cond; {23043#false} is VALID [2022-04-15 12:17:04,070 INFO L290 TraceCheckUtils]: 70: Hoare triple {23043#false} ~cond := #in~cond; {23043#false} is VALID [2022-04-15 12:17:04,070 INFO L272 TraceCheckUtils]: 69: Hoare triple {23043#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {23043#false} is VALID [2022-04-15 12:17:04,070 INFO L290 TraceCheckUtils]: 68: Hoare triple {23043#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 12:17:04,070 INFO L290 TraceCheckUtils]: 67: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 12:17:04,070 INFO L290 TraceCheckUtils]: 66: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 12:17:04,070 INFO L290 TraceCheckUtils]: 65: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-15 12:17:04,070 INFO L290 TraceCheckUtils]: 64: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 12:17:04,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 12:17:04,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 12:17:04,071 INFO L290 TraceCheckUtils]: 61: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-15 12:17:04,071 INFO L290 TraceCheckUtils]: 60: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 12:17:04,071 INFO L290 TraceCheckUtils]: 59: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 12:17:04,071 INFO L290 TraceCheckUtils]: 58: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 12:17:04,071 INFO L290 TraceCheckUtils]: 57: Hoare triple {23043#false} ~i~0 := 0; {23043#false} is VALID [2022-04-15 12:17:04,071 INFO L290 TraceCheckUtils]: 56: Hoare triple {23342#(< main_~i~0 1024)} assume !(~i~0 < 1024); {23043#false} is VALID [2022-04-15 12:17:04,071 INFO L290 TraceCheckUtils]: 55: Hoare triple {23346#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23342#(< main_~i~0 1024)} is VALID [2022-04-15 12:17:04,072 INFO L290 TraceCheckUtils]: 54: Hoare triple {23346#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23346#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:04,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {23353#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23346#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:04,072 INFO L290 TraceCheckUtils]: 52: Hoare triple {23353#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23353#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:04,073 INFO L290 TraceCheckUtils]: 51: Hoare triple {23360#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23353#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:04,073 INFO L290 TraceCheckUtils]: 50: Hoare triple {23360#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23360#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:04,073 INFO L290 TraceCheckUtils]: 49: Hoare triple {23367#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23360#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:04,073 INFO L290 TraceCheckUtils]: 48: Hoare triple {23367#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23367#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:04,074 INFO L290 TraceCheckUtils]: 47: Hoare triple {23374#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23367#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:04,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {23374#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23374#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:04,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {23381#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23374#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:04,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {23381#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23381#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:04,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {23388#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23381#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:04,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {23388#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23388#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:04,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {23395#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23388#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:04,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {23395#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23395#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:04,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {23402#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23395#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:04,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {23402#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23402#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:04,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {23409#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23402#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:04,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {23409#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23409#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:04,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {23416#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23409#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:04,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {23416#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23416#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:04,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {23423#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23416#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:04,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {23423#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23423#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:04,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {23430#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23423#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:04,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {23430#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23430#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:04,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {23437#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23430#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:04,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {23437#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23437#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:04,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {23444#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23437#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:04,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {23444#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23444#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:04,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {23451#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23444#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:04,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {23451#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23451#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:04,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {23458#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23451#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:04,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {23458#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23458#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:04,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {23465#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23458#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:04,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {23465#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23465#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:04,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {23472#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23465#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:04,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {23472#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23472#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:04,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {23479#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23472#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:04,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {23479#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23479#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:04,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {23486#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23479#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:04,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {23486#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23486#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:04,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {23493#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23486#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:04,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {23493#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23493#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:04,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {23500#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23493#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:04,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {23500#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23500#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:04,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {23507#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23500#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:04,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {23507#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23507#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:04,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {23514#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23507#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:04,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {23514#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23514#(< main_~i~0 999)} is VALID [2022-04-15 12:17:04,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {23042#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {23514#(< main_~i~0 999)} is VALID [2022-04-15 12:17:04,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {23042#true} call #t~ret6 := main(); {23042#true} is VALID [2022-04-15 12:17:04,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23042#true} {23042#true} #64#return; {23042#true} is VALID [2022-04-15 12:17:04,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {23042#true} assume true; {23042#true} is VALID [2022-04-15 12:17:04,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {23042#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {23042#true} is VALID [2022-04-15 12:17:04,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {23042#true} call ULTIMATE.init(); {23042#true} is VALID [2022-04-15 12:17:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:04,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333273464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:04,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:04,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-15 12:17:04,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:04,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [55068415] [2022-04-15 12:17:04,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [55068415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:04,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:04,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:17:04,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289074612] [2022-04-15 12:17:04,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 12:17:04,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:04,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:04,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:04,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:17:04,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:04,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:17:04,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 12:17:04,146 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:06,557 INFO L93 Difference]: Finished difference Result 215 states and 271 transitions. [2022-04-15 12:17:06,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:17:06,557 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 12:17:06,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 262 transitions. [2022-04-15 12:17:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 262 transitions. [2022-04-15 12:17:06,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 262 transitions. [2022-04-15 12:17:06,728 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:17:06,736 INFO L225 Difference]: With dead ends: 215 [2022-04-15 12:17:06,736 INFO L226 Difference]: Without dead ends: 198 [2022-04-15 12:17:06,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2918, Invalid=3724, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 12:17:06,737 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 562 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:06,738 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 37 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:06,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-04-15 12:17:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 76. [2022-04-15 12:17:06,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:06,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,941 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,941 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:06,943 INFO L93 Difference]: Finished difference Result 198 states and 250 transitions. [2022-04-15 12:17:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2022-04-15 12:17:06,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:06,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:06,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 198 states. [2022-04-15 12:17:06,944 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 198 states. [2022-04-15 12:17:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:06,946 INFO L93 Difference]: Finished difference Result 198 states and 250 transitions. [2022-04-15 12:17:06,946 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2022-04-15 12:17:06,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:06,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:06,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:06,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-04-15 12:17:06,947 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 73 [2022-04-15 12:17:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:06,947 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-04-15 12:17:06,948 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2022-04-15 12:17:07,052 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:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-15 12:17:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 12:17:07,053 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:07,053 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:07,070 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:07,253 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:07,253 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:07,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:07,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2062727991, now seen corresponding path program 53 times [2022-04-15 12:17:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:07,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1155508777] [2022-04-15 12:17:07,258 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:07,258 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:07,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2062727991, now seen corresponding path program 54 times [2022-04-15 12:17:07,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:07,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045291684] [2022-04-15 12:17:07,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:07,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:07,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:07,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {24600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {24568#true} is VALID [2022-04-15 12:17:07,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {24568#true} assume true; {24568#true} is VALID [2022-04-15 12:17:07,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24568#true} {24568#true} #64#return; {24568#true} is VALID [2022-04-15 12:17:07,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {24568#true} call ULTIMATE.init(); {24600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:07,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {24600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {24568#true} is VALID [2022-04-15 12:17:07,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {24568#true} assume true; {24568#true} is VALID [2022-04-15 12:17:07,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24568#true} {24568#true} #64#return; {24568#true} is VALID [2022-04-15 12:17:07,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {24568#true} call #t~ret6 := main(); {24568#true} is VALID [2022-04-15 12:17:07,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {24568#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {24573#(= main_~i~0 0)} is VALID [2022-04-15 12:17:07,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {24573#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24573#(= main_~i~0 0)} is VALID [2022-04-15 12:17:07,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {24573#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24574#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:07,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {24574#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24574#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:07,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {24574#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24575#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:07,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {24575#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24575#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:07,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {24575#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24576#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:07,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {24576#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24576#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:07,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {24576#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24577#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:07,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {24577#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24577#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:07,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {24577#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24578#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:07,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {24578#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24578#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:07,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {24578#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24579#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:07,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {24579#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24579#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:07,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {24579#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24580#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:07,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {24580#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24580#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:07,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {24580#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24581#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:07,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {24581#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24581#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:07,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {24581#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24582#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:07,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {24582#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24582#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:07,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {24582#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24583#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:07,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {24583#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24583#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:07,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {24583#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24584#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:07,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {24584#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24584#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:07,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {24584#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24585#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:07,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {24585#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24585#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:07,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {24585#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24586#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:07,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {24586#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24586#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:07,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {24586#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24587#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:07,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {24587#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24587#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:07,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {24587#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24588#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:07,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {24588#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24588#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:07,621 INFO L290 TraceCheckUtils]: 37: Hoare triple {24588#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24589#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:07,621 INFO L290 TraceCheckUtils]: 38: Hoare triple {24589#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24589#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:07,621 INFO L290 TraceCheckUtils]: 39: Hoare triple {24589#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24590#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:07,621 INFO L290 TraceCheckUtils]: 40: Hoare triple {24590#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24590#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:07,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {24590#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24591#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:07,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {24591#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24591#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:07,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {24591#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24592#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:07,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {24592#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24592#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:07,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {24592#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24593#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:07,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {24593#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24593#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:07,623 INFO L290 TraceCheckUtils]: 47: Hoare triple {24593#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24594#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:07,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {24594#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24594#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:07,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {24594#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24595#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:07,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {24595#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24595#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:07,625 INFO L290 TraceCheckUtils]: 51: Hoare triple {24595#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24596#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:07,625 INFO L290 TraceCheckUtils]: 52: Hoare triple {24596#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24596#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:07,625 INFO L290 TraceCheckUtils]: 53: Hoare triple {24596#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24597#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:07,625 INFO L290 TraceCheckUtils]: 54: Hoare triple {24597#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24597#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:07,626 INFO L290 TraceCheckUtils]: 55: Hoare triple {24597#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24598#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:07,626 INFO L290 TraceCheckUtils]: 56: Hoare triple {24598#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24598#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:07,626 INFO L290 TraceCheckUtils]: 57: Hoare triple {24598#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24599#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 58: Hoare triple {24599#(<= main_~i~0 26)} assume !(~i~0 < 1024); {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 59: Hoare triple {24569#false} ~i~0 := 0; {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 60: Hoare triple {24569#false} #t~short5 := ~i~0 < 1024; {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 61: Hoare triple {24569#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 62: Hoare triple {24569#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 63: Hoare triple {24569#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 64: Hoare triple {24569#false} #t~short5 := ~i~0 < 1024; {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 65: Hoare triple {24569#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 66: Hoare triple {24569#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 67: Hoare triple {24569#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 68: Hoare triple {24569#false} #t~short5 := ~i~0 < 1024; {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 69: Hoare triple {24569#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 70: Hoare triple {24569#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L272 TraceCheckUtils]: 71: Hoare triple {24569#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 72: Hoare triple {24569#false} ~cond := #in~cond; {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 73: Hoare triple {24569#false} assume 0 == ~cond; {24569#false} is VALID [2022-04-15 12:17:07,627 INFO L290 TraceCheckUtils]: 74: Hoare triple {24569#false} assume !false; {24569#false} is VALID [2022-04-15 12:17:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:07,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:07,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045291684] [2022-04-15 12:17:07,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045291684] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:07,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291122949] [2022-04-15 12:17:07,629 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:07,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:07,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:07,630 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:07,668 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:07,764 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:17:07,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:07,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:17:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:07,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:07,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {24568#true} call ULTIMATE.init(); {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {24568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {24568#true} assume true; {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24568#true} {24568#true} #64#return; {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {24568#true} call #t~ret6 := main(); {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {24568#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 39: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 46: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 47: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 49: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 50: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 51: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 52: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,959 INFO L290 TraceCheckUtils]: 53: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,960 INFO L290 TraceCheckUtils]: 54: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,960 INFO L290 TraceCheckUtils]: 55: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,960 INFO L290 TraceCheckUtils]: 56: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:07,960 INFO L290 TraceCheckUtils]: 57: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:07,960 INFO L290 TraceCheckUtils]: 58: Hoare triple {24568#true} assume !(~i~0 < 1024); {24568#true} is VALID [2022-04-15 12:17:07,960 INFO L290 TraceCheckUtils]: 59: Hoare triple {24568#true} ~i~0 := 0; {24781#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:07,960 INFO L290 TraceCheckUtils]: 60: Hoare triple {24781#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {24781#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:07,961 INFO L290 TraceCheckUtils]: 61: Hoare triple {24781#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24781#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:07,961 INFO L290 TraceCheckUtils]: 62: Hoare triple {24781#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24781#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:07,961 INFO L290 TraceCheckUtils]: 63: Hoare triple {24781#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24574#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:07,961 INFO L290 TraceCheckUtils]: 64: Hoare triple {24574#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {24574#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:07,962 INFO L290 TraceCheckUtils]: 65: Hoare triple {24574#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24574#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:07,962 INFO L290 TraceCheckUtils]: 66: Hoare triple {24574#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24574#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:07,962 INFO L290 TraceCheckUtils]: 67: Hoare triple {24574#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24575#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:07,962 INFO L290 TraceCheckUtils]: 68: Hoare triple {24575#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {24575#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:07,963 INFO L290 TraceCheckUtils]: 69: Hoare triple {24575#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24575#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:07,963 INFO L290 TraceCheckUtils]: 70: Hoare triple {24575#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {24575#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:07,963 INFO L272 TraceCheckUtils]: 71: Hoare triple {24575#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {24818#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:07,964 INFO L290 TraceCheckUtils]: 72: Hoare triple {24818#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24822#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:07,964 INFO L290 TraceCheckUtils]: 73: Hoare triple {24822#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24569#false} is VALID [2022-04-15 12:17:07,964 INFO L290 TraceCheckUtils]: 74: Hoare triple {24569#false} assume !false; {24569#false} is VALID [2022-04-15 12:17:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-15 12:17:07,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:08,180 INFO L290 TraceCheckUtils]: 74: Hoare triple {24569#false} assume !false; {24569#false} is VALID [2022-04-15 12:17:08,180 INFO L290 TraceCheckUtils]: 73: Hoare triple {24822#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24569#false} is VALID [2022-04-15 12:17:08,181 INFO L290 TraceCheckUtils]: 72: Hoare triple {24818#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24822#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:08,181 INFO L272 TraceCheckUtils]: 71: Hoare triple {24838#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {24818#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:08,181 INFO L290 TraceCheckUtils]: 70: Hoare triple {24838#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {24838#(<= main_~i~0 512)} is VALID [2022-04-15 12:17:08,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {24838#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24838#(<= main_~i~0 512)} is VALID [2022-04-15 12:17:08,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {24838#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {24838#(<= main_~i~0 512)} is VALID [2022-04-15 12:17:08,182 INFO L290 TraceCheckUtils]: 67: Hoare triple {24851#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24838#(<= main_~i~0 512)} is VALID [2022-04-15 12:17:08,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {24851#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24851#(<= main_~i~0 511)} is VALID [2022-04-15 12:17:08,183 INFO L290 TraceCheckUtils]: 65: Hoare triple {24851#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24851#(<= main_~i~0 511)} is VALID [2022-04-15 12:17:08,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {24851#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {24851#(<= main_~i~0 511)} is VALID [2022-04-15 12:17:08,183 INFO L290 TraceCheckUtils]: 63: Hoare triple {24864#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24851#(<= main_~i~0 511)} is VALID [2022-04-15 12:17:08,184 INFO L290 TraceCheckUtils]: 62: Hoare triple {24864#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24864#(<= main_~i~0 510)} is VALID [2022-04-15 12:17:08,184 INFO L290 TraceCheckUtils]: 61: Hoare triple {24864#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24864#(<= main_~i~0 510)} is VALID [2022-04-15 12:17:08,184 INFO L290 TraceCheckUtils]: 60: Hoare triple {24864#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {24864#(<= main_~i~0 510)} is VALID [2022-04-15 12:17:08,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {24568#true} ~i~0 := 0; {24864#(<= main_~i~0 510)} is VALID [2022-04-15 12:17:08,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {24568#true} assume !(~i~0 < 1024); {24568#true} is VALID [2022-04-15 12:17:08,184 INFO L290 TraceCheckUtils]: 57: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,184 INFO L290 TraceCheckUtils]: 56: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 55: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 54: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 53: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 52: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 51: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 50: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 44: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 38: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {24568#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {24568#true} call #t~ret6 := main(); {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24568#true} {24568#true} #64#return; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {24568#true} assume true; {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {24568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {24568#true} is VALID [2022-04-15 12:17:08,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {24568#true} call ULTIMATE.init(); {24568#true} is VALID [2022-04-15 12:17:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-15 12:17:08,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291122949] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:08,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:08,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 7, 7] total 36 [2022-04-15 12:17:08,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:08,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1155508777] [2022-04-15 12:17:08,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1155508777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:08,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:08,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:17:08,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308119274] [2022-04-15 12:17:08,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:08,189 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 12:17:08,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:08,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:08,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:08,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:17:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:08,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:17:08,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=726, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:17:08,232 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:10,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:10,879 INFO L93 Difference]: Finished difference Result 222 states and 280 transitions. [2022-04-15 12:17:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:17:10,879 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 12:17:10,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 271 transitions. [2022-04-15 12:17:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 271 transitions. [2022-04-15 12:17:10,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 271 transitions. [2022-04-15 12:17:11,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:11,062 INFO L225 Difference]: With dead ends: 222 [2022-04-15 12:17:11,062 INFO L226 Difference]: Without dead ends: 205 [2022-04-15 12:17:11,063 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1426, Invalid=2480, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 12:17:11,063 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 684 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:11,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [684 Valid, 22 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-15 12:17:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 78. [2022-04-15 12:17:11,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:11,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,287 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,287 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:11,289 INFO L93 Difference]: Finished difference Result 205 states and 259 transitions. [2022-04-15 12:17:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 259 transitions. [2022-04-15 12:17:11,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:11,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:11,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states. [2022-04-15 12:17:11,290 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states. [2022-04-15 12:17:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:11,292 INFO L93 Difference]: Finished difference Result 205 states and 259 transitions. [2022-04-15 12:17:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 259 transitions. [2022-04-15 12:17:11,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:11,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:11,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:11,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-04-15 12:17:11,293 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 75 [2022-04-15 12:17:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:11,294 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-04-15 12:17:11,294 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 82 transitions. [2022-04-15 12:17:11,411 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:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-04-15 12:17:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 12:17:11,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:11,411 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:11,431 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:11,612 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:11,612 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:11,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1378340327, now seen corresponding path program 55 times [2022-04-15 12:17:11,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:11,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046327793] [2022-04-15 12:17:11,622 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:11,622 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:11,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1378340327, now seen corresponding path program 56 times [2022-04-15 12:17:11,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:11,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607285550] [2022-04-15 12:17:11,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:11,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:11,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:11,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {26153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {26120#true} is VALID [2022-04-15 12:17:11,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {26120#true} assume true; {26120#true} is VALID [2022-04-15 12:17:11,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26120#true} {26120#true} #64#return; {26120#true} is VALID [2022-04-15 12:17:11,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {26120#true} call ULTIMATE.init(); {26153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:11,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {26153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {26120#true} is VALID [2022-04-15 12:17:11,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {26120#true} assume true; {26120#true} is VALID [2022-04-15 12:17:11,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26120#true} {26120#true} #64#return; {26120#true} is VALID [2022-04-15 12:17:11,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {26120#true} call #t~ret6 := main(); {26120#true} is VALID [2022-04-15 12:17:11,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {26120#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26125#(= main_~i~0 0)} is VALID [2022-04-15 12:17:11,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {26125#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26125#(= main_~i~0 0)} is VALID [2022-04-15 12:17:11,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {26125#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26126#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:11,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {26126#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26126#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:11,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {26126#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26127#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:11,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {26127#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26127#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:11,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {26127#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26128#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:11,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {26128#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26128#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:11,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {26128#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26129#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:11,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {26129#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26129#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:11,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {26129#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26130#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:11,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {26130#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26130#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:11,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {26130#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26131#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:11,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {26131#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26131#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:11,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {26131#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26132#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:11,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {26132#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26132#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:11,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {26132#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26133#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:11,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {26133#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26133#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:11,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {26133#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26134#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:11,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {26134#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26134#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:11,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {26134#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26135#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:11,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {26135#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26135#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:11,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {26135#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26136#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:11,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {26136#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26136#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:11,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {26136#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26137#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:11,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {26137#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26137#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:11,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {26137#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26138#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:11,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {26138#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26138#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:11,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {26138#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26139#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:11,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {26139#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26139#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:11,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {26139#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26140#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:11,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {26140#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26140#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:11,997 INFO L290 TraceCheckUtils]: 37: Hoare triple {26140#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26141#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:11,997 INFO L290 TraceCheckUtils]: 38: Hoare triple {26141#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26141#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:11,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {26141#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26142#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:11,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {26142#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26142#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:11,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {26142#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26143#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:11,998 INFO L290 TraceCheckUtils]: 42: Hoare triple {26143#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26143#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:11,999 INFO L290 TraceCheckUtils]: 43: Hoare triple {26143#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26144#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:11,999 INFO L290 TraceCheckUtils]: 44: Hoare triple {26144#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26144#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:11,999 INFO L290 TraceCheckUtils]: 45: Hoare triple {26144#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26145#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:12,000 INFO L290 TraceCheckUtils]: 46: Hoare triple {26145#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26145#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:12,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {26145#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26146#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:12,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {26146#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26146#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:12,001 INFO L290 TraceCheckUtils]: 49: Hoare triple {26146#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26147#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:12,001 INFO L290 TraceCheckUtils]: 50: Hoare triple {26147#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26147#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:12,001 INFO L290 TraceCheckUtils]: 51: Hoare triple {26147#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26148#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:12,001 INFO L290 TraceCheckUtils]: 52: Hoare triple {26148#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26148#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:12,002 INFO L290 TraceCheckUtils]: 53: Hoare triple {26148#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26149#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:12,002 INFO L290 TraceCheckUtils]: 54: Hoare triple {26149#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26149#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:12,002 INFO L290 TraceCheckUtils]: 55: Hoare triple {26149#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26150#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:12,002 INFO L290 TraceCheckUtils]: 56: Hoare triple {26150#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26150#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:12,003 INFO L290 TraceCheckUtils]: 57: Hoare triple {26150#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26151#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:12,003 INFO L290 TraceCheckUtils]: 58: Hoare triple {26151#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26151#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:12,003 INFO L290 TraceCheckUtils]: 59: Hoare triple {26151#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26152#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:12,004 INFO L290 TraceCheckUtils]: 60: Hoare triple {26152#(<= main_~i~0 27)} assume !(~i~0 < 1024); {26121#false} is VALID [2022-04-15 12:17:12,004 INFO L290 TraceCheckUtils]: 61: Hoare triple {26121#false} ~i~0 := 0; {26121#false} is VALID [2022-04-15 12:17:12,004 INFO L290 TraceCheckUtils]: 62: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 12:17:12,004 INFO L290 TraceCheckUtils]: 63: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 12:17:12,004 INFO L290 TraceCheckUtils]: 64: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 12:17:12,004 INFO L290 TraceCheckUtils]: 65: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-15 12:17:12,004 INFO L290 TraceCheckUtils]: 66: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 12:17:12,004 INFO L290 TraceCheckUtils]: 67: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 12:17:12,004 INFO L290 TraceCheckUtils]: 68: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 12:17:12,004 INFO L290 TraceCheckUtils]: 69: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-15 12:17:12,004 INFO L290 TraceCheckUtils]: 70: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 12:17:12,004 INFO L290 TraceCheckUtils]: 71: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 12:17:12,004 INFO L290 TraceCheckUtils]: 72: Hoare triple {26121#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 12:17:12,004 INFO L272 TraceCheckUtils]: 73: Hoare triple {26121#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {26121#false} is VALID [2022-04-15 12:17:12,005 INFO L290 TraceCheckUtils]: 74: Hoare triple {26121#false} ~cond := #in~cond; {26121#false} is VALID [2022-04-15 12:17:12,005 INFO L290 TraceCheckUtils]: 75: Hoare triple {26121#false} assume 0 == ~cond; {26121#false} is VALID [2022-04-15 12:17:12,005 INFO L290 TraceCheckUtils]: 76: Hoare triple {26121#false} assume !false; {26121#false} is VALID [2022-04-15 12:17:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:12,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:12,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607285550] [2022-04-15 12:17:12,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607285550] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:12,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109499096] [2022-04-15 12:17:12,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:12,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:12,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:12,006 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:12,007 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:12,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:12,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:12,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 12:17:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:12,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:12,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {26120#true} call ULTIMATE.init(); {26120#true} is VALID [2022-04-15 12:17:12,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {26120#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {26120#true} is VALID [2022-04-15 12:17:12,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {26120#true} assume true; {26120#true} is VALID [2022-04-15 12:17:12,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26120#true} {26120#true} #64#return; {26120#true} is VALID [2022-04-15 12:17:12,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {26120#true} call #t~ret6 := main(); {26120#true} is VALID [2022-04-15 12:17:12,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {26120#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26172#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:12,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {26172#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26172#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:12,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {26172#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26126#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:12,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {26126#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26126#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:12,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {26126#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26127#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:12,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {26127#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26127#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:12,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {26127#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26128#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:12,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {26128#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26128#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:12,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {26128#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26129#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:12,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {26129#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26129#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:12,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {26129#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26130#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:12,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {26130#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26130#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:12,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {26130#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26131#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:12,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {26131#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26131#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:12,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {26131#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26132#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:12,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {26132#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26132#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:12,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {26132#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26133#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:12,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {26133#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26133#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:12,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {26133#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26134#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:12,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {26134#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26134#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:12,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {26134#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26135#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:12,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {26135#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26135#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:12,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {26135#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26136#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:12,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {26136#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26136#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:12,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {26136#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26137#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:12,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {26137#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26137#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:12,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {26137#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26138#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:12,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {26138#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26138#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:12,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {26138#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26139#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:12,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {26139#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26139#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:12,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {26139#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26140#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:12,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {26140#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26140#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:12,525 INFO L290 TraceCheckUtils]: 37: Hoare triple {26140#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26141#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:12,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {26141#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26141#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:12,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {26141#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26142#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:12,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {26142#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26142#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:12,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {26142#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26143#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:12,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {26143#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26143#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:12,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {26143#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26144#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:12,527 INFO L290 TraceCheckUtils]: 44: Hoare triple {26144#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26144#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:12,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {26144#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26145#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:12,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {26145#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26145#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:12,528 INFO L290 TraceCheckUtils]: 47: Hoare triple {26145#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26146#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:12,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {26146#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26146#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:12,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {26146#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26147#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:12,529 INFO L290 TraceCheckUtils]: 50: Hoare triple {26147#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26147#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:12,529 INFO L290 TraceCheckUtils]: 51: Hoare triple {26147#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26148#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:12,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {26148#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26148#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:12,530 INFO L290 TraceCheckUtils]: 53: Hoare triple {26148#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26149#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:12,530 INFO L290 TraceCheckUtils]: 54: Hoare triple {26149#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26149#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:12,531 INFO L290 TraceCheckUtils]: 55: Hoare triple {26149#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26150#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:12,531 INFO L290 TraceCheckUtils]: 56: Hoare triple {26150#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26150#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:12,531 INFO L290 TraceCheckUtils]: 57: Hoare triple {26150#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26151#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:12,532 INFO L290 TraceCheckUtils]: 58: Hoare triple {26151#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26151#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:12,532 INFO L290 TraceCheckUtils]: 59: Hoare triple {26151#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26152#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:12,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {26152#(<= main_~i~0 27)} assume !(~i~0 < 1024); {26121#false} is VALID [2022-04-15 12:17:12,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {26121#false} ~i~0 := 0; {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L290 TraceCheckUtils]: 62: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L290 TraceCheckUtils]: 63: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L290 TraceCheckUtils]: 64: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L290 TraceCheckUtils]: 65: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L290 TraceCheckUtils]: 66: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L290 TraceCheckUtils]: 67: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L290 TraceCheckUtils]: 68: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L290 TraceCheckUtils]: 69: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L290 TraceCheckUtils]: 70: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L290 TraceCheckUtils]: 71: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L290 TraceCheckUtils]: 72: Hoare triple {26121#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L272 TraceCheckUtils]: 73: Hoare triple {26121#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L290 TraceCheckUtils]: 74: Hoare triple {26121#false} ~cond := #in~cond; {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L290 TraceCheckUtils]: 75: Hoare triple {26121#false} assume 0 == ~cond; {26121#false} is VALID [2022-04-15 12:17:12,533 INFO L290 TraceCheckUtils]: 76: Hoare triple {26121#false} assume !false; {26121#false} is VALID [2022-04-15 12:17:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:12,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:13,646 INFO L290 TraceCheckUtils]: 76: Hoare triple {26121#false} assume !false; {26121#false} is VALID [2022-04-15 12:17:13,646 INFO L290 TraceCheckUtils]: 75: Hoare triple {26121#false} assume 0 == ~cond; {26121#false} is VALID [2022-04-15 12:17:13,646 INFO L290 TraceCheckUtils]: 74: Hoare triple {26121#false} ~cond := #in~cond; {26121#false} is VALID [2022-04-15 12:17:13,646 INFO L272 TraceCheckUtils]: 73: Hoare triple {26121#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {26121#false} is VALID [2022-04-15 12:17:13,646 INFO L290 TraceCheckUtils]: 72: Hoare triple {26121#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 12:17:13,646 INFO L290 TraceCheckUtils]: 71: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 12:17:13,647 INFO L290 TraceCheckUtils]: 70: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 12:17:13,647 INFO L290 TraceCheckUtils]: 69: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-15 12:17:13,647 INFO L290 TraceCheckUtils]: 68: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 12:17:13,647 INFO L290 TraceCheckUtils]: 67: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 12:17:13,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 12:17:13,647 INFO L290 TraceCheckUtils]: 65: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-15 12:17:13,647 INFO L290 TraceCheckUtils]: 64: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 12:17:13,647 INFO L290 TraceCheckUtils]: 63: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 12:17:13,647 INFO L290 TraceCheckUtils]: 62: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 12:17:13,647 INFO L290 TraceCheckUtils]: 61: Hoare triple {26121#false} ~i~0 := 0; {26121#false} is VALID [2022-04-15 12:17:13,647 INFO L290 TraceCheckUtils]: 60: Hoare triple {26434#(< main_~i~0 1024)} assume !(~i~0 < 1024); {26121#false} is VALID [2022-04-15 12:17:13,648 INFO L290 TraceCheckUtils]: 59: Hoare triple {26438#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26434#(< main_~i~0 1024)} is VALID [2022-04-15 12:17:13,648 INFO L290 TraceCheckUtils]: 58: Hoare triple {26438#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26438#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:13,648 INFO L290 TraceCheckUtils]: 57: Hoare triple {26445#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26438#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:13,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {26445#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26445#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:13,649 INFO L290 TraceCheckUtils]: 55: Hoare triple {26452#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26445#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:13,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {26452#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26452#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:13,649 INFO L290 TraceCheckUtils]: 53: Hoare triple {26459#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26452#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:13,650 INFO L290 TraceCheckUtils]: 52: Hoare triple {26459#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26459#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:13,650 INFO L290 TraceCheckUtils]: 51: Hoare triple {26466#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26459#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:13,650 INFO L290 TraceCheckUtils]: 50: Hoare triple {26466#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26466#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:13,651 INFO L290 TraceCheckUtils]: 49: Hoare triple {26473#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26466#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:13,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {26473#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26473#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:13,651 INFO L290 TraceCheckUtils]: 47: Hoare triple {26480#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26473#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:13,651 INFO L290 TraceCheckUtils]: 46: Hoare triple {26480#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26480#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:13,652 INFO L290 TraceCheckUtils]: 45: Hoare triple {26487#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26480#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:13,652 INFO L290 TraceCheckUtils]: 44: Hoare triple {26487#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26487#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:13,652 INFO L290 TraceCheckUtils]: 43: Hoare triple {26494#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26487#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:13,653 INFO L290 TraceCheckUtils]: 42: Hoare triple {26494#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26494#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:13,653 INFO L290 TraceCheckUtils]: 41: Hoare triple {26501#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26494#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:13,653 INFO L290 TraceCheckUtils]: 40: Hoare triple {26501#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26501#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:13,653 INFO L290 TraceCheckUtils]: 39: Hoare triple {26508#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26501#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:13,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {26508#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26508#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:13,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {26515#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26508#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:13,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {26515#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26515#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:13,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {26522#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26515#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:13,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {26522#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26522#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:13,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {26529#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26522#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:13,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {26529#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26529#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:13,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {26536#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26529#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:13,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {26536#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26536#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:13,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {26543#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26536#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:13,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {26543#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26543#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:13,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {26550#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26543#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:13,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {26550#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26550#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:13,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {26557#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26550#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:13,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {26557#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26557#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:13,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {26564#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26557#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:13,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {26564#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26564#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:13,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {26571#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26564#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:13,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {26571#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26571#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:13,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {26578#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26571#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:13,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {26578#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26578#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:13,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {26585#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26578#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:13,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {26585#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26585#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:13,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {26592#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26585#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:13,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {26592#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26592#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:13,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {26599#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26592#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:13,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {26599#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26599#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:13,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {26606#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26599#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:13,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {26606#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26606#(< main_~i~0 999)} is VALID [2022-04-15 12:17:13,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {26613#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26606#(< main_~i~0 999)} is VALID [2022-04-15 12:17:13,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {26613#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26613#(< main_~i~0 998)} is VALID [2022-04-15 12:17:13,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {26620#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26613#(< main_~i~0 998)} is VALID [2022-04-15 12:17:13,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {26620#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26620#(< main_~i~0 997)} is VALID [2022-04-15 12:17:13,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {26120#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26620#(< main_~i~0 997)} is VALID [2022-04-15 12:17:13,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {26120#true} call #t~ret6 := main(); {26120#true} is VALID [2022-04-15 12:17:13,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26120#true} {26120#true} #64#return; {26120#true} is VALID [2022-04-15 12:17:13,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {26120#true} assume true; {26120#true} is VALID [2022-04-15 12:17:13,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {26120#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {26120#true} is VALID [2022-04-15 12:17:13,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {26120#true} call ULTIMATE.init(); {26120#true} is VALID [2022-04-15 12:17:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:13,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109499096] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:13,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:13,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-15 12:17:13,665 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:13,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046327793] [2022-04-15 12:17:13,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046327793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:13,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:13,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 12:17:13,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011915099] [2022-04-15 12:17:13,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:13,665 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-15 12:17:13,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:13,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:13,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:13,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 12:17:13,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:13,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 12:17:13,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 12:17:13,707 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:16,579 INFO L93 Difference]: Finished difference Result 229 states and 289 transitions. [2022-04-15 12:17:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:17:16,580 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-15 12:17:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 280 transitions. [2022-04-15 12:17:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 280 transitions. [2022-04-15 12:17:16,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 280 transitions. [2022-04-15 12:17:16,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:16,764 INFO L225 Difference]: With dead ends: 229 [2022-04-15 12:17:16,764 INFO L226 Difference]: Without dead ends: 212 [2022-04-15 12:17:16,764 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3366, Invalid=4290, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 12:17:16,765 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 692 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:16,765 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 37 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-15 12:17:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 80. [2022-04-15 12:17:16,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:16,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,994 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,995 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:16,997 INFO L93 Difference]: Finished difference Result 212 states and 268 transitions. [2022-04-15 12:17:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 268 transitions. [2022-04-15 12:17:16,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:16,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:16,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-15 12:17:16,997 INFO L87 Difference]: Start difference. First operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-15 12:17:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:17,000 INFO L93 Difference]: Finished difference Result 212 states and 268 transitions. [2022-04-15 12:17:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 268 transitions. [2022-04-15 12:17:17,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:17,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:17,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:17,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-04-15 12:17:17,001 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 77 [2022-04-15 12:17:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:17,001 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-04-15 12:17:17,001 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:17,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 84 transitions. [2022-04-15 12:17:17,143 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:17:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-04-15 12:17:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 12:17:17,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:17,143 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:17,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-15 12:17:17,362 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:17,362 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1120176005, now seen corresponding path program 57 times [2022-04-15 12:17:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:17,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1923944718] [2022-04-15 12:17:17,367 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:17,367 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:17,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1120176005, now seen corresponding path program 58 times [2022-04-15 12:17:17,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:17,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671715343] [2022-04-15 12:17:17,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:17,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:17,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:17,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {27776#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27742#true} is VALID [2022-04-15 12:17:17,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {27742#true} assume true; {27742#true} is VALID [2022-04-15 12:17:17,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27742#true} {27742#true} #64#return; {27742#true} is VALID [2022-04-15 12:17:17,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {27742#true} call ULTIMATE.init(); {27776#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:17,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {27776#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27742#true} is VALID [2022-04-15 12:17:17,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {27742#true} assume true; {27742#true} is VALID [2022-04-15 12:17:17,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27742#true} {27742#true} #64#return; {27742#true} is VALID [2022-04-15 12:17:17,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {27742#true} call #t~ret6 := main(); {27742#true} is VALID [2022-04-15 12:17:17,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {27742#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {27747#(= main_~i~0 0)} is VALID [2022-04-15 12:17:17,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {27747#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27747#(= main_~i~0 0)} is VALID [2022-04-15 12:17:17,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {27747#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27748#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:17,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {27748#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27748#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:17,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {27748#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27749#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:17,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {27749#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27749#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:17,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {27749#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27750#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:17,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {27750#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27750#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:17,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {27750#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27751#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:17,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {27751#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27751#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:17,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {27751#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27752#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:17,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {27752#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27752#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:17,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {27752#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27753#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:17,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {27753#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27753#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:17,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {27753#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27754#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:17,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {27754#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27754#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:17,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {27754#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27755#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:17,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {27755#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27755#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:17,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {27755#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27756#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:17,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {27756#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27756#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:17,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {27756#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27757#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:17,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {27757#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27757#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:17,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {27757#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27758#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:17,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {27758#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27758#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:17,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {27758#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27759#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:17,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {27759#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27759#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:17,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {27759#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27760#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:17,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {27760#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27760#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:17,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {27760#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27761#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:17,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {27761#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27761#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:17,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {27761#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27762#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:17,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {27762#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27762#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:17,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {27762#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27763#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:17,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {27763#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27763#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:17,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {27763#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27764#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:17,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {27764#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27764#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:17,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {27764#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27765#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:17,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {27765#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27765#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:17,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {27765#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27766#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:17,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {27766#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27766#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:17,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {27766#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27767#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:17,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {27767#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27767#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:17,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {27767#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27768#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:17,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {27768#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27768#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:17,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {27768#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27769#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:17,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {27769#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27769#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:17,741 INFO L290 TraceCheckUtils]: 51: Hoare triple {27769#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27770#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:17,741 INFO L290 TraceCheckUtils]: 52: Hoare triple {27770#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27770#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:17,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {27770#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27771#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:17,742 INFO L290 TraceCheckUtils]: 54: Hoare triple {27771#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27771#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:17,742 INFO L290 TraceCheckUtils]: 55: Hoare triple {27771#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27772#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:17,742 INFO L290 TraceCheckUtils]: 56: Hoare triple {27772#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27772#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:17,742 INFO L290 TraceCheckUtils]: 57: Hoare triple {27772#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27773#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:17,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {27773#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27773#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:17,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {27773#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27774#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:17,743 INFO L290 TraceCheckUtils]: 60: Hoare triple {27774#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27774#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:17,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {27774#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27775#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:17,744 INFO L290 TraceCheckUtils]: 62: Hoare triple {27775#(<= main_~i~0 28)} assume !(~i~0 < 1024); {27743#false} is VALID [2022-04-15 12:17:17,744 INFO L290 TraceCheckUtils]: 63: Hoare triple {27743#false} ~i~0 := 0; {27743#false} is VALID [2022-04-15 12:17:17,744 INFO L290 TraceCheckUtils]: 64: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 12:17:17,744 INFO L290 TraceCheckUtils]: 65: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 12:17:17,744 INFO L290 TraceCheckUtils]: 66: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 12:17:17,744 INFO L290 TraceCheckUtils]: 67: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-15 12:17:17,744 INFO L290 TraceCheckUtils]: 68: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 12:17:17,744 INFO L290 TraceCheckUtils]: 69: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 12:17:17,744 INFO L290 TraceCheckUtils]: 70: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 12:17:17,744 INFO L290 TraceCheckUtils]: 71: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-15 12:17:17,744 INFO L290 TraceCheckUtils]: 72: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 12:17:17,745 INFO L290 TraceCheckUtils]: 73: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 12:17:17,745 INFO L290 TraceCheckUtils]: 74: Hoare triple {27743#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 12:17:17,745 INFO L272 TraceCheckUtils]: 75: Hoare triple {27743#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {27743#false} is VALID [2022-04-15 12:17:17,745 INFO L290 TraceCheckUtils]: 76: Hoare triple {27743#false} ~cond := #in~cond; {27743#false} is VALID [2022-04-15 12:17:17,745 INFO L290 TraceCheckUtils]: 77: Hoare triple {27743#false} assume 0 == ~cond; {27743#false} is VALID [2022-04-15 12:17:17,745 INFO L290 TraceCheckUtils]: 78: Hoare triple {27743#false} assume !false; {27743#false} is VALID [2022-04-15 12:17:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:17,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:17,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671715343] [2022-04-15 12:17:17,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671715343] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:17,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234141050] [2022-04-15 12:17:17,746 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:17,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:17,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:17,747 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:17,747 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:17,889 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:17,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:17,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 12:17:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:17,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:18,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {27742#true} call ULTIMATE.init(); {27742#true} is VALID [2022-04-15 12:17:18,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {27742#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27742#true} is VALID [2022-04-15 12:17:18,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {27742#true} assume true; {27742#true} is VALID [2022-04-15 12:17:18,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27742#true} {27742#true} #64#return; {27742#true} is VALID [2022-04-15 12:17:18,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {27742#true} call #t~ret6 := main(); {27742#true} is VALID [2022-04-15 12:17:18,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {27742#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {27795#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:18,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {27795#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27795#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:18,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {27795#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27748#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:18,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {27748#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27748#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:18,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {27748#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27749#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:18,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {27749#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27749#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:18,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {27749#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27750#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:18,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {27750#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27750#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:18,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {27750#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27751#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:18,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {27751#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27751#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:18,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {27751#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27752#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:18,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {27752#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27752#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:18,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {27752#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27753#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:18,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {27753#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27753#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:18,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {27753#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27754#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:18,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {27754#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27754#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:18,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {27754#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27755#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:18,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {27755#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27755#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:18,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {27755#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27756#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:18,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {27756#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27756#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:18,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {27756#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27757#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:18,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {27757#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27757#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:18,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {27757#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27758#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:18,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {27758#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27758#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:18,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {27758#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27759#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:18,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {27759#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27759#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:18,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {27759#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27760#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:18,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {27760#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27760#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:18,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {27760#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27761#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:18,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {27761#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27761#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:18,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {27761#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27762#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:18,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {27762#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27762#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:18,255 INFO L290 TraceCheckUtils]: 37: Hoare triple {27762#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27763#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:18,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {27763#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27763#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:18,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {27763#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27764#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:18,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {27764#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27764#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:18,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {27764#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27765#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:18,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {27765#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27765#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:18,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {27765#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27766#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:18,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {27766#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27766#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:18,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {27766#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27767#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:18,258 INFO L290 TraceCheckUtils]: 46: Hoare triple {27767#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27767#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:18,258 INFO L290 TraceCheckUtils]: 47: Hoare triple {27767#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27768#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:18,258 INFO L290 TraceCheckUtils]: 48: Hoare triple {27768#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27768#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:18,259 INFO L290 TraceCheckUtils]: 49: Hoare triple {27768#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27769#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:18,259 INFO L290 TraceCheckUtils]: 50: Hoare triple {27769#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27769#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:18,259 INFO L290 TraceCheckUtils]: 51: Hoare triple {27769#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27770#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:18,259 INFO L290 TraceCheckUtils]: 52: Hoare triple {27770#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27770#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:18,260 INFO L290 TraceCheckUtils]: 53: Hoare triple {27770#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27771#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:18,260 INFO L290 TraceCheckUtils]: 54: Hoare triple {27771#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27771#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:18,260 INFO L290 TraceCheckUtils]: 55: Hoare triple {27771#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27772#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:18,261 INFO L290 TraceCheckUtils]: 56: Hoare triple {27772#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27772#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:18,261 INFO L290 TraceCheckUtils]: 57: Hoare triple {27772#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27773#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:18,261 INFO L290 TraceCheckUtils]: 58: Hoare triple {27773#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27773#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:18,261 INFO L290 TraceCheckUtils]: 59: Hoare triple {27773#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27774#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:18,262 INFO L290 TraceCheckUtils]: 60: Hoare triple {27774#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27774#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:18,262 INFO L290 TraceCheckUtils]: 61: Hoare triple {27774#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27775#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:18,262 INFO L290 TraceCheckUtils]: 62: Hoare triple {27775#(<= main_~i~0 28)} assume !(~i~0 < 1024); {27743#false} is VALID [2022-04-15 12:17:18,262 INFO L290 TraceCheckUtils]: 63: Hoare triple {27743#false} ~i~0 := 0; {27743#false} is VALID [2022-04-15 12:17:18,262 INFO L290 TraceCheckUtils]: 64: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 12:17:18,263 INFO L290 TraceCheckUtils]: 65: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 12:17:18,263 INFO L290 TraceCheckUtils]: 66: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 12:17:18,263 INFO L290 TraceCheckUtils]: 67: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-15 12:17:18,263 INFO L290 TraceCheckUtils]: 68: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 12:17:18,263 INFO L290 TraceCheckUtils]: 69: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 12:17:18,263 INFO L290 TraceCheckUtils]: 70: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 12:17:18,263 INFO L290 TraceCheckUtils]: 71: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-15 12:17:18,263 INFO L290 TraceCheckUtils]: 72: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 12:17:18,263 INFO L290 TraceCheckUtils]: 73: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 12:17:18,263 INFO L290 TraceCheckUtils]: 74: Hoare triple {27743#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 12:17:18,263 INFO L272 TraceCheckUtils]: 75: Hoare triple {27743#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {27743#false} is VALID [2022-04-15 12:17:18,263 INFO L290 TraceCheckUtils]: 76: Hoare triple {27743#false} ~cond := #in~cond; {27743#false} is VALID [2022-04-15 12:17:18,263 INFO L290 TraceCheckUtils]: 77: Hoare triple {27743#false} assume 0 == ~cond; {27743#false} is VALID [2022-04-15 12:17:18,263 INFO L290 TraceCheckUtils]: 78: Hoare triple {27743#false} assume !false; {27743#false} is VALID [2022-04-15 12:17:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:18,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:19,388 INFO L290 TraceCheckUtils]: 78: Hoare triple {27743#false} assume !false; {27743#false} is VALID [2022-04-15 12:17:19,388 INFO L290 TraceCheckUtils]: 77: Hoare triple {27743#false} assume 0 == ~cond; {27743#false} is VALID [2022-04-15 12:17:19,388 INFO L290 TraceCheckUtils]: 76: Hoare triple {27743#false} ~cond := #in~cond; {27743#false} is VALID [2022-04-15 12:17:19,388 INFO L272 TraceCheckUtils]: 75: Hoare triple {27743#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {27743#false} is VALID [2022-04-15 12:17:19,388 INFO L290 TraceCheckUtils]: 74: Hoare triple {27743#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 12:17:19,388 INFO L290 TraceCheckUtils]: 73: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 12:17:19,388 INFO L290 TraceCheckUtils]: 72: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 12:17:19,388 INFO L290 TraceCheckUtils]: 71: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-15 12:17:19,388 INFO L290 TraceCheckUtils]: 70: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 12:17:19,388 INFO L290 TraceCheckUtils]: 69: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 12:17:19,388 INFO L290 TraceCheckUtils]: 68: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 12:17:19,389 INFO L290 TraceCheckUtils]: 67: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-15 12:17:19,389 INFO L290 TraceCheckUtils]: 66: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 12:17:19,389 INFO L290 TraceCheckUtils]: 65: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 12:17:19,389 INFO L290 TraceCheckUtils]: 64: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 12:17:19,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {27743#false} ~i~0 := 0; {27743#false} is VALID [2022-04-15 12:17:19,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {28063#(< main_~i~0 1024)} assume !(~i~0 < 1024); {27743#false} is VALID [2022-04-15 12:17:19,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {28067#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28063#(< main_~i~0 1024)} is VALID [2022-04-15 12:17:19,390 INFO L290 TraceCheckUtils]: 60: Hoare triple {28067#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28067#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:19,390 INFO L290 TraceCheckUtils]: 59: Hoare triple {28074#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28067#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:19,390 INFO L290 TraceCheckUtils]: 58: Hoare triple {28074#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28074#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:19,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {28081#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28074#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:19,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {28081#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28081#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:19,391 INFO L290 TraceCheckUtils]: 55: Hoare triple {28088#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28081#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:19,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {28088#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28088#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:19,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {28095#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28088#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:19,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {28095#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28095#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:19,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {28102#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28095#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:19,393 INFO L290 TraceCheckUtils]: 50: Hoare triple {28102#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28102#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:19,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {28109#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28102#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:19,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {28109#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28109#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:19,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {28116#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28109#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:19,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {28116#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28116#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:19,394 INFO L290 TraceCheckUtils]: 45: Hoare triple {28123#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28116#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:19,394 INFO L290 TraceCheckUtils]: 44: Hoare triple {28123#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28123#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:19,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {28130#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28123#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:19,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {28130#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28130#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:19,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {28137#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28130#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:19,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {28137#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28137#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:19,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {28144#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28137#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:19,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {28144#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28144#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:19,396 INFO L290 TraceCheckUtils]: 37: Hoare triple {28151#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28144#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:19,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {28151#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28151#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:19,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {28158#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28151#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:19,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {28158#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28158#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:19,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {28165#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28158#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:19,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {28165#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28165#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:19,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {28172#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28165#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:19,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {28172#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28172#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:19,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {28179#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28172#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:19,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {28179#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28179#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:19,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {28186#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28179#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:19,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {28186#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28186#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:19,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {28193#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28186#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:19,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {28193#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28193#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:19,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {28200#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28193#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:19,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {28200#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28200#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:19,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {28207#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28200#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:19,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {28207#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28207#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:19,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {28214#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28207#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:19,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {28214#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28214#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:19,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {28221#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28214#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:19,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {28221#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28221#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:19,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {28228#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28221#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:19,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {28228#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28228#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:19,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {28235#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28228#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:19,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {28235#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28235#(< main_~i~0 999)} is VALID [2022-04-15 12:17:19,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {28242#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28235#(< main_~i~0 999)} is VALID [2022-04-15 12:17:19,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {28242#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28242#(< main_~i~0 998)} is VALID [2022-04-15 12:17:19,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {28249#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28242#(< main_~i~0 998)} is VALID [2022-04-15 12:17:19,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {28249#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28249#(< main_~i~0 997)} is VALID [2022-04-15 12:17:19,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {28256#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28249#(< main_~i~0 997)} is VALID [2022-04-15 12:17:19,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {28256#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28256#(< main_~i~0 996)} is VALID [2022-04-15 12:17:19,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {27742#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28256#(< main_~i~0 996)} is VALID [2022-04-15 12:17:19,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {27742#true} call #t~ret6 := main(); {27742#true} is VALID [2022-04-15 12:17:19,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27742#true} {27742#true} #64#return; {27742#true} is VALID [2022-04-15 12:17:19,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {27742#true} assume true; {27742#true} is VALID [2022-04-15 12:17:19,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {27742#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {27742#true} is VALID [2022-04-15 12:17:19,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {27742#true} call ULTIMATE.init(); {27742#true} is VALID [2022-04-15 12:17:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:19,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234141050] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:19,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:19,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-15 12:17:19,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:19,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1923944718] [2022-04-15 12:17:19,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1923944718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:19,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:19,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:17:19,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771062807] [2022-04-15 12:17:19,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:19,408 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-04-15 12:17:19,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:19,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:19,450 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:17:19,450 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:17:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:19,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:17:19,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 12:17:19,451 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:22,487 INFO L93 Difference]: Finished difference Result 236 states and 298 transitions. [2022-04-15 12:17:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 12:17:22,488 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-04-15 12:17:22,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 289 transitions. [2022-04-15 12:17:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 289 transitions. [2022-04-15 12:17:22,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 289 transitions. [2022-04-15 12:17:22,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:22,687 INFO L225 Difference]: With dead ends: 236 [2022-04-15 12:17:22,687 INFO L226 Difference]: Without dead ends: 219 [2022-04-15 12:17:22,695 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3602, Invalid=4588, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 12:17:22,695 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 631 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:22,696 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 32 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:22,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-15 12:17:22,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 82. [2022-04-15 12:17:22,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:22,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,945 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,945 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:22,947 INFO L93 Difference]: Finished difference Result 219 states and 277 transitions. [2022-04-15 12:17:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2022-04-15 12:17:22,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:22,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:22,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 219 states. [2022-04-15 12:17:22,948 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 219 states. [2022-04-15 12:17:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:22,950 INFO L93 Difference]: Finished difference Result 219 states and 277 transitions. [2022-04-15 12:17:22,950 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2022-04-15 12:17:22,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:22,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:22,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:22,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-04-15 12:17:22,952 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 79 [2022-04-15 12:17:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:22,952 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-04-15 12:17:22,952 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 86 transitions. [2022-04-15 12:17:23,080 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:17:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-04-15 12:17:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 12:17:23,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:23,081 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:23,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:23,281 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:23,282 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:23,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:23,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2132365731, now seen corresponding path program 59 times [2022-04-15 12:17:23,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:23,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1065125101] [2022-04-15 12:17:23,286 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:23,286 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:23,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2132365731, now seen corresponding path program 60 times [2022-04-15 12:17:23,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:23,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093358710] [2022-04-15 12:17:23,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:23,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:23,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:23,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {29447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {29412#true} is VALID [2022-04-15 12:17:23,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {29412#true} assume true; {29412#true} is VALID [2022-04-15 12:17:23,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29412#true} {29412#true} #64#return; {29412#true} is VALID [2022-04-15 12:17:23,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {29412#true} call ULTIMATE.init(); {29447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:23,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {29447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {29412#true} is VALID [2022-04-15 12:17:23,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {29412#true} assume true; {29412#true} is VALID [2022-04-15 12:17:23,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29412#true} {29412#true} #64#return; {29412#true} is VALID [2022-04-15 12:17:23,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {29412#true} call #t~ret6 := main(); {29412#true} is VALID [2022-04-15 12:17:23,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {29412#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {29417#(= main_~i~0 0)} is VALID [2022-04-15 12:17:23,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {29417#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29417#(= main_~i~0 0)} is VALID [2022-04-15 12:17:23,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {29417#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29418#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:23,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {29418#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29418#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:23,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {29418#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29419#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:23,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {29419#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29419#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:23,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {29419#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29420#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:23,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {29420#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29420#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:23,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {29420#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29421#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:23,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {29421#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29421#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:23,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {29421#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29422#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:23,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {29422#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29422#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:23,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {29422#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29423#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:23,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {29423#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29423#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:23,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {29423#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29424#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:23,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {29424#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29424#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:23,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {29424#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29425#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:23,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {29425#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29425#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:23,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {29425#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29426#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:23,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {29426#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29426#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:23,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {29426#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29427#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:23,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {29427#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29427#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:23,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {29427#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29428#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:23,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {29428#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29428#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:23,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {29428#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29429#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:23,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {29429#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29429#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:23,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {29429#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29430#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:23,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {29430#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29430#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:23,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {29430#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29431#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:23,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {29431#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29431#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:23,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {29431#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29432#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:23,708 INFO L290 TraceCheckUtils]: 36: Hoare triple {29432#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29432#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:23,708 INFO L290 TraceCheckUtils]: 37: Hoare triple {29432#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29433#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:23,708 INFO L290 TraceCheckUtils]: 38: Hoare triple {29433#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29433#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:23,709 INFO L290 TraceCheckUtils]: 39: Hoare triple {29433#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29434#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:23,709 INFO L290 TraceCheckUtils]: 40: Hoare triple {29434#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29434#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:23,709 INFO L290 TraceCheckUtils]: 41: Hoare triple {29434#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29435#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:23,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {29435#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29435#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:23,710 INFO L290 TraceCheckUtils]: 43: Hoare triple {29435#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29436#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:23,710 INFO L290 TraceCheckUtils]: 44: Hoare triple {29436#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29436#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:23,710 INFO L290 TraceCheckUtils]: 45: Hoare triple {29436#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29437#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:23,711 INFO L290 TraceCheckUtils]: 46: Hoare triple {29437#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29437#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:23,711 INFO L290 TraceCheckUtils]: 47: Hoare triple {29437#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29438#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:23,711 INFO L290 TraceCheckUtils]: 48: Hoare triple {29438#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29438#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:23,712 INFO L290 TraceCheckUtils]: 49: Hoare triple {29438#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29439#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:23,712 INFO L290 TraceCheckUtils]: 50: Hoare triple {29439#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29439#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:23,712 INFO L290 TraceCheckUtils]: 51: Hoare triple {29439#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29440#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:23,712 INFO L290 TraceCheckUtils]: 52: Hoare triple {29440#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29440#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:23,713 INFO L290 TraceCheckUtils]: 53: Hoare triple {29440#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29441#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:23,713 INFO L290 TraceCheckUtils]: 54: Hoare triple {29441#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29441#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:23,713 INFO L290 TraceCheckUtils]: 55: Hoare triple {29441#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29442#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:23,714 INFO L290 TraceCheckUtils]: 56: Hoare triple {29442#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29442#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:23,714 INFO L290 TraceCheckUtils]: 57: Hoare triple {29442#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29443#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:23,714 INFO L290 TraceCheckUtils]: 58: Hoare triple {29443#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29443#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:23,714 INFO L290 TraceCheckUtils]: 59: Hoare triple {29443#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29444#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:23,715 INFO L290 TraceCheckUtils]: 60: Hoare triple {29444#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29444#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:23,715 INFO L290 TraceCheckUtils]: 61: Hoare triple {29444#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29445#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:23,715 INFO L290 TraceCheckUtils]: 62: Hoare triple {29445#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29445#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:23,716 INFO L290 TraceCheckUtils]: 63: Hoare triple {29445#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29446#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:23,716 INFO L290 TraceCheckUtils]: 64: Hoare triple {29446#(<= main_~i~0 29)} assume !(~i~0 < 1024); {29413#false} is VALID [2022-04-15 12:17:23,716 INFO L290 TraceCheckUtils]: 65: Hoare triple {29413#false} ~i~0 := 0; {29413#false} is VALID [2022-04-15 12:17:23,716 INFO L290 TraceCheckUtils]: 66: Hoare triple {29413#false} #t~short5 := ~i~0 < 1024; {29413#false} is VALID [2022-04-15 12:17:23,716 INFO L290 TraceCheckUtils]: 67: Hoare triple {29413#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29413#false} is VALID [2022-04-15 12:17:23,716 INFO L290 TraceCheckUtils]: 68: Hoare triple {29413#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29413#false} is VALID [2022-04-15 12:17:23,716 INFO L290 TraceCheckUtils]: 69: Hoare triple {29413#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29413#false} is VALID [2022-04-15 12:17:23,716 INFO L290 TraceCheckUtils]: 70: Hoare triple {29413#false} #t~short5 := ~i~0 < 1024; {29413#false} is VALID [2022-04-15 12:17:23,716 INFO L290 TraceCheckUtils]: 71: Hoare triple {29413#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29413#false} is VALID [2022-04-15 12:17:23,716 INFO L290 TraceCheckUtils]: 72: Hoare triple {29413#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29413#false} is VALID [2022-04-15 12:17:23,716 INFO L290 TraceCheckUtils]: 73: Hoare triple {29413#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29413#false} is VALID [2022-04-15 12:17:23,716 INFO L290 TraceCheckUtils]: 74: Hoare triple {29413#false} #t~short5 := ~i~0 < 1024; {29413#false} is VALID [2022-04-15 12:17:23,717 INFO L290 TraceCheckUtils]: 75: Hoare triple {29413#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29413#false} is VALID [2022-04-15 12:17:23,717 INFO L290 TraceCheckUtils]: 76: Hoare triple {29413#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {29413#false} is VALID [2022-04-15 12:17:23,717 INFO L272 TraceCheckUtils]: 77: Hoare triple {29413#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {29413#false} is VALID [2022-04-15 12:17:23,717 INFO L290 TraceCheckUtils]: 78: Hoare triple {29413#false} ~cond := #in~cond; {29413#false} is VALID [2022-04-15 12:17:23,717 INFO L290 TraceCheckUtils]: 79: Hoare triple {29413#false} assume 0 == ~cond; {29413#false} is VALID [2022-04-15 12:17:23,717 INFO L290 TraceCheckUtils]: 80: Hoare triple {29413#false} assume !false; {29413#false} is VALID [2022-04-15 12:17:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:23,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:23,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093358710] [2022-04-15 12:17:23,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093358710] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:23,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126995888] [2022-04-15 12:17:23,718 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:23,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:23,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:23,719 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:23,719 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:23,845 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:17:23,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:23,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:17:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:23,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:24,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {29412#true} call ULTIMATE.init(); {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {29412#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {29412#true} assume true; {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29412#true} {29412#true} #64#return; {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {29412#true} call #t~ret6 := main(); {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {29412#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 28: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 29: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 37: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 38: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 39: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 41: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 43: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 45: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 51: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 52: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 53: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 54: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,041 INFO L290 TraceCheckUtils]: 55: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,042 INFO L290 TraceCheckUtils]: 56: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,042 INFO L290 TraceCheckUtils]: 57: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,042 INFO L290 TraceCheckUtils]: 58: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,042 INFO L290 TraceCheckUtils]: 59: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,042 INFO L290 TraceCheckUtils]: 60: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,042 INFO L290 TraceCheckUtils]: 61: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,042 INFO L290 TraceCheckUtils]: 62: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,042 INFO L290 TraceCheckUtils]: 63: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,042 INFO L290 TraceCheckUtils]: 64: Hoare triple {29412#true} assume !(~i~0 < 1024); {29412#true} is VALID [2022-04-15 12:17:24,042 INFO L290 TraceCheckUtils]: 65: Hoare triple {29412#true} ~i~0 := 0; {29646#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:24,043 INFO L290 TraceCheckUtils]: 66: Hoare triple {29646#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {29646#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:24,043 INFO L290 TraceCheckUtils]: 67: Hoare triple {29646#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29646#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:24,043 INFO L290 TraceCheckUtils]: 68: Hoare triple {29646#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29646#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:24,043 INFO L290 TraceCheckUtils]: 69: Hoare triple {29646#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29418#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:24,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {29418#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {29418#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:24,044 INFO L290 TraceCheckUtils]: 71: Hoare triple {29418#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29418#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:24,044 INFO L290 TraceCheckUtils]: 72: Hoare triple {29418#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29418#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:24,044 INFO L290 TraceCheckUtils]: 73: Hoare triple {29418#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29419#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:24,045 INFO L290 TraceCheckUtils]: 74: Hoare triple {29419#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {29419#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:24,045 INFO L290 TraceCheckUtils]: 75: Hoare triple {29419#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29419#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:24,045 INFO L290 TraceCheckUtils]: 76: Hoare triple {29419#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {29419#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:24,046 INFO L272 TraceCheckUtils]: 77: Hoare triple {29419#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {29683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:24,046 INFO L290 TraceCheckUtils]: 78: Hoare triple {29683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:24,046 INFO L290 TraceCheckUtils]: 79: Hoare triple {29687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29413#false} is VALID [2022-04-15 12:17:24,046 INFO L290 TraceCheckUtils]: 80: Hoare triple {29413#false} assume !false; {29413#false} is VALID [2022-04-15 12:17:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-15 12:17:24,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:24,259 INFO L290 TraceCheckUtils]: 80: Hoare triple {29413#false} assume !false; {29413#false} is VALID [2022-04-15 12:17:24,259 INFO L290 TraceCheckUtils]: 79: Hoare triple {29687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29413#false} is VALID [2022-04-15 12:17:24,260 INFO L290 TraceCheckUtils]: 78: Hoare triple {29683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:24,260 INFO L272 TraceCheckUtils]: 77: Hoare triple {29703#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {29683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:24,260 INFO L290 TraceCheckUtils]: 76: Hoare triple {29703#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {29703#(<= main_~i~0 512)} is VALID [2022-04-15 12:17:24,261 INFO L290 TraceCheckUtils]: 75: Hoare triple {29703#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29703#(<= main_~i~0 512)} is VALID [2022-04-15 12:17:24,261 INFO L290 TraceCheckUtils]: 74: Hoare triple {29703#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {29703#(<= main_~i~0 512)} is VALID [2022-04-15 12:17:24,261 INFO L290 TraceCheckUtils]: 73: Hoare triple {29716#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29703#(<= main_~i~0 512)} is VALID [2022-04-15 12:17:24,261 INFO L290 TraceCheckUtils]: 72: Hoare triple {29716#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29716#(<= main_~i~0 511)} is VALID [2022-04-15 12:17:24,262 INFO L290 TraceCheckUtils]: 71: Hoare triple {29716#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29716#(<= main_~i~0 511)} is VALID [2022-04-15 12:17:24,262 INFO L290 TraceCheckUtils]: 70: Hoare triple {29716#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {29716#(<= main_~i~0 511)} is VALID [2022-04-15 12:17:24,262 INFO L290 TraceCheckUtils]: 69: Hoare triple {29729#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29716#(<= main_~i~0 511)} is VALID [2022-04-15 12:17:24,263 INFO L290 TraceCheckUtils]: 68: Hoare triple {29729#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29729#(<= main_~i~0 510)} is VALID [2022-04-15 12:17:24,263 INFO L290 TraceCheckUtils]: 67: Hoare triple {29729#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29729#(<= main_~i~0 510)} is VALID [2022-04-15 12:17:24,263 INFO L290 TraceCheckUtils]: 66: Hoare triple {29729#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {29729#(<= main_~i~0 510)} is VALID [2022-04-15 12:17:24,263 INFO L290 TraceCheckUtils]: 65: Hoare triple {29412#true} ~i~0 := 0; {29729#(<= main_~i~0 510)} is VALID [2022-04-15 12:17:24,263 INFO L290 TraceCheckUtils]: 64: Hoare triple {29412#true} assume !(~i~0 < 1024); {29412#true} is VALID [2022-04-15 12:17:24,263 INFO L290 TraceCheckUtils]: 63: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 62: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 61: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 60: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 59: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 58: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 57: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 56: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 55: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 54: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 51: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 50: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 49: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 47: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 46: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 12:17:24,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 12:17:24,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {29412#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {29412#true} is VALID [2022-04-15 12:17:24,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {29412#true} call #t~ret6 := main(); {29412#true} is VALID [2022-04-15 12:17:24,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29412#true} {29412#true} #64#return; {29412#true} is VALID [2022-04-15 12:17:24,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {29412#true} assume true; {29412#true} is VALID [2022-04-15 12:17:24,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {29412#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {29412#true} is VALID [2022-04-15 12:17:24,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {29412#true} call ULTIMATE.init(); {29412#true} is VALID [2022-04-15 12:17:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-15 12:17:24,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126995888] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:24,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:24,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 7, 7] total 39 [2022-04-15 12:17:24,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:24,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1065125101] [2022-04-15 12:17:24,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1065125101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:24,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:24,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 12:17:24,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287616498] [2022-04-15 12:17:24,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:24,268 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-15 12:17:24,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:24,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:24,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:24,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 12:17:24,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:24,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 12:17:24,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=846, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:17:24,312 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:27,507 INFO L93 Difference]: Finished difference Result 243 states and 307 transitions. [2022-04-15 12:17:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 12:17:27,507 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-15 12:17:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 298 transitions. [2022-04-15 12:17:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 298 transitions. [2022-04-15 12:17:27,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 298 transitions. [2022-04-15 12:17:27,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:27,714 INFO L225 Difference]: With dead ends: 243 [2022-04-15 12:17:27,715 INFO L226 Difference]: Without dead ends: 226 [2022-04-15 12:17:27,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1717, Invalid=2975, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 12:17:27,716 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 650 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:27,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [650 Valid, 42 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:27,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-15 12:17:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 84. [2022-04-15 12:17:27,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:27,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,992 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,992 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:27,995 INFO L93 Difference]: Finished difference Result 226 states and 286 transitions. [2022-04-15 12:17:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 286 transitions. [2022-04-15 12:17:27,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:27,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:27,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-15 12:17:27,996 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-15 12:17:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:27,998 INFO L93 Difference]: Finished difference Result 226 states and 286 transitions. [2022-04-15 12:17:27,998 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 286 transitions. [2022-04-15 12:17:27,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:27,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:27,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:27,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-04-15 12:17:27,999 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 81 [2022-04-15 12:17:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:27,999 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-04-15 12:17:28,000 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:28,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 88 transitions. [2022-04-15 12:17:28,128 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:17:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-15 12:17:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 12:17:28,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:28,128 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:28,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:28,328 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:28,329 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:28,329 INFO L85 PathProgramCache]: Analyzing trace with hash -110883775, now seen corresponding path program 61 times [2022-04-15 12:17:28,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:28,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1271116307] [2022-04-15 12:17:28,333 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:28,333 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:28,333 INFO L85 PathProgramCache]: Analyzing trace with hash -110883775, now seen corresponding path program 62 times [2022-04-15 12:17:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:28,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997564105] [2022-04-15 12:17:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:28,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:28,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:28,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {31141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {31105#true} is VALID [2022-04-15 12:17:28,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {31105#true} assume true; {31105#true} is VALID [2022-04-15 12:17:28,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31105#true} {31105#true} #64#return; {31105#true} is VALID [2022-04-15 12:17:28,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {31105#true} call ULTIMATE.init(); {31141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:28,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {31141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {31105#true} is VALID [2022-04-15 12:17:28,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {31105#true} assume true; {31105#true} is VALID [2022-04-15 12:17:28,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31105#true} {31105#true} #64#return; {31105#true} is VALID [2022-04-15 12:17:28,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {31105#true} call #t~ret6 := main(); {31105#true} is VALID [2022-04-15 12:17:28,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {31105#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31110#(= main_~i~0 0)} is VALID [2022-04-15 12:17:28,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {31110#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31110#(= main_~i~0 0)} is VALID [2022-04-15 12:17:28,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {31110#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31111#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:28,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {31111#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31111#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:28,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {31111#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31112#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:28,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {31112#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31112#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:28,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {31112#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31113#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:28,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {31113#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31113#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:28,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {31113#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31114#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:28,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {31114#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31114#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:28,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {31114#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31115#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:28,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {31115#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31115#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:28,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {31115#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31116#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:28,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {31116#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31116#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:28,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {31116#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31117#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:28,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {31117#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31117#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:28,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {31117#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31118#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:28,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {31118#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31118#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:28,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {31118#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31119#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:28,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {31119#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31119#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:28,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {31119#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31120#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:28,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {31120#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31120#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:28,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {31120#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31121#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:28,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {31121#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31121#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:28,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {31121#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31122#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:28,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {31122#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31122#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:28,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {31122#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31123#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:28,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {31123#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31123#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:28,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {31123#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31124#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:28,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {31124#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31124#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:28,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {31124#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31125#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:28,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {31125#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31125#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:28,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {31125#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31126#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:28,764 INFO L290 TraceCheckUtils]: 38: Hoare triple {31126#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31126#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:28,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {31126#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31127#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:28,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {31127#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31127#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:28,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {31127#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31128#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:28,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {31128#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31128#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:28,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {31128#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31129#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:28,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {31129#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31129#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:28,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {31129#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31130#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:28,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {31130#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31130#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:28,767 INFO L290 TraceCheckUtils]: 47: Hoare triple {31130#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31131#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:28,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {31131#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31131#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:28,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {31131#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31132#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:28,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {31132#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31132#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:28,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {31132#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31133#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:28,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {31133#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31133#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:28,769 INFO L290 TraceCheckUtils]: 53: Hoare triple {31133#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31134#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:28,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {31134#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31134#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:28,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {31134#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31135#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:28,770 INFO L290 TraceCheckUtils]: 56: Hoare triple {31135#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31135#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:28,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {31135#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31136#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:28,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {31136#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31136#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:28,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {31136#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31137#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:28,771 INFO L290 TraceCheckUtils]: 60: Hoare triple {31137#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31137#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:28,771 INFO L290 TraceCheckUtils]: 61: Hoare triple {31137#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31138#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:28,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {31138#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31138#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:28,772 INFO L290 TraceCheckUtils]: 63: Hoare triple {31138#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31139#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:28,772 INFO L290 TraceCheckUtils]: 64: Hoare triple {31139#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31139#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:28,772 INFO L290 TraceCheckUtils]: 65: Hoare triple {31139#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31140#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 66: Hoare triple {31140#(<= main_~i~0 30)} assume !(~i~0 < 1024); {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 67: Hoare triple {31106#false} ~i~0 := 0; {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 68: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 69: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 70: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 71: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 72: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 73: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 74: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 75: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 76: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 77: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 78: Hoare triple {31106#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L272 TraceCheckUtils]: 79: Hoare triple {31106#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 80: Hoare triple {31106#false} ~cond := #in~cond; {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 81: Hoare triple {31106#false} assume 0 == ~cond; {31106#false} is VALID [2022-04-15 12:17:28,773 INFO L290 TraceCheckUtils]: 82: Hoare triple {31106#false} assume !false; {31106#false} is VALID [2022-04-15 12:17:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:28,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:28,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997564105] [2022-04-15 12:17:28,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997564105] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:28,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711788177] [2022-04-15 12:17:28,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:28,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:28,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:28,775 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:28,776 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:28,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:28,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:28,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 12:17:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:28,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:29,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {31105#true} call ULTIMATE.init(); {31105#true} is VALID [2022-04-15 12:17:29,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {31105#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {31105#true} is VALID [2022-04-15 12:17:29,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {31105#true} assume true; {31105#true} is VALID [2022-04-15 12:17:29,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31105#true} {31105#true} #64#return; {31105#true} is VALID [2022-04-15 12:17:29,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {31105#true} call #t~ret6 := main(); {31105#true} is VALID [2022-04-15 12:17:29,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {31105#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31160#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:29,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {31160#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31160#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:29,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {31160#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31111#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:29,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {31111#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31111#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:29,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {31111#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31112#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:29,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {31112#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31112#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:29,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {31112#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31113#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:29,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {31113#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31113#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:29,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {31113#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31114#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:29,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {31114#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31114#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:29,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {31114#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31115#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:29,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {31115#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31115#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:29,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {31115#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31116#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:29,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {31116#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31116#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:29,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {31116#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31117#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:29,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {31117#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31117#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:29,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {31117#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31118#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:29,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {31118#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31118#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:29,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {31118#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31119#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:29,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {31119#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31119#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:29,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {31119#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31120#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:29,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {31120#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31120#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:29,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {31120#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31121#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:29,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {31121#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31121#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:29,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {31121#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31122#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:29,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {31122#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31122#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:29,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {31122#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31123#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:29,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {31123#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31123#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:29,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {31123#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31124#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:29,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {31124#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31124#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:29,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {31124#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31125#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:29,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {31125#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31125#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:29,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {31125#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31126#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:29,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {31126#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31126#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:29,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {31126#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31127#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:29,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {31127#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31127#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:29,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {31127#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31128#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:29,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {31128#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31128#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:29,408 INFO L290 TraceCheckUtils]: 43: Hoare triple {31128#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31129#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:29,408 INFO L290 TraceCheckUtils]: 44: Hoare triple {31129#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31129#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:29,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {31129#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31130#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:29,408 INFO L290 TraceCheckUtils]: 46: Hoare triple {31130#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31130#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:29,409 INFO L290 TraceCheckUtils]: 47: Hoare triple {31130#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31131#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:29,409 INFO L290 TraceCheckUtils]: 48: Hoare triple {31131#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31131#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:29,409 INFO L290 TraceCheckUtils]: 49: Hoare triple {31131#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31132#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:29,409 INFO L290 TraceCheckUtils]: 50: Hoare triple {31132#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31132#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:29,410 INFO L290 TraceCheckUtils]: 51: Hoare triple {31132#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31133#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:29,410 INFO L290 TraceCheckUtils]: 52: Hoare triple {31133#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31133#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:29,410 INFO L290 TraceCheckUtils]: 53: Hoare triple {31133#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31134#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:29,411 INFO L290 TraceCheckUtils]: 54: Hoare triple {31134#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31134#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:29,411 INFO L290 TraceCheckUtils]: 55: Hoare triple {31134#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31135#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:29,411 INFO L290 TraceCheckUtils]: 56: Hoare triple {31135#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31135#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:29,411 INFO L290 TraceCheckUtils]: 57: Hoare triple {31135#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31136#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:29,412 INFO L290 TraceCheckUtils]: 58: Hoare triple {31136#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31136#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:29,412 INFO L290 TraceCheckUtils]: 59: Hoare triple {31136#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31137#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:29,412 INFO L290 TraceCheckUtils]: 60: Hoare triple {31137#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31137#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:29,413 INFO L290 TraceCheckUtils]: 61: Hoare triple {31137#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31138#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:29,413 INFO L290 TraceCheckUtils]: 62: Hoare triple {31138#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31138#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:29,413 INFO L290 TraceCheckUtils]: 63: Hoare triple {31138#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31139#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:29,413 INFO L290 TraceCheckUtils]: 64: Hoare triple {31139#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31139#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:29,414 INFO L290 TraceCheckUtils]: 65: Hoare triple {31139#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31140#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:29,414 INFO L290 TraceCheckUtils]: 66: Hoare triple {31140#(<= main_~i~0 30)} assume !(~i~0 < 1024); {31106#false} is VALID [2022-04-15 12:17:29,414 INFO L290 TraceCheckUtils]: 67: Hoare triple {31106#false} ~i~0 := 0; {31106#false} is VALID [2022-04-15 12:17:29,414 INFO L290 TraceCheckUtils]: 68: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 12:17:29,414 INFO L290 TraceCheckUtils]: 69: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 12:17:29,414 INFO L290 TraceCheckUtils]: 70: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 12:17:29,414 INFO L290 TraceCheckUtils]: 71: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-15 12:17:29,414 INFO L290 TraceCheckUtils]: 72: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 12:17:29,414 INFO L290 TraceCheckUtils]: 73: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 12:17:29,415 INFO L290 TraceCheckUtils]: 74: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 12:17:29,415 INFO L290 TraceCheckUtils]: 75: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-15 12:17:29,415 INFO L290 TraceCheckUtils]: 76: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 12:17:29,415 INFO L290 TraceCheckUtils]: 77: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 12:17:29,415 INFO L290 TraceCheckUtils]: 78: Hoare triple {31106#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 12:17:29,415 INFO L272 TraceCheckUtils]: 79: Hoare triple {31106#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {31106#false} is VALID [2022-04-15 12:17:29,415 INFO L290 TraceCheckUtils]: 80: Hoare triple {31106#false} ~cond := #in~cond; {31106#false} is VALID [2022-04-15 12:17:29,415 INFO L290 TraceCheckUtils]: 81: Hoare triple {31106#false} assume 0 == ~cond; {31106#false} is VALID [2022-04-15 12:17:29,415 INFO L290 TraceCheckUtils]: 82: Hoare triple {31106#false} assume !false; {31106#false} is VALID [2022-04-15 12:17:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:29,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:30,616 INFO L290 TraceCheckUtils]: 82: Hoare triple {31106#false} assume !false; {31106#false} is VALID [2022-04-15 12:17:30,616 INFO L290 TraceCheckUtils]: 81: Hoare triple {31106#false} assume 0 == ~cond; {31106#false} is VALID [2022-04-15 12:17:30,616 INFO L290 TraceCheckUtils]: 80: Hoare triple {31106#false} ~cond := #in~cond; {31106#false} is VALID [2022-04-15 12:17:30,616 INFO L272 TraceCheckUtils]: 79: Hoare triple {31106#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {31106#false} is VALID [2022-04-15 12:17:30,616 INFO L290 TraceCheckUtils]: 78: Hoare triple {31106#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 12:17:30,616 INFO L290 TraceCheckUtils]: 77: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 12:17:30,616 INFO L290 TraceCheckUtils]: 76: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 12:17:30,616 INFO L290 TraceCheckUtils]: 75: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-15 12:17:30,616 INFO L290 TraceCheckUtils]: 74: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 12:17:30,616 INFO L290 TraceCheckUtils]: 73: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 12:17:30,617 INFO L290 TraceCheckUtils]: 72: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 12:17:30,617 INFO L290 TraceCheckUtils]: 71: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-15 12:17:30,617 INFO L290 TraceCheckUtils]: 70: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 12:17:30,617 INFO L290 TraceCheckUtils]: 69: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 12:17:30,617 INFO L290 TraceCheckUtils]: 68: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 12:17:30,617 INFO L290 TraceCheckUtils]: 67: Hoare triple {31106#false} ~i~0 := 0; {31106#false} is VALID [2022-04-15 12:17:30,617 INFO L290 TraceCheckUtils]: 66: Hoare triple {31440#(< main_~i~0 1024)} assume !(~i~0 < 1024); {31106#false} is VALID [2022-04-15 12:17:30,617 INFO L290 TraceCheckUtils]: 65: Hoare triple {31444#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31440#(< main_~i~0 1024)} is VALID [2022-04-15 12:17:30,618 INFO L290 TraceCheckUtils]: 64: Hoare triple {31444#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31444#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:30,618 INFO L290 TraceCheckUtils]: 63: Hoare triple {31451#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31444#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:30,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {31451#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31451#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:30,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {31458#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31451#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:30,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {31458#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31458#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:30,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {31465#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31458#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:30,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {31465#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31465#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:30,620 INFO L290 TraceCheckUtils]: 57: Hoare triple {31472#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31465#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:30,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {31472#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31472#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:30,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {31479#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31472#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:30,621 INFO L290 TraceCheckUtils]: 54: Hoare triple {31479#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31479#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:30,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {31486#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31479#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:30,621 INFO L290 TraceCheckUtils]: 52: Hoare triple {31486#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31486#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:30,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {31493#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31486#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:30,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {31493#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31493#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:30,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {31500#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31493#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:30,622 INFO L290 TraceCheckUtils]: 48: Hoare triple {31500#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31500#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:30,623 INFO L290 TraceCheckUtils]: 47: Hoare triple {31507#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31500#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:30,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {31507#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31507#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:30,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {31514#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31507#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:30,624 INFO L290 TraceCheckUtils]: 44: Hoare triple {31514#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31514#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:30,624 INFO L290 TraceCheckUtils]: 43: Hoare triple {31521#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31514#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:30,624 INFO L290 TraceCheckUtils]: 42: Hoare triple {31521#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31521#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:30,625 INFO L290 TraceCheckUtils]: 41: Hoare triple {31528#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31521#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:30,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {31528#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31528#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:30,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {31535#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31528#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:30,625 INFO L290 TraceCheckUtils]: 38: Hoare triple {31535#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31535#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:30,626 INFO L290 TraceCheckUtils]: 37: Hoare triple {31542#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31535#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:30,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {31542#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31542#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:30,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {31549#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31542#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:30,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {31549#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31549#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:30,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {31556#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31549#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:30,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {31556#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31556#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:30,628 INFO L290 TraceCheckUtils]: 31: Hoare triple {31563#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31556#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:30,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {31563#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31563#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:30,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {31570#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31563#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:30,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {31570#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31570#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:30,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {31577#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31570#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:30,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {31577#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31577#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:30,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {31584#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31577#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:30,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {31584#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31584#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:30,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {31591#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31584#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:30,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {31591#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31591#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:30,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {31598#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31591#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:30,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {31598#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31598#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:30,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {31605#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31598#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:30,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {31605#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31605#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:30,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {31612#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31605#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:30,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {31612#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31612#(< main_~i~0 999)} is VALID [2022-04-15 12:17:30,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {31619#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31612#(< main_~i~0 999)} is VALID [2022-04-15 12:17:30,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {31619#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31619#(< main_~i~0 998)} is VALID [2022-04-15 12:17:30,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {31626#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31619#(< main_~i~0 998)} is VALID [2022-04-15 12:17:30,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {31626#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31626#(< main_~i~0 997)} is VALID [2022-04-15 12:17:30,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {31633#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31626#(< main_~i~0 997)} is VALID [2022-04-15 12:17:30,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {31633#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31633#(< main_~i~0 996)} is VALID [2022-04-15 12:17:30,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {31640#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31633#(< main_~i~0 996)} is VALID [2022-04-15 12:17:30,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {31640#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31640#(< main_~i~0 995)} is VALID [2022-04-15 12:17:30,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {31647#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31640#(< main_~i~0 995)} is VALID [2022-04-15 12:17:30,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {31647#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31647#(< main_~i~0 994)} is VALID [2022-04-15 12:17:30,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {31105#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31647#(< main_~i~0 994)} is VALID [2022-04-15 12:17:30,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {31105#true} call #t~ret6 := main(); {31105#true} is VALID [2022-04-15 12:17:30,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31105#true} {31105#true} #64#return; {31105#true} is VALID [2022-04-15 12:17:30,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {31105#true} assume true; {31105#true} is VALID [2022-04-15 12:17:30,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {31105#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {31105#true} is VALID [2022-04-15 12:17:30,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {31105#true} call ULTIMATE.init(); {31105#true} is VALID [2022-04-15 12:17:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:30,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711788177] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:30,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:30,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-15 12:17:30,637 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:30,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1271116307] [2022-04-15 12:17:30,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1271116307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:30,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:30,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:17:30,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291751465] [2022-04-15 12:17:30,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:30,637 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-15 12:17:30,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:30,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:30,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:30,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:17:30,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:30,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:17:30,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 12:17:30,687 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:34,199 INFO L93 Difference]: Finished difference Result 250 states and 316 transitions. [2022-04-15 12:17:34,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:17:34,199 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-15 12:17:34,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 307 transitions. [2022-04-15 12:17:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 307 transitions. [2022-04-15 12:17:34,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 307 transitions. [2022-04-15 12:17:34,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:34,414 INFO L225 Difference]: With dead ends: 250 [2022-04-15 12:17:34,414 INFO L226 Difference]: Without dead ends: 233 [2022-04-15 12:17:34,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4098, Invalid=5214, Unknown=0, NotChecked=0, Total=9312 [2022-04-15 12:17:34,414 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 745 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:34,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [745 Valid, 27 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:34,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-04-15 12:17:34,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 86. [2022-04-15 12:17:34,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:34,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:34,762 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:34,762 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:34,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:34,765 INFO L93 Difference]: Finished difference Result 233 states and 295 transitions. [2022-04-15 12:17:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 295 transitions. [2022-04-15 12:17:34,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:34,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:34,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 233 states. [2022-04-15 12:17:34,766 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 233 states. [2022-04-15 12:17:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:34,768 INFO L93 Difference]: Finished difference Result 233 states and 295 transitions. [2022-04-15 12:17:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 295 transitions. [2022-04-15 12:17:34,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:34,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:34,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:34,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-04-15 12:17:34,771 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 83 [2022-04-15 12:17:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:34,772 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-04-15 12:17:34,772 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:34,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 90 transitions. [2022-04-15 12:17:34,909 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:17:34,910 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-15 12:17:34,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 12:17:34,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:34,919 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:34,936 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:17:35,120 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:17:35,120 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:35,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:35,120 INFO L85 PathProgramCache]: Analyzing trace with hash 199923551, now seen corresponding path program 63 times [2022-04-15 12:17:35,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:35,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2043120078] [2022-04-15 12:17:35,125 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:35,125 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:35,125 INFO L85 PathProgramCache]: Analyzing trace with hash 199923551, now seen corresponding path program 64 times [2022-04-15 12:17:35,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:35,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907037735] [2022-04-15 12:17:35,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:35,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:35,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:35,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {32908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {32871#true} is VALID [2022-04-15 12:17:35,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {32871#true} assume true; {32871#true} is VALID [2022-04-15 12:17:35,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32871#true} {32871#true} #64#return; {32871#true} is VALID [2022-04-15 12:17:35,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {32871#true} call ULTIMATE.init(); {32908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:35,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {32908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {32871#true} is VALID [2022-04-15 12:17:35,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {32871#true} assume true; {32871#true} is VALID [2022-04-15 12:17:35,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32871#true} {32871#true} #64#return; {32871#true} is VALID [2022-04-15 12:17:35,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {32871#true} call #t~ret6 := main(); {32871#true} is VALID [2022-04-15 12:17:35,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {32871#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {32876#(= main_~i~0 0)} is VALID [2022-04-15 12:17:35,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {32876#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32876#(= main_~i~0 0)} is VALID [2022-04-15 12:17:35,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {32876#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32877#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:35,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {32877#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32877#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:35,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {32877#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32878#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:35,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {32878#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32878#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:35,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {32878#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32879#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:35,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {32879#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32879#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:35,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {32879#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32880#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:35,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {32880#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32880#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:35,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {32880#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32881#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:35,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {32881#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32881#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:35,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {32881#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32882#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:35,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {32882#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32882#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:35,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {32882#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32883#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:35,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {32883#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32883#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:35,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {32883#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32884#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:35,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {32884#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32884#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:35,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {32884#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32885#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:35,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {32885#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32885#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:35,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {32885#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32886#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:35,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {32886#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32886#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:35,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {32886#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32887#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:35,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {32887#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32887#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:35,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {32887#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32888#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:35,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {32888#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32888#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:35,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {32888#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32889#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:35,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {32889#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32889#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:35,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {32889#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32890#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:35,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {32890#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32890#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:35,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {32890#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32891#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:35,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {32891#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32891#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:35,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {32891#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32892#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:35,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {32892#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32892#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:35,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {32892#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32893#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:35,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {32893#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32893#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:35,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {32893#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32894#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:35,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {32894#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32894#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:35,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {32894#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32895#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:35,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {32895#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32895#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:35,603 INFO L290 TraceCheckUtils]: 45: Hoare triple {32895#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32896#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:35,603 INFO L290 TraceCheckUtils]: 46: Hoare triple {32896#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32896#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:35,603 INFO L290 TraceCheckUtils]: 47: Hoare triple {32896#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32897#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:35,604 INFO L290 TraceCheckUtils]: 48: Hoare triple {32897#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32897#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:35,604 INFO L290 TraceCheckUtils]: 49: Hoare triple {32897#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32898#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:35,604 INFO L290 TraceCheckUtils]: 50: Hoare triple {32898#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32898#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:35,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {32898#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32899#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:35,605 INFO L290 TraceCheckUtils]: 52: Hoare triple {32899#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32899#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:35,605 INFO L290 TraceCheckUtils]: 53: Hoare triple {32899#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32900#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:35,605 INFO L290 TraceCheckUtils]: 54: Hoare triple {32900#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32900#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:35,606 INFO L290 TraceCheckUtils]: 55: Hoare triple {32900#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32901#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:35,606 INFO L290 TraceCheckUtils]: 56: Hoare triple {32901#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32901#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:35,606 INFO L290 TraceCheckUtils]: 57: Hoare triple {32901#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32902#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:35,607 INFO L290 TraceCheckUtils]: 58: Hoare triple {32902#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32902#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:35,607 INFO L290 TraceCheckUtils]: 59: Hoare triple {32902#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32903#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:35,607 INFO L290 TraceCheckUtils]: 60: Hoare triple {32903#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32903#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:35,608 INFO L290 TraceCheckUtils]: 61: Hoare triple {32903#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32904#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:35,608 INFO L290 TraceCheckUtils]: 62: Hoare triple {32904#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32904#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:35,608 INFO L290 TraceCheckUtils]: 63: Hoare triple {32904#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32905#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:35,608 INFO L290 TraceCheckUtils]: 64: Hoare triple {32905#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32905#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:35,609 INFO L290 TraceCheckUtils]: 65: Hoare triple {32905#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32906#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:35,609 INFO L290 TraceCheckUtils]: 66: Hoare triple {32906#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32906#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:35,609 INFO L290 TraceCheckUtils]: 67: Hoare triple {32906#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32907#(<= main_~i~0 31)} is VALID [2022-04-15 12:17:35,610 INFO L290 TraceCheckUtils]: 68: Hoare triple {32907#(<= main_~i~0 31)} assume !(~i~0 < 1024); {32872#false} is VALID [2022-04-15 12:17:35,610 INFO L290 TraceCheckUtils]: 69: Hoare triple {32872#false} ~i~0 := 0; {32872#false} is VALID [2022-04-15 12:17:35,610 INFO L290 TraceCheckUtils]: 70: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 12:17:35,610 INFO L290 TraceCheckUtils]: 71: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 12:17:35,610 INFO L290 TraceCheckUtils]: 72: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 12:17:35,610 INFO L290 TraceCheckUtils]: 73: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-15 12:17:35,610 INFO L290 TraceCheckUtils]: 74: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 12:17:35,610 INFO L290 TraceCheckUtils]: 75: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 12:17:35,610 INFO L290 TraceCheckUtils]: 76: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 12:17:35,610 INFO L290 TraceCheckUtils]: 77: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-15 12:17:35,610 INFO L290 TraceCheckUtils]: 78: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 12:17:35,610 INFO L290 TraceCheckUtils]: 79: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 12:17:35,610 INFO L290 TraceCheckUtils]: 80: Hoare triple {32872#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 12:17:35,610 INFO L272 TraceCheckUtils]: 81: Hoare triple {32872#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {32872#false} is VALID [2022-04-15 12:17:35,611 INFO L290 TraceCheckUtils]: 82: Hoare triple {32872#false} ~cond := #in~cond; {32872#false} is VALID [2022-04-15 12:17:35,611 INFO L290 TraceCheckUtils]: 83: Hoare triple {32872#false} assume 0 == ~cond; {32872#false} is VALID [2022-04-15 12:17:35,611 INFO L290 TraceCheckUtils]: 84: Hoare triple {32872#false} assume !false; {32872#false} is VALID [2022-04-15 12:17:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:35,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:35,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907037735] [2022-04-15 12:17:35,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907037735] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:35,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203774330] [2022-04-15 12:17:35,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:35,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:35,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:35,613 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:17:35,614 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:17:35,772 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:35,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:35,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 12:17:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:35,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:36,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {32871#true} call ULTIMATE.init(); {32871#true} is VALID [2022-04-15 12:17:36,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {32871#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {32871#true} is VALID [2022-04-15 12:17:36,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {32871#true} assume true; {32871#true} is VALID [2022-04-15 12:17:36,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32871#true} {32871#true} #64#return; {32871#true} is VALID [2022-04-15 12:17:36,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {32871#true} call #t~ret6 := main(); {32871#true} is VALID [2022-04-15 12:17:36,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {32871#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {32927#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:36,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {32927#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32927#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:36,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {32927#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32877#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:36,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {32877#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32877#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:36,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {32877#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32878#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:36,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {32878#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32878#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:36,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {32878#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32879#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:36,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {32879#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32879#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:36,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {32879#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32880#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:36,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {32880#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32880#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:36,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {32880#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32881#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:36,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {32881#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32881#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:36,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {32881#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32882#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:36,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {32882#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32882#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:36,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {32882#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32883#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:36,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {32883#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32883#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:36,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {32883#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32884#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:36,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {32884#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32884#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:36,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {32884#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32885#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:36,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {32885#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32885#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:36,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {32885#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32886#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:36,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {32886#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32886#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:36,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {32886#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32887#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:36,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {32887#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32887#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:36,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {32887#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32888#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:36,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {32888#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32888#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:36,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {32888#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32889#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:36,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {32889#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32889#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:36,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {32889#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32890#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:36,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {32890#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32890#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:36,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {32890#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32891#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:36,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {32891#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32891#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:36,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {32891#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32892#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:36,213 INFO L290 TraceCheckUtils]: 38: Hoare triple {32892#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32892#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:36,214 INFO L290 TraceCheckUtils]: 39: Hoare triple {32892#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32893#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:36,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {32893#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32893#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:36,214 INFO L290 TraceCheckUtils]: 41: Hoare triple {32893#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32894#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:36,214 INFO L290 TraceCheckUtils]: 42: Hoare triple {32894#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32894#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:36,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {32894#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32895#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:36,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {32895#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32895#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:36,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {32895#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32896#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:36,216 INFO L290 TraceCheckUtils]: 46: Hoare triple {32896#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32896#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:36,216 INFO L290 TraceCheckUtils]: 47: Hoare triple {32896#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32897#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:36,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {32897#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32897#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:36,217 INFO L290 TraceCheckUtils]: 49: Hoare triple {32897#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32898#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:36,217 INFO L290 TraceCheckUtils]: 50: Hoare triple {32898#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32898#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:36,217 INFO L290 TraceCheckUtils]: 51: Hoare triple {32898#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32899#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:36,217 INFO L290 TraceCheckUtils]: 52: Hoare triple {32899#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32899#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:36,218 INFO L290 TraceCheckUtils]: 53: Hoare triple {32899#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32900#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:36,218 INFO L290 TraceCheckUtils]: 54: Hoare triple {32900#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32900#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:36,218 INFO L290 TraceCheckUtils]: 55: Hoare triple {32900#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32901#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:36,219 INFO L290 TraceCheckUtils]: 56: Hoare triple {32901#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32901#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:36,219 INFO L290 TraceCheckUtils]: 57: Hoare triple {32901#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32902#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:36,219 INFO L290 TraceCheckUtils]: 58: Hoare triple {32902#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32902#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:36,220 INFO L290 TraceCheckUtils]: 59: Hoare triple {32902#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32903#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:36,220 INFO L290 TraceCheckUtils]: 60: Hoare triple {32903#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32903#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:36,220 INFO L290 TraceCheckUtils]: 61: Hoare triple {32903#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32904#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:36,220 INFO L290 TraceCheckUtils]: 62: Hoare triple {32904#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32904#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:36,221 INFO L290 TraceCheckUtils]: 63: Hoare triple {32904#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32905#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:36,221 INFO L290 TraceCheckUtils]: 64: Hoare triple {32905#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32905#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:36,221 INFO L290 TraceCheckUtils]: 65: Hoare triple {32905#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32906#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:36,221 INFO L290 TraceCheckUtils]: 66: Hoare triple {32906#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32906#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:36,222 INFO L290 TraceCheckUtils]: 67: Hoare triple {32906#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32907#(<= main_~i~0 31)} is VALID [2022-04-15 12:17:36,222 INFO L290 TraceCheckUtils]: 68: Hoare triple {32907#(<= main_~i~0 31)} assume !(~i~0 < 1024); {32872#false} is VALID [2022-04-15 12:17:36,222 INFO L290 TraceCheckUtils]: 69: Hoare triple {32872#false} ~i~0 := 0; {32872#false} is VALID [2022-04-15 12:17:36,222 INFO L290 TraceCheckUtils]: 70: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 12:17:36,222 INFO L290 TraceCheckUtils]: 71: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 12:17:36,222 INFO L290 TraceCheckUtils]: 72: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 12:17:36,222 INFO L290 TraceCheckUtils]: 73: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-15 12:17:36,222 INFO L290 TraceCheckUtils]: 74: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 12:17:36,223 INFO L290 TraceCheckUtils]: 75: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 12:17:36,223 INFO L290 TraceCheckUtils]: 76: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 12:17:36,223 INFO L290 TraceCheckUtils]: 77: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-15 12:17:36,223 INFO L290 TraceCheckUtils]: 78: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 12:17:36,223 INFO L290 TraceCheckUtils]: 79: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 12:17:36,223 INFO L290 TraceCheckUtils]: 80: Hoare triple {32872#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 12:17:36,223 INFO L272 TraceCheckUtils]: 81: Hoare triple {32872#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {32872#false} is VALID [2022-04-15 12:17:36,223 INFO L290 TraceCheckUtils]: 82: Hoare triple {32872#false} ~cond := #in~cond; {32872#false} is VALID [2022-04-15 12:17:36,223 INFO L290 TraceCheckUtils]: 83: Hoare triple {32872#false} assume 0 == ~cond; {32872#false} is VALID [2022-04-15 12:17:36,223 INFO L290 TraceCheckUtils]: 84: Hoare triple {32872#false} assume !false; {32872#false} is VALID [2022-04-15 12:17:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:36,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:37,484 INFO L290 TraceCheckUtils]: 84: Hoare triple {32872#false} assume !false; {32872#false} is VALID [2022-04-15 12:17:37,484 INFO L290 TraceCheckUtils]: 83: Hoare triple {32872#false} assume 0 == ~cond; {32872#false} is VALID [2022-04-15 12:17:37,484 INFO L290 TraceCheckUtils]: 82: Hoare triple {32872#false} ~cond := #in~cond; {32872#false} is VALID [2022-04-15 12:17:37,484 INFO L272 TraceCheckUtils]: 81: Hoare triple {32872#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {32872#false} is VALID [2022-04-15 12:17:37,484 INFO L290 TraceCheckUtils]: 80: Hoare triple {32872#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 12:17:37,485 INFO L290 TraceCheckUtils]: 79: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 12:17:37,485 INFO L290 TraceCheckUtils]: 78: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 12:17:37,485 INFO L290 TraceCheckUtils]: 77: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-15 12:17:37,485 INFO L290 TraceCheckUtils]: 76: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 12:17:37,485 INFO L290 TraceCheckUtils]: 75: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 12:17:37,485 INFO L290 TraceCheckUtils]: 74: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 12:17:37,485 INFO L290 TraceCheckUtils]: 73: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-15 12:17:37,485 INFO L290 TraceCheckUtils]: 72: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 12:17:37,485 INFO L290 TraceCheckUtils]: 71: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 12:17:37,485 INFO L290 TraceCheckUtils]: 70: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 12:17:37,485 INFO L290 TraceCheckUtils]: 69: Hoare triple {32872#false} ~i~0 := 0; {32872#false} is VALID [2022-04-15 12:17:37,485 INFO L290 TraceCheckUtils]: 68: Hoare triple {33213#(< main_~i~0 1024)} assume !(~i~0 < 1024); {32872#false} is VALID [2022-04-15 12:17:37,486 INFO L290 TraceCheckUtils]: 67: Hoare triple {33217#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33213#(< main_~i~0 1024)} is VALID [2022-04-15 12:17:37,486 INFO L290 TraceCheckUtils]: 66: Hoare triple {33217#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33217#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:37,486 INFO L290 TraceCheckUtils]: 65: Hoare triple {33224#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33217#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:37,487 INFO L290 TraceCheckUtils]: 64: Hoare triple {33224#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33224#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:37,487 INFO L290 TraceCheckUtils]: 63: Hoare triple {33231#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33224#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:37,487 INFO L290 TraceCheckUtils]: 62: Hoare triple {33231#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33231#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:37,487 INFO L290 TraceCheckUtils]: 61: Hoare triple {33238#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33231#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:37,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {33238#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33238#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:37,488 INFO L290 TraceCheckUtils]: 59: Hoare triple {33245#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33238#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:37,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {33245#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33245#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:37,489 INFO L290 TraceCheckUtils]: 57: Hoare triple {33252#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33245#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:37,489 INFO L290 TraceCheckUtils]: 56: Hoare triple {33252#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33252#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:37,489 INFO L290 TraceCheckUtils]: 55: Hoare triple {33259#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33252#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:37,489 INFO L290 TraceCheckUtils]: 54: Hoare triple {33259#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33259#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:37,490 INFO L290 TraceCheckUtils]: 53: Hoare triple {33266#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33259#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:37,490 INFO L290 TraceCheckUtils]: 52: Hoare triple {33266#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33266#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:37,490 INFO L290 TraceCheckUtils]: 51: Hoare triple {33273#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33266#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:37,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {33273#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33273#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:37,491 INFO L290 TraceCheckUtils]: 49: Hoare triple {33280#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33273#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:37,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {33280#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33280#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:37,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {33287#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33280#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:37,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {33287#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33287#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:37,492 INFO L290 TraceCheckUtils]: 45: Hoare triple {33294#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33287#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:37,492 INFO L290 TraceCheckUtils]: 44: Hoare triple {33294#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33294#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:37,493 INFO L290 TraceCheckUtils]: 43: Hoare triple {33301#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33294#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:37,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {33301#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33301#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:37,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {33308#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33301#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:37,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {33308#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33308#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:37,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {33315#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33308#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:37,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {33315#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33315#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:37,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {33322#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33315#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:37,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {33322#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33322#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:37,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {33329#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33322#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:37,495 INFO L290 TraceCheckUtils]: 34: Hoare triple {33329#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33329#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:37,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {33336#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33329#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:37,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {33336#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33336#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:37,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {33343#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33336#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:37,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {33343#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33343#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:37,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {33350#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33343#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:37,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {33350#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33350#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:37,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {33357#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33350#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:37,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {33357#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33357#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:37,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {33364#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33357#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:37,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {33364#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33364#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:37,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {33371#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33364#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:37,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {33371#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33371#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:37,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {33378#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33371#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:37,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {33378#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33378#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:37,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {33385#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33378#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:37,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {33385#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33385#(< main_~i~0 999)} is VALID [2022-04-15 12:17:37,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {33392#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33385#(< main_~i~0 999)} is VALID [2022-04-15 12:17:37,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {33392#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33392#(< main_~i~0 998)} is VALID [2022-04-15 12:17:37,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {33399#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33392#(< main_~i~0 998)} is VALID [2022-04-15 12:17:37,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {33399#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33399#(< main_~i~0 997)} is VALID [2022-04-15 12:17:37,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {33406#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33399#(< main_~i~0 997)} is VALID [2022-04-15 12:17:37,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {33406#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33406#(< main_~i~0 996)} is VALID [2022-04-15 12:17:37,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {33413#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33406#(< main_~i~0 996)} is VALID [2022-04-15 12:17:37,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {33413#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33413#(< main_~i~0 995)} is VALID [2022-04-15 12:17:37,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {33420#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33413#(< main_~i~0 995)} is VALID [2022-04-15 12:17:37,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {33420#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33420#(< main_~i~0 994)} is VALID [2022-04-15 12:17:37,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {33427#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33420#(< main_~i~0 994)} is VALID [2022-04-15 12:17:37,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {33427#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33427#(< main_~i~0 993)} is VALID [2022-04-15 12:17:37,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {32871#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {33427#(< main_~i~0 993)} is VALID [2022-04-15 12:17:37,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {32871#true} call #t~ret6 := main(); {32871#true} is VALID [2022-04-15 12:17:37,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32871#true} {32871#true} #64#return; {32871#true} is VALID [2022-04-15 12:17:37,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {32871#true} assume true; {32871#true} is VALID [2022-04-15 12:17:37,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {32871#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {32871#true} is VALID [2022-04-15 12:17:37,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {32871#true} call ULTIMATE.init(); {32871#true} is VALID [2022-04-15 12:17:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:37,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203774330] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:37,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:37,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-15 12:17:37,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:37,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2043120078] [2022-04-15 12:17:37,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2043120078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:37,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:37,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 12:17:37,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181519416] [2022-04-15 12:17:37,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:37,518 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 12:17:37,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:37,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:37,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:37,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 12:17:37,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:37,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 12:17:37,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 12:17:37,566 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:41,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:41,250 INFO L93 Difference]: Finished difference Result 257 states and 325 transitions. [2022-04-15 12:17:41,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 12:17:41,250 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 12:17:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 316 transitions. [2022-04-15 12:17:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 316 transitions. [2022-04-15 12:17:41,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 316 transitions. [2022-04-15 12:17:41,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:41,466 INFO L225 Difference]: With dead ends: 257 [2022-04-15 12:17:41,466 INFO L226 Difference]: Without dead ends: 240 [2022-04-15 12:17:41,466 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4358, Invalid=5542, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 12:17:41,467 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 856 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:41,467 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [856 Valid, 37 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-15 12:17:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 88. [2022-04-15 12:17:41,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:41,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:41,763 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:41,763 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:41,766 INFO L93 Difference]: Finished difference Result 240 states and 304 transitions. [2022-04-15 12:17:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 304 transitions. [2022-04-15 12:17:41,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:41,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:41,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 240 states. [2022-04-15 12:17:41,766 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 240 states. [2022-04-15 12:17:41,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:41,769 INFO L93 Difference]: Finished difference Result 240 states and 304 transitions. [2022-04-15 12:17:41,769 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 304 transitions. [2022-04-15 12:17:41,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:41,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:41,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:41,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-04-15 12:17:41,770 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 85 [2022-04-15 12:17:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:41,770 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-04-15 12:17:41,770 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:41,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 92 transitions. [2022-04-15 12:17:41,918 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:17:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-04-15 12:17:41,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 12:17:41,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:41,918 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:41,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-15 12:17:42,118 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:17:42,119 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:42,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1761946883, now seen corresponding path program 65 times [2022-04-15 12:17:42,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:42,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1156640116] [2022-04-15 12:17:42,123 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:42,123 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1761946883, now seen corresponding path program 66 times [2022-04-15 12:17:42,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:42,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069440663] [2022-04-15 12:17:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:42,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:42,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:42,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {34723#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {34685#true} is VALID [2022-04-15 12:17:42,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {34685#true} assume true; {34685#true} is VALID [2022-04-15 12:17:42,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34685#true} {34685#true} #64#return; {34685#true} is VALID [2022-04-15 12:17:42,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {34685#true} call ULTIMATE.init(); {34723#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:42,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {34723#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {34685#true} is VALID [2022-04-15 12:17:42,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {34685#true} assume true; {34685#true} is VALID [2022-04-15 12:17:42,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34685#true} {34685#true} #64#return; {34685#true} is VALID [2022-04-15 12:17:42,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {34685#true} call #t~ret6 := main(); {34685#true} is VALID [2022-04-15 12:17:42,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {34685#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {34690#(= main_~i~0 0)} is VALID [2022-04-15 12:17:42,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {34690#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34690#(= main_~i~0 0)} is VALID [2022-04-15 12:17:42,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {34690#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34691#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:42,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {34691#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34691#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:42,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {34691#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34692#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:42,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {34692#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34692#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:42,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {34692#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34693#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:42,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {34693#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34693#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:42,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {34693#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34694#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:42,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {34694#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34694#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:42,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {34694#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34695#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:42,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {34695#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34695#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:42,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {34695#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34696#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:42,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {34696#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34696#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:42,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {34696#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34697#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:42,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {34697#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34697#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:42,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {34697#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34698#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:42,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {34698#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34698#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:42,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {34698#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34699#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:42,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {34699#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34699#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:42,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {34699#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34700#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:42,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {34700#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34700#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:42,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {34700#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34701#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:42,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {34701#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34701#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:42,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {34701#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34702#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:42,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {34702#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34702#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:42,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {34702#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34703#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:42,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {34703#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34703#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:42,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {34703#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34704#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:42,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {34704#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34704#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:42,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {34704#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34705#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:42,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {34705#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34705#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:42,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {34705#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34706#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:42,594 INFO L290 TraceCheckUtils]: 38: Hoare triple {34706#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34706#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:42,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {34706#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34707#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:42,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {34707#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34707#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:42,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {34707#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34708#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:42,595 INFO L290 TraceCheckUtils]: 42: Hoare triple {34708#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34708#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:42,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {34708#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34709#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:42,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {34709#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34709#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:42,596 INFO L290 TraceCheckUtils]: 45: Hoare triple {34709#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34710#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:42,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {34710#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34710#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:42,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {34710#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34711#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:42,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {34711#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34711#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:42,608 INFO L290 TraceCheckUtils]: 49: Hoare triple {34711#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34712#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:42,608 INFO L290 TraceCheckUtils]: 50: Hoare triple {34712#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34712#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:42,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {34712#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34713#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:42,609 INFO L290 TraceCheckUtils]: 52: Hoare triple {34713#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34713#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:42,609 INFO L290 TraceCheckUtils]: 53: Hoare triple {34713#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34714#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:42,610 INFO L290 TraceCheckUtils]: 54: Hoare triple {34714#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34714#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:42,610 INFO L290 TraceCheckUtils]: 55: Hoare triple {34714#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34715#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:42,610 INFO L290 TraceCheckUtils]: 56: Hoare triple {34715#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34715#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:42,611 INFO L290 TraceCheckUtils]: 57: Hoare triple {34715#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34716#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:42,611 INFO L290 TraceCheckUtils]: 58: Hoare triple {34716#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34716#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:42,611 INFO L290 TraceCheckUtils]: 59: Hoare triple {34716#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34717#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:42,612 INFO L290 TraceCheckUtils]: 60: Hoare triple {34717#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34717#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:42,612 INFO L290 TraceCheckUtils]: 61: Hoare triple {34717#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34718#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:42,612 INFO L290 TraceCheckUtils]: 62: Hoare triple {34718#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34718#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:42,612 INFO L290 TraceCheckUtils]: 63: Hoare triple {34718#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34719#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:42,613 INFO L290 TraceCheckUtils]: 64: Hoare triple {34719#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34719#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:42,613 INFO L290 TraceCheckUtils]: 65: Hoare triple {34719#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34720#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:42,613 INFO L290 TraceCheckUtils]: 66: Hoare triple {34720#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34720#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:42,614 INFO L290 TraceCheckUtils]: 67: Hoare triple {34720#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34721#(<= main_~i~0 31)} is VALID [2022-04-15 12:17:42,614 INFO L290 TraceCheckUtils]: 68: Hoare triple {34721#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34721#(<= main_~i~0 31)} is VALID [2022-04-15 12:17:42,614 INFO L290 TraceCheckUtils]: 69: Hoare triple {34721#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34722#(<= main_~i~0 32)} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 70: Hoare triple {34722#(<= main_~i~0 32)} assume !(~i~0 < 1024); {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 71: Hoare triple {34686#false} ~i~0 := 0; {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 72: Hoare triple {34686#false} #t~short5 := ~i~0 < 1024; {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 73: Hoare triple {34686#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 74: Hoare triple {34686#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 75: Hoare triple {34686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 76: Hoare triple {34686#false} #t~short5 := ~i~0 < 1024; {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 77: Hoare triple {34686#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 78: Hoare triple {34686#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 79: Hoare triple {34686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 80: Hoare triple {34686#false} #t~short5 := ~i~0 < 1024; {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 81: Hoare triple {34686#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 82: Hoare triple {34686#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L272 TraceCheckUtils]: 83: Hoare triple {34686#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 84: Hoare triple {34686#false} ~cond := #in~cond; {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 85: Hoare triple {34686#false} assume 0 == ~cond; {34686#false} is VALID [2022-04-15 12:17:42,615 INFO L290 TraceCheckUtils]: 86: Hoare triple {34686#false} assume !false; {34686#false} is VALID [2022-04-15 12:17:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:42,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:42,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069440663] [2022-04-15 12:17:42,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069440663] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:42,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754718574] [2022-04-15 12:17:42,616 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:42,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:42,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:42,617 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:17:42,618 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:17:42,761 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:17:42,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:42,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:17:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:42,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:42,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {34685#true} call ULTIMATE.init(); {34685#true} is VALID [2022-04-15 12:17:42,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {34685#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {34685#true} is VALID [2022-04-15 12:17:42,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {34685#true} assume true; {34685#true} is VALID [2022-04-15 12:17:42,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34685#true} {34685#true} #64#return; {34685#true} is VALID [2022-04-15 12:17:42,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {34685#true} call #t~ret6 := main(); {34685#true} is VALID [2022-04-15 12:17:42,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {34685#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {34685#true} is VALID [2022-04-15 12:17:42,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 41: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 42: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 43: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 44: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 45: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 46: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 47: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,972 INFO L290 TraceCheckUtils]: 48: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 49: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 51: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 54: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 55: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 56: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 57: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 58: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 59: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 60: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 61: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 62: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 63: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 64: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 65: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,973 INFO L290 TraceCheckUtils]: 66: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,974 INFO L290 TraceCheckUtils]: 67: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,974 INFO L290 TraceCheckUtils]: 68: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:42,974 INFO L290 TraceCheckUtils]: 69: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:42,974 INFO L290 TraceCheckUtils]: 70: Hoare triple {34685#true} assume !(~i~0 < 1024); {34685#true} is VALID [2022-04-15 12:17:42,974 INFO L290 TraceCheckUtils]: 71: Hoare triple {34685#true} ~i~0 := 0; {34940#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:42,974 INFO L290 TraceCheckUtils]: 72: Hoare triple {34940#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {34940#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:42,975 INFO L290 TraceCheckUtils]: 73: Hoare triple {34940#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34940#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:42,975 INFO L290 TraceCheckUtils]: 74: Hoare triple {34940#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {34940#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:42,975 INFO L290 TraceCheckUtils]: 75: Hoare triple {34940#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34691#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:42,975 INFO L290 TraceCheckUtils]: 76: Hoare triple {34691#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {34691#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:42,976 INFO L290 TraceCheckUtils]: 77: Hoare triple {34691#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34691#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:42,976 INFO L290 TraceCheckUtils]: 78: Hoare triple {34691#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {34691#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:42,976 INFO L290 TraceCheckUtils]: 79: Hoare triple {34691#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34692#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:42,976 INFO L290 TraceCheckUtils]: 80: Hoare triple {34692#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {34692#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:42,977 INFO L290 TraceCheckUtils]: 81: Hoare triple {34692#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34692#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:42,977 INFO L290 TraceCheckUtils]: 82: Hoare triple {34692#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {34692#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:42,977 INFO L272 TraceCheckUtils]: 83: Hoare triple {34692#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {34977#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:42,978 INFO L290 TraceCheckUtils]: 84: Hoare triple {34977#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34981#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:42,978 INFO L290 TraceCheckUtils]: 85: Hoare triple {34981#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34686#false} is VALID [2022-04-15 12:17:42,978 INFO L290 TraceCheckUtils]: 86: Hoare triple {34686#false} assume !false; {34686#false} is VALID [2022-04-15 12:17:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2022-04-15 12:17:42,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:43,230 INFO L290 TraceCheckUtils]: 86: Hoare triple {34686#false} assume !false; {34686#false} is VALID [2022-04-15 12:17:43,231 INFO L290 TraceCheckUtils]: 85: Hoare triple {34981#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34686#false} is VALID [2022-04-15 12:17:43,231 INFO L290 TraceCheckUtils]: 84: Hoare triple {34977#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34981#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:43,232 INFO L272 TraceCheckUtils]: 83: Hoare triple {34997#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {34977#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:43,232 INFO L290 TraceCheckUtils]: 82: Hoare triple {34997#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {34997#(<= main_~i~0 512)} is VALID [2022-04-15 12:17:43,232 INFO L290 TraceCheckUtils]: 81: Hoare triple {34997#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34997#(<= main_~i~0 512)} is VALID [2022-04-15 12:17:43,232 INFO L290 TraceCheckUtils]: 80: Hoare triple {34997#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {34997#(<= main_~i~0 512)} is VALID [2022-04-15 12:17:43,233 INFO L290 TraceCheckUtils]: 79: Hoare triple {35010#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34997#(<= main_~i~0 512)} is VALID [2022-04-15 12:17:43,233 INFO L290 TraceCheckUtils]: 78: Hoare triple {35010#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {35010#(<= main_~i~0 511)} is VALID [2022-04-15 12:17:43,233 INFO L290 TraceCheckUtils]: 77: Hoare triple {35010#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {35010#(<= main_~i~0 511)} is VALID [2022-04-15 12:17:43,234 INFO L290 TraceCheckUtils]: 76: Hoare triple {35010#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {35010#(<= main_~i~0 511)} is VALID [2022-04-15 12:17:43,234 INFO L290 TraceCheckUtils]: 75: Hoare triple {35023#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {35010#(<= main_~i~0 511)} is VALID [2022-04-15 12:17:43,234 INFO L290 TraceCheckUtils]: 74: Hoare triple {35023#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {35023#(<= main_~i~0 510)} is VALID [2022-04-15 12:17:43,234 INFO L290 TraceCheckUtils]: 73: Hoare triple {35023#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {35023#(<= main_~i~0 510)} is VALID [2022-04-15 12:17:43,235 INFO L290 TraceCheckUtils]: 72: Hoare triple {35023#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {35023#(<= main_~i~0 510)} is VALID [2022-04-15 12:17:43,235 INFO L290 TraceCheckUtils]: 71: Hoare triple {34685#true} ~i~0 := 0; {35023#(<= main_~i~0 510)} is VALID [2022-04-15 12:17:43,235 INFO L290 TraceCheckUtils]: 70: Hoare triple {34685#true} assume !(~i~0 < 1024); {34685#true} is VALID [2022-04-15 12:17:43,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,235 INFO L290 TraceCheckUtils]: 68: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,235 INFO L290 TraceCheckUtils]: 67: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,235 INFO L290 TraceCheckUtils]: 66: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,235 INFO L290 TraceCheckUtils]: 65: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,235 INFO L290 TraceCheckUtils]: 64: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,235 INFO L290 TraceCheckUtils]: 63: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 62: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 61: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 60: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 59: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 58: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 56: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 55: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 46: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 12:17:43,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 12:17:43,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {34685#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {34685#true} is VALID [2022-04-15 12:17:43,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {34685#true} call #t~ret6 := main(); {34685#true} is VALID [2022-04-15 12:17:43,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34685#true} {34685#true} #64#return; {34685#true} is VALID [2022-04-15 12:17:43,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {34685#true} assume true; {34685#true} is VALID [2022-04-15 12:17:43,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {34685#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {34685#true} is VALID [2022-04-15 12:17:43,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {34685#true} call ULTIMATE.init(); {34685#true} is VALID [2022-04-15 12:17:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2022-04-15 12:17:43,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754718574] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:43,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:43,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 7, 7] total 42 [2022-04-15 12:17:43,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:43,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1156640116] [2022-04-15 12:17:43,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1156640116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:43,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:43,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 12:17:43,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497923753] [2022-04-15 12:17:43,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:43,242 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-15 12:17:43,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:43,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:43,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:43,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 12:17:43,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:43,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 12:17:43,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=747, Invalid=975, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:17:43,303 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:47,279 INFO L93 Difference]: Finished difference Result 264 states and 334 transitions. [2022-04-15 12:17:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 12:17:47,279 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-15 12:17:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 325 transitions. [2022-04-15 12:17:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 325 transitions. [2022-04-15 12:17:47,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 325 transitions. [2022-04-15 12:17:47,515 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:17:47,519 INFO L225 Difference]: With dead ends: 264 [2022-04-15 12:17:47,519 INFO L226 Difference]: Without dead ends: 247 [2022-04-15 12:17:47,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2035, Invalid=3515, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 12:17:47,520 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 910 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:47,520 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [910 Valid, 27 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-15 12:17:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 90. [2022-04-15 12:17:47,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:47,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,927 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,928 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:47,937 INFO L93 Difference]: Finished difference Result 247 states and 313 transitions. [2022-04-15 12:17:47,937 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 313 transitions. [2022-04-15 12:17:47,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:47,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:47,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 247 states. [2022-04-15 12:17:47,938 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 247 states. [2022-04-15 12:17:47,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:47,942 INFO L93 Difference]: Finished difference Result 247 states and 313 transitions. [2022-04-15 12:17:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 313 transitions. [2022-04-15 12:17:47,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:47,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:47,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:47,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-04-15 12:17:47,944 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 87 [2022-04-15 12:17:47,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:47,944 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-04-15 12:17:47,945 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:47,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 94 transitions. [2022-04-15 12:17:48,131 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:17:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-04-15 12:17:48,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 12:17:48,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:48,132 INFO L499 BasicCegarLoop]: trace histogram [33, 33, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:48,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-15 12:17:48,333 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:17:48,333 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1628791013, now seen corresponding path program 67 times [2022-04-15 12:17:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:48,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [736709705] [2022-04-15 12:17:48,337 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:48,337 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1628791013, now seen corresponding path program 68 times [2022-04-15 12:17:48,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:48,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746637720] [2022-04-15 12:17:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:48,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:48,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:48,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {36558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {36519#true} is VALID [2022-04-15 12:17:48,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {36519#true} assume true; {36519#true} is VALID [2022-04-15 12:17:48,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36519#true} {36519#true} #64#return; {36519#true} is VALID [2022-04-15 12:17:48,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {36519#true} call ULTIMATE.init(); {36558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:48,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {36558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {36519#true} is VALID [2022-04-15 12:17:48,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {36519#true} assume true; {36519#true} is VALID [2022-04-15 12:17:48,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36519#true} {36519#true} #64#return; {36519#true} is VALID [2022-04-15 12:17:48,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {36519#true} call #t~ret6 := main(); {36519#true} is VALID [2022-04-15 12:17:48,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {36519#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {36524#(= main_~i~0 0)} is VALID [2022-04-15 12:17:48,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {36524#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36524#(= main_~i~0 0)} is VALID [2022-04-15 12:17:48,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {36524#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36525#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:48,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {36525#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36525#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:48,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {36525#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36526#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:48,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {36526#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36526#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:48,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {36526#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36527#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:48,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {36527#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36527#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:48,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {36527#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36528#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:48,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {36528#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36528#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:48,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {36528#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36529#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:48,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {36529#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36529#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:48,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {36529#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36530#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:48,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {36530#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36530#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:48,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {36530#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36531#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:48,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {36531#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36531#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:48,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {36531#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36532#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:48,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {36532#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36532#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:48,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {36532#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36533#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:48,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {36533#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36533#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:48,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {36533#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36534#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:48,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {36534#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36534#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:48,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {36534#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36535#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:48,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {36535#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36535#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:48,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {36535#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36536#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:48,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {36536#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36536#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:48,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {36536#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36537#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:48,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {36537#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36537#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:48,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {36537#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36538#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:48,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {36538#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36538#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:48,848 INFO L290 TraceCheckUtils]: 35: Hoare triple {36538#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36539#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:48,848 INFO L290 TraceCheckUtils]: 36: Hoare triple {36539#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36539#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:48,848 INFO L290 TraceCheckUtils]: 37: Hoare triple {36539#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36540#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:48,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {36540#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36540#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:48,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {36540#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36541#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:48,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {36541#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36541#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:48,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {36541#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36542#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:48,850 INFO L290 TraceCheckUtils]: 42: Hoare triple {36542#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36542#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:48,850 INFO L290 TraceCheckUtils]: 43: Hoare triple {36542#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36543#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:48,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {36543#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36543#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:48,851 INFO L290 TraceCheckUtils]: 45: Hoare triple {36543#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36544#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:48,851 INFO L290 TraceCheckUtils]: 46: Hoare triple {36544#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36544#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:48,851 INFO L290 TraceCheckUtils]: 47: Hoare triple {36544#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36545#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:48,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {36545#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36545#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:48,852 INFO L290 TraceCheckUtils]: 49: Hoare triple {36545#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36546#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:48,852 INFO L290 TraceCheckUtils]: 50: Hoare triple {36546#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36546#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:48,853 INFO L290 TraceCheckUtils]: 51: Hoare triple {36546#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36547#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:48,853 INFO L290 TraceCheckUtils]: 52: Hoare triple {36547#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36547#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:48,853 INFO L290 TraceCheckUtils]: 53: Hoare triple {36547#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36548#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:48,854 INFO L290 TraceCheckUtils]: 54: Hoare triple {36548#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36548#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:48,854 INFO L290 TraceCheckUtils]: 55: Hoare triple {36548#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36549#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:48,854 INFO L290 TraceCheckUtils]: 56: Hoare triple {36549#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36549#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:48,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {36549#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36550#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:48,855 INFO L290 TraceCheckUtils]: 58: Hoare triple {36550#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36550#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:48,855 INFO L290 TraceCheckUtils]: 59: Hoare triple {36550#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36551#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:48,855 INFO L290 TraceCheckUtils]: 60: Hoare triple {36551#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36551#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:48,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {36551#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36552#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:48,856 INFO L290 TraceCheckUtils]: 62: Hoare triple {36552#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36552#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:48,856 INFO L290 TraceCheckUtils]: 63: Hoare triple {36552#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36553#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:48,857 INFO L290 TraceCheckUtils]: 64: Hoare triple {36553#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36553#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:48,857 INFO L290 TraceCheckUtils]: 65: Hoare triple {36553#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36554#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:48,857 INFO L290 TraceCheckUtils]: 66: Hoare triple {36554#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36554#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:48,858 INFO L290 TraceCheckUtils]: 67: Hoare triple {36554#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36555#(<= main_~i~0 31)} is VALID [2022-04-15 12:17:48,858 INFO L290 TraceCheckUtils]: 68: Hoare triple {36555#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36555#(<= main_~i~0 31)} is VALID [2022-04-15 12:17:48,858 INFO L290 TraceCheckUtils]: 69: Hoare triple {36555#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36556#(<= main_~i~0 32)} is VALID [2022-04-15 12:17:48,858 INFO L290 TraceCheckUtils]: 70: Hoare triple {36556#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36556#(<= main_~i~0 32)} is VALID [2022-04-15 12:17:48,859 INFO L290 TraceCheckUtils]: 71: Hoare triple {36556#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36557#(<= main_~i~0 33)} is VALID [2022-04-15 12:17:48,859 INFO L290 TraceCheckUtils]: 72: Hoare triple {36557#(<= main_~i~0 33)} assume !(~i~0 < 1024); {36520#false} is VALID [2022-04-15 12:17:48,859 INFO L290 TraceCheckUtils]: 73: Hoare triple {36520#false} ~i~0 := 0; {36520#false} is VALID [2022-04-15 12:17:48,859 INFO L290 TraceCheckUtils]: 74: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 12:17:48,859 INFO L290 TraceCheckUtils]: 75: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 12:17:48,859 INFO L290 TraceCheckUtils]: 76: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 12:17:48,859 INFO L290 TraceCheckUtils]: 77: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-15 12:17:48,860 INFO L290 TraceCheckUtils]: 78: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 12:17:48,860 INFO L290 TraceCheckUtils]: 79: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 12:17:48,860 INFO L290 TraceCheckUtils]: 80: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 12:17:48,860 INFO L290 TraceCheckUtils]: 81: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-15 12:17:48,860 INFO L290 TraceCheckUtils]: 82: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 12:17:48,860 INFO L290 TraceCheckUtils]: 83: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 12:17:48,860 INFO L290 TraceCheckUtils]: 84: Hoare triple {36520#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 12:17:48,860 INFO L272 TraceCheckUtils]: 85: Hoare triple {36520#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {36520#false} is VALID [2022-04-15 12:17:48,860 INFO L290 TraceCheckUtils]: 86: Hoare triple {36520#false} ~cond := #in~cond; {36520#false} is VALID [2022-04-15 12:17:48,860 INFO L290 TraceCheckUtils]: 87: Hoare triple {36520#false} assume 0 == ~cond; {36520#false} is VALID [2022-04-15 12:17:48,860 INFO L290 TraceCheckUtils]: 88: Hoare triple {36520#false} assume !false; {36520#false} is VALID [2022-04-15 12:17:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:48,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:48,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746637720] [2022-04-15 12:17:48,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746637720] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:48,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245402832] [2022-04-15 12:17:48,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:48,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:48,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:48,862 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:17:48,864 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:17:49,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:49,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:49,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 12:17:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:49,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:49,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {36519#true} call ULTIMATE.init(); {36519#true} is VALID [2022-04-15 12:17:49,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {36519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {36519#true} is VALID [2022-04-15 12:17:49,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {36519#true} assume true; {36519#true} is VALID [2022-04-15 12:17:49,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36519#true} {36519#true} #64#return; {36519#true} is VALID [2022-04-15 12:17:49,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {36519#true} call #t~ret6 := main(); {36519#true} is VALID [2022-04-15 12:17:49,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {36519#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {36577#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:49,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {36577#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36577#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:49,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {36577#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36525#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:49,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {36525#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36525#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:49,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {36525#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36526#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:49,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {36526#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36526#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:49,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {36526#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36527#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:49,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {36527#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36527#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:49,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {36527#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36528#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:49,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {36528#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36528#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:49,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {36528#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36529#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:49,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {36529#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36529#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:49,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {36529#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36530#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:49,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {36530#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36530#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:49,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {36530#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36531#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:49,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {36531#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36531#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:49,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {36531#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36532#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:49,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {36532#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36532#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:49,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {36532#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36533#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:49,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {36533#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36533#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:49,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {36533#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36534#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:49,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {36534#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36534#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:49,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {36534#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36535#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:49,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {36535#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36535#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:49,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {36535#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36536#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:49,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {36536#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36536#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:49,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {36536#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36537#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:49,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {36537#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36537#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:49,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {36537#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36538#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:49,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {36538#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36538#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:49,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {36538#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36539#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:49,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {36539#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36539#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:49,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {36539#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36540#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:49,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {36540#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36540#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:49,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {36540#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36541#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:49,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {36541#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36541#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:49,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {36541#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36542#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:49,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {36542#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36542#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:49,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {36542#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36543#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:49,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {36543#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36543#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:49,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {36543#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36544#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:49,462 INFO L290 TraceCheckUtils]: 46: Hoare triple {36544#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36544#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:49,462 INFO L290 TraceCheckUtils]: 47: Hoare triple {36544#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36545#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:49,463 INFO L290 TraceCheckUtils]: 48: Hoare triple {36545#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36545#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:49,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {36545#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36546#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:49,463 INFO L290 TraceCheckUtils]: 50: Hoare triple {36546#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36546#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:49,464 INFO L290 TraceCheckUtils]: 51: Hoare triple {36546#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36547#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:49,464 INFO L290 TraceCheckUtils]: 52: Hoare triple {36547#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36547#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:49,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {36547#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36548#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:49,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {36548#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36548#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:49,465 INFO L290 TraceCheckUtils]: 55: Hoare triple {36548#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36549#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:49,465 INFO L290 TraceCheckUtils]: 56: Hoare triple {36549#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36549#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:49,465 INFO L290 TraceCheckUtils]: 57: Hoare triple {36549#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36550#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:49,466 INFO L290 TraceCheckUtils]: 58: Hoare triple {36550#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36550#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:49,466 INFO L290 TraceCheckUtils]: 59: Hoare triple {36550#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36551#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:49,466 INFO L290 TraceCheckUtils]: 60: Hoare triple {36551#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36551#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:49,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {36551#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36552#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:49,467 INFO L290 TraceCheckUtils]: 62: Hoare triple {36552#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36552#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:49,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {36552#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36553#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:49,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {36553#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36553#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:49,468 INFO L290 TraceCheckUtils]: 65: Hoare triple {36553#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36554#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:49,468 INFO L290 TraceCheckUtils]: 66: Hoare triple {36554#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36554#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:49,468 INFO L290 TraceCheckUtils]: 67: Hoare triple {36554#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36555#(<= main_~i~0 31)} is VALID [2022-04-15 12:17:49,468 INFO L290 TraceCheckUtils]: 68: Hoare triple {36555#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36555#(<= main_~i~0 31)} is VALID [2022-04-15 12:17:49,469 INFO L290 TraceCheckUtils]: 69: Hoare triple {36555#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36556#(<= main_~i~0 32)} is VALID [2022-04-15 12:17:49,469 INFO L290 TraceCheckUtils]: 70: Hoare triple {36556#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36556#(<= main_~i~0 32)} is VALID [2022-04-15 12:17:49,469 INFO L290 TraceCheckUtils]: 71: Hoare triple {36556#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36557#(<= main_~i~0 33)} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 72: Hoare triple {36557#(<= main_~i~0 33)} assume !(~i~0 < 1024); {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 73: Hoare triple {36520#false} ~i~0 := 0; {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 74: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 75: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 76: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 77: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 78: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 79: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 80: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 81: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 82: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 83: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 84: Hoare triple {36520#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L272 TraceCheckUtils]: 85: Hoare triple {36520#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 86: Hoare triple {36520#false} ~cond := #in~cond; {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 87: Hoare triple {36520#false} assume 0 == ~cond; {36520#false} is VALID [2022-04-15 12:17:49,470 INFO L290 TraceCheckUtils]: 88: Hoare triple {36520#false} assume !false; {36520#false} is VALID [2022-04-15 12:17:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:49,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:50,868 INFO L290 TraceCheckUtils]: 88: Hoare triple {36520#false} assume !false; {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L290 TraceCheckUtils]: 87: Hoare triple {36520#false} assume 0 == ~cond; {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L290 TraceCheckUtils]: 86: Hoare triple {36520#false} ~cond := #in~cond; {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L272 TraceCheckUtils]: 85: Hoare triple {36520#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L290 TraceCheckUtils]: 84: Hoare triple {36520#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L290 TraceCheckUtils]: 83: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L290 TraceCheckUtils]: 82: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L290 TraceCheckUtils]: 81: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L290 TraceCheckUtils]: 80: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L290 TraceCheckUtils]: 79: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L290 TraceCheckUtils]: 78: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L290 TraceCheckUtils]: 77: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L290 TraceCheckUtils]: 76: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L290 TraceCheckUtils]: 75: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L290 TraceCheckUtils]: 74: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 12:17:50,869 INFO L290 TraceCheckUtils]: 73: Hoare triple {36520#false} ~i~0 := 0; {36520#false} is VALID [2022-04-15 12:17:50,870 INFO L290 TraceCheckUtils]: 72: Hoare triple {36875#(< main_~i~0 1024)} assume !(~i~0 < 1024); {36520#false} is VALID [2022-04-15 12:17:50,870 INFO L290 TraceCheckUtils]: 71: Hoare triple {36879#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36875#(< main_~i~0 1024)} is VALID [2022-04-15 12:17:50,870 INFO L290 TraceCheckUtils]: 70: Hoare triple {36879#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36879#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:50,871 INFO L290 TraceCheckUtils]: 69: Hoare triple {36886#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36879#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:50,871 INFO L290 TraceCheckUtils]: 68: Hoare triple {36886#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36886#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:50,871 INFO L290 TraceCheckUtils]: 67: Hoare triple {36893#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36886#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:50,872 INFO L290 TraceCheckUtils]: 66: Hoare triple {36893#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36893#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:50,872 INFO L290 TraceCheckUtils]: 65: Hoare triple {36900#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36893#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:50,872 INFO L290 TraceCheckUtils]: 64: Hoare triple {36900#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36900#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:50,873 INFO L290 TraceCheckUtils]: 63: Hoare triple {36907#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36900#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:50,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {36907#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36907#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:50,873 INFO L290 TraceCheckUtils]: 61: Hoare triple {36914#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36907#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:50,873 INFO L290 TraceCheckUtils]: 60: Hoare triple {36914#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36914#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:50,874 INFO L290 TraceCheckUtils]: 59: Hoare triple {36921#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36914#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:50,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {36921#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36921#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:50,874 INFO L290 TraceCheckUtils]: 57: Hoare triple {36928#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36921#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:50,875 INFO L290 TraceCheckUtils]: 56: Hoare triple {36928#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36928#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:50,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {36935#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36928#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:50,875 INFO L290 TraceCheckUtils]: 54: Hoare triple {36935#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36935#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:50,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {36942#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36935#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:50,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {36942#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36942#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:50,876 INFO L290 TraceCheckUtils]: 51: Hoare triple {36949#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36942#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:50,876 INFO L290 TraceCheckUtils]: 50: Hoare triple {36949#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36949#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:50,877 INFO L290 TraceCheckUtils]: 49: Hoare triple {36956#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36949#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:50,877 INFO L290 TraceCheckUtils]: 48: Hoare triple {36956#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36956#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:50,877 INFO L290 TraceCheckUtils]: 47: Hoare triple {36963#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36956#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:50,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {36963#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36963#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:50,878 INFO L290 TraceCheckUtils]: 45: Hoare triple {36970#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36963#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:50,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {36970#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36970#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:50,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {36977#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36970#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:50,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {36977#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36977#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:50,879 INFO L290 TraceCheckUtils]: 41: Hoare triple {36984#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36977#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:50,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {36984#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36984#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:50,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {36991#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36984#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:50,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {36991#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36991#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:50,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {36998#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36991#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:50,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {36998#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36998#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:50,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {37005#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36998#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:50,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {37005#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37005#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:50,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {37012#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37005#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:50,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {37012#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37012#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:50,882 INFO L290 TraceCheckUtils]: 31: Hoare triple {37019#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37012#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:50,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {37019#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37019#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:50,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {37026#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37019#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:50,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {37026#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37026#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:50,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {37033#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37026#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:50,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {37033#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37033#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:50,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {37040#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37033#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:50,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {37040#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37040#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:50,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {37047#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37040#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:50,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {37047#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37047#(< main_~i~0 999)} is VALID [2022-04-15 12:17:50,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {37054#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37047#(< main_~i~0 999)} is VALID [2022-04-15 12:17:50,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {37054#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37054#(< main_~i~0 998)} is VALID [2022-04-15 12:17:50,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {37061#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37054#(< main_~i~0 998)} is VALID [2022-04-15 12:17:50,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {37061#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37061#(< main_~i~0 997)} is VALID [2022-04-15 12:17:50,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {37068#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37061#(< main_~i~0 997)} is VALID [2022-04-15 12:17:50,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {37068#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37068#(< main_~i~0 996)} is VALID [2022-04-15 12:17:50,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {37075#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37068#(< main_~i~0 996)} is VALID [2022-04-15 12:17:50,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {37075#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37075#(< main_~i~0 995)} is VALID [2022-04-15 12:17:50,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {37082#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37075#(< main_~i~0 995)} is VALID [2022-04-15 12:17:50,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {37082#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37082#(< main_~i~0 994)} is VALID [2022-04-15 12:17:50,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {37089#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37082#(< main_~i~0 994)} is VALID [2022-04-15 12:17:50,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {37089#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37089#(< main_~i~0 993)} is VALID [2022-04-15 12:17:50,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {37096#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37089#(< main_~i~0 993)} is VALID [2022-04-15 12:17:50,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {37096#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37096#(< main_~i~0 992)} is VALID [2022-04-15 12:17:50,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {37103#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37096#(< main_~i~0 992)} is VALID [2022-04-15 12:17:50,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {37103#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37103#(< main_~i~0 991)} is VALID [2022-04-15 12:17:50,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {36519#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {37103#(< main_~i~0 991)} is VALID [2022-04-15 12:17:50,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {36519#true} call #t~ret6 := main(); {36519#true} is VALID [2022-04-15 12:17:50,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36519#true} {36519#true} #64#return; {36519#true} is VALID [2022-04-15 12:17:50,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {36519#true} assume true; {36519#true} is VALID [2022-04-15 12:17:50,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {36519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {36519#true} is VALID [2022-04-15 12:17:50,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {36519#true} call ULTIMATE.init(); {36519#true} is VALID [2022-04-15 12:17:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:50,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245402832] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:50,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:50,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 72 [2022-04-15 12:17:50,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:50,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [736709705] [2022-04-15 12:17:50,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [736709705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:50,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:50,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 12:17:50,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604230184] [2022-04-15 12:17:50,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:50,891 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-15 12:17:50,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:50,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:50,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:50,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 12:17:50,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:50,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 12:17:50,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 12:17:50,941 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:55,144 INFO L93 Difference]: Finished difference Result 271 states and 343 transitions. [2022-04-15 12:17:55,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 12:17:55,144 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-15 12:17:55,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 334 transitions. [2022-04-15 12:17:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 334 transitions. [2022-04-15 12:17:55,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 334 transitions. [2022-04-15 12:17:55,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:55,362 INFO L225 Difference]: With dead ends: 271 [2022-04-15 12:17:55,362 INFO L226 Difference]: Without dead ends: 254 [2022-04-15 12:17:55,363 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4902, Invalid=6228, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 12:17:55,363 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 833 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:55,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [833 Valid, 32 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-15 12:17:55,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 92. [2022-04-15 12:17:55,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:55,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,684 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,695 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:55,698 INFO L93 Difference]: Finished difference Result 254 states and 322 transitions. [2022-04-15 12:17:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 322 transitions. [2022-04-15 12:17:55,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:55,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:55,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 254 states. [2022-04-15 12:17:55,699 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 254 states. [2022-04-15 12:17:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:55,701 INFO L93 Difference]: Finished difference Result 254 states and 322 transitions. [2022-04-15 12:17:55,701 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 322 transitions. [2022-04-15 12:17:55,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:55,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:55,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:55,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-04-15 12:17:55,703 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 89 [2022-04-15 12:17:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:55,703 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-04-15 12:17:55,703 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 96 transitions. [2022-04-15 12:17:55,853 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:17:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-04-15 12:17:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 12:17:55,854 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:55,854 INFO L499 BasicCegarLoop]: trace histogram [34, 34, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:55,873 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:17:56,054 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:17:56,054 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1779948473, now seen corresponding path program 69 times [2022-04-15 12:17:56,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:56,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [441252936] [2022-04-15 12:17:56,059 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:56,059 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:56,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1779948473, now seen corresponding path program 70 times [2022-04-15 12:17:56,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:56,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048245797] [2022-04-15 12:17:56,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:56,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:56,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:56,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {38469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {38429#true} is VALID [2022-04-15 12:17:56,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {38429#true} assume true; {38429#true} is VALID [2022-04-15 12:17:56,604 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38429#true} {38429#true} #64#return; {38429#true} is VALID [2022-04-15 12:17:56,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {38429#true} call ULTIMATE.init(); {38469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:56,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {38469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {38429#true} is VALID [2022-04-15 12:17:56,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {38429#true} assume true; {38429#true} is VALID [2022-04-15 12:17:56,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38429#true} {38429#true} #64#return; {38429#true} is VALID [2022-04-15 12:17:56,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {38429#true} call #t~ret6 := main(); {38429#true} is VALID [2022-04-15 12:17:56,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {38429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {38434#(= main_~i~0 0)} is VALID [2022-04-15 12:17:56,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {38434#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38434#(= main_~i~0 0)} is VALID [2022-04-15 12:17:56,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {38434#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38435#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:56,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {38435#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38435#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:56,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {38435#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38436#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:56,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {38436#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38436#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:56,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {38436#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38437#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:56,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {38437#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38437#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:56,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {38437#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38438#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:56,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {38438#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38438#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:56,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {38438#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38439#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:56,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {38439#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38439#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:56,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {38439#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38440#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:56,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {38440#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38440#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:56,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {38440#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38441#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:56,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {38441#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38441#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:56,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {38441#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38442#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:56,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {38442#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38442#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:56,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {38442#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38443#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:56,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {38443#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38443#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:56,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {38443#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38444#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:56,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {38444#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38444#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:56,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {38444#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38445#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:56,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {38445#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38445#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:56,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {38445#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38446#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:56,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {38446#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38446#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:56,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {38446#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38447#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:56,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {38447#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38447#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:56,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {38447#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38448#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:56,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {38448#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38448#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:56,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {38448#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38449#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:56,614 INFO L290 TraceCheckUtils]: 36: Hoare triple {38449#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38449#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:56,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {38449#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38450#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:56,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {38450#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38450#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:56,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {38450#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38451#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:56,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {38451#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38451#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:56,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {38451#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38452#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:56,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {38452#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38452#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:56,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {38452#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38453#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:56,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {38453#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38453#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:56,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {38453#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38454#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:56,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {38454#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38454#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:56,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {38454#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38455#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:56,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {38455#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38455#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:56,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {38455#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38456#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:56,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {38456#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38456#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:56,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {38456#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38457#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:56,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {38457#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38457#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:56,618 INFO L290 TraceCheckUtils]: 53: Hoare triple {38457#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38458#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:56,619 INFO L290 TraceCheckUtils]: 54: Hoare triple {38458#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38458#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:56,619 INFO L290 TraceCheckUtils]: 55: Hoare triple {38458#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38459#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:56,619 INFO L290 TraceCheckUtils]: 56: Hoare triple {38459#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38459#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:56,620 INFO L290 TraceCheckUtils]: 57: Hoare triple {38459#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38460#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:56,620 INFO L290 TraceCheckUtils]: 58: Hoare triple {38460#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38460#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:56,620 INFO L290 TraceCheckUtils]: 59: Hoare triple {38460#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38461#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:56,620 INFO L290 TraceCheckUtils]: 60: Hoare triple {38461#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38461#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:56,621 INFO L290 TraceCheckUtils]: 61: Hoare triple {38461#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38462#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:56,621 INFO L290 TraceCheckUtils]: 62: Hoare triple {38462#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38462#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:56,621 INFO L290 TraceCheckUtils]: 63: Hoare triple {38462#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38463#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:56,622 INFO L290 TraceCheckUtils]: 64: Hoare triple {38463#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38463#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:56,622 INFO L290 TraceCheckUtils]: 65: Hoare triple {38463#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38464#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:56,622 INFO L290 TraceCheckUtils]: 66: Hoare triple {38464#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38464#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:56,622 INFO L290 TraceCheckUtils]: 67: Hoare triple {38464#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38465#(<= main_~i~0 31)} is VALID [2022-04-15 12:17:56,623 INFO L290 TraceCheckUtils]: 68: Hoare triple {38465#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38465#(<= main_~i~0 31)} is VALID [2022-04-15 12:17:56,623 INFO L290 TraceCheckUtils]: 69: Hoare triple {38465#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38466#(<= main_~i~0 32)} is VALID [2022-04-15 12:17:56,623 INFO L290 TraceCheckUtils]: 70: Hoare triple {38466#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38466#(<= main_~i~0 32)} is VALID [2022-04-15 12:17:56,624 INFO L290 TraceCheckUtils]: 71: Hoare triple {38466#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38467#(<= main_~i~0 33)} is VALID [2022-04-15 12:17:56,624 INFO L290 TraceCheckUtils]: 72: Hoare triple {38467#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38467#(<= main_~i~0 33)} is VALID [2022-04-15 12:17:56,624 INFO L290 TraceCheckUtils]: 73: Hoare triple {38467#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38468#(<= main_~i~0 34)} is VALID [2022-04-15 12:17:56,624 INFO L290 TraceCheckUtils]: 74: Hoare triple {38468#(<= main_~i~0 34)} assume !(~i~0 < 1024); {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 75: Hoare triple {38430#false} ~i~0 := 0; {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 76: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 77: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 78: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 79: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 80: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 81: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 82: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 83: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 84: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 85: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 86: Hoare triple {38430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L272 TraceCheckUtils]: 87: Hoare triple {38430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 88: Hoare triple {38430#false} ~cond := #in~cond; {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 89: Hoare triple {38430#false} assume 0 == ~cond; {38430#false} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 90: Hoare triple {38430#false} assume !false; {38430#false} is VALID [2022-04-15 12:17:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:56,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:56,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048245797] [2022-04-15 12:17:56,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048245797] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:56,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098946752] [2022-04-15 12:17:56,626 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:56,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:56,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:56,627 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:17:56,628 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:17:56,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:56,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:56,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 12:17:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:56,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:57,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {38429#true} call ULTIMATE.init(); {38429#true} is VALID [2022-04-15 12:17:57,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {38429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {38429#true} is VALID [2022-04-15 12:17:57,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {38429#true} assume true; {38429#true} is VALID [2022-04-15 12:17:57,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38429#true} {38429#true} #64#return; {38429#true} is VALID [2022-04-15 12:17:57,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {38429#true} call #t~ret6 := main(); {38429#true} is VALID [2022-04-15 12:17:57,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {38429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {38488#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:57,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {38488#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38488#(<= main_~i~0 0)} is VALID [2022-04-15 12:17:57,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {38488#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38435#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:57,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {38435#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38435#(<= main_~i~0 1)} is VALID [2022-04-15 12:17:57,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {38435#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38436#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:57,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {38436#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38436#(<= main_~i~0 2)} is VALID [2022-04-15 12:17:57,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {38436#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38437#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:57,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {38437#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38437#(<= main_~i~0 3)} is VALID [2022-04-15 12:17:57,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {38437#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38438#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:57,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {38438#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38438#(<= main_~i~0 4)} is VALID [2022-04-15 12:17:57,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {38438#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38439#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:57,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {38439#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38439#(<= main_~i~0 5)} is VALID [2022-04-15 12:17:57,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {38439#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38440#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:57,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {38440#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38440#(<= main_~i~0 6)} is VALID [2022-04-15 12:17:57,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {38440#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38441#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:57,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {38441#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38441#(<= main_~i~0 7)} is VALID [2022-04-15 12:17:57,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {38441#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38442#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:57,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {38442#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38442#(<= main_~i~0 8)} is VALID [2022-04-15 12:17:57,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {38442#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38443#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:57,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {38443#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38443#(<= main_~i~0 9)} is VALID [2022-04-15 12:17:57,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {38443#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38444#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:57,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {38444#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38444#(<= main_~i~0 10)} is VALID [2022-04-15 12:17:57,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {38444#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38445#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:57,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {38445#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38445#(<= main_~i~0 11)} is VALID [2022-04-15 12:17:57,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {38445#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38446#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:57,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {38446#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38446#(<= main_~i~0 12)} is VALID [2022-04-15 12:17:57,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {38446#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38447#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:57,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {38447#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38447#(<= main_~i~0 13)} is VALID [2022-04-15 12:17:57,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {38447#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38448#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:57,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {38448#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38448#(<= main_~i~0 14)} is VALID [2022-04-15 12:17:57,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {38448#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38449#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:57,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {38449#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38449#(<= main_~i~0 15)} is VALID [2022-04-15 12:17:57,258 INFO L290 TraceCheckUtils]: 37: Hoare triple {38449#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38450#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:57,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {38450#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38450#(<= main_~i~0 16)} is VALID [2022-04-15 12:17:57,258 INFO L290 TraceCheckUtils]: 39: Hoare triple {38450#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38451#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:57,259 INFO L290 TraceCheckUtils]: 40: Hoare triple {38451#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38451#(<= main_~i~0 17)} is VALID [2022-04-15 12:17:57,259 INFO L290 TraceCheckUtils]: 41: Hoare triple {38451#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38452#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:57,259 INFO L290 TraceCheckUtils]: 42: Hoare triple {38452#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38452#(<= main_~i~0 18)} is VALID [2022-04-15 12:17:57,260 INFO L290 TraceCheckUtils]: 43: Hoare triple {38452#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38453#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:57,260 INFO L290 TraceCheckUtils]: 44: Hoare triple {38453#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38453#(<= main_~i~0 19)} is VALID [2022-04-15 12:17:57,260 INFO L290 TraceCheckUtils]: 45: Hoare triple {38453#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38454#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:57,261 INFO L290 TraceCheckUtils]: 46: Hoare triple {38454#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38454#(<= main_~i~0 20)} is VALID [2022-04-15 12:17:57,261 INFO L290 TraceCheckUtils]: 47: Hoare triple {38454#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38455#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:57,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {38455#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38455#(<= main_~i~0 21)} is VALID [2022-04-15 12:17:57,261 INFO L290 TraceCheckUtils]: 49: Hoare triple {38455#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38456#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:57,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {38456#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38456#(<= main_~i~0 22)} is VALID [2022-04-15 12:17:57,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {38456#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38457#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:57,262 INFO L290 TraceCheckUtils]: 52: Hoare triple {38457#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38457#(<= main_~i~0 23)} is VALID [2022-04-15 12:17:57,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {38457#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38458#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:57,263 INFO L290 TraceCheckUtils]: 54: Hoare triple {38458#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38458#(<= main_~i~0 24)} is VALID [2022-04-15 12:17:57,263 INFO L290 TraceCheckUtils]: 55: Hoare triple {38458#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38459#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:57,263 INFO L290 TraceCheckUtils]: 56: Hoare triple {38459#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38459#(<= main_~i~0 25)} is VALID [2022-04-15 12:17:57,264 INFO L290 TraceCheckUtils]: 57: Hoare triple {38459#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38460#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:57,264 INFO L290 TraceCheckUtils]: 58: Hoare triple {38460#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38460#(<= main_~i~0 26)} is VALID [2022-04-15 12:17:57,264 INFO L290 TraceCheckUtils]: 59: Hoare triple {38460#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38461#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:57,265 INFO L290 TraceCheckUtils]: 60: Hoare triple {38461#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38461#(<= main_~i~0 27)} is VALID [2022-04-15 12:17:57,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {38461#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38462#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:57,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {38462#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38462#(<= main_~i~0 28)} is VALID [2022-04-15 12:17:57,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {38462#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38463#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:57,266 INFO L290 TraceCheckUtils]: 64: Hoare triple {38463#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38463#(<= main_~i~0 29)} is VALID [2022-04-15 12:17:57,266 INFO L290 TraceCheckUtils]: 65: Hoare triple {38463#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38464#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:57,266 INFO L290 TraceCheckUtils]: 66: Hoare triple {38464#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38464#(<= main_~i~0 30)} is VALID [2022-04-15 12:17:57,267 INFO L290 TraceCheckUtils]: 67: Hoare triple {38464#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38465#(<= main_~i~0 31)} is VALID [2022-04-15 12:17:57,267 INFO L290 TraceCheckUtils]: 68: Hoare triple {38465#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38465#(<= main_~i~0 31)} is VALID [2022-04-15 12:17:57,267 INFO L290 TraceCheckUtils]: 69: Hoare triple {38465#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38466#(<= main_~i~0 32)} is VALID [2022-04-15 12:17:57,267 INFO L290 TraceCheckUtils]: 70: Hoare triple {38466#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38466#(<= main_~i~0 32)} is VALID [2022-04-15 12:17:57,268 INFO L290 TraceCheckUtils]: 71: Hoare triple {38466#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38467#(<= main_~i~0 33)} is VALID [2022-04-15 12:17:57,268 INFO L290 TraceCheckUtils]: 72: Hoare triple {38467#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38467#(<= main_~i~0 33)} is VALID [2022-04-15 12:17:57,268 INFO L290 TraceCheckUtils]: 73: Hoare triple {38467#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38468#(<= main_~i~0 34)} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 74: Hoare triple {38468#(<= main_~i~0 34)} assume !(~i~0 < 1024); {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 75: Hoare triple {38430#false} ~i~0 := 0; {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 76: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 77: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 78: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 79: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 80: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 81: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 82: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 83: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 84: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 85: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 86: Hoare triple {38430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L272 TraceCheckUtils]: 87: Hoare triple {38430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 88: Hoare triple {38430#false} ~cond := #in~cond; {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 89: Hoare triple {38430#false} assume 0 == ~cond; {38430#false} is VALID [2022-04-15 12:17:57,269 INFO L290 TraceCheckUtils]: 90: Hoare triple {38430#false} assume !false; {38430#false} is VALID [2022-04-15 12:17:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:57,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:58,741 INFO L290 TraceCheckUtils]: 90: Hoare triple {38430#false} assume !false; {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L290 TraceCheckUtils]: 89: Hoare triple {38430#false} assume 0 == ~cond; {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L290 TraceCheckUtils]: 88: Hoare triple {38430#false} ~cond := #in~cond; {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L272 TraceCheckUtils]: 87: Hoare triple {38430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L290 TraceCheckUtils]: 86: Hoare triple {38430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L290 TraceCheckUtils]: 85: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L290 TraceCheckUtils]: 84: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L290 TraceCheckUtils]: 83: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L290 TraceCheckUtils]: 82: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L290 TraceCheckUtils]: 81: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L290 TraceCheckUtils]: 80: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L290 TraceCheckUtils]: 79: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L290 TraceCheckUtils]: 78: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L290 TraceCheckUtils]: 77: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L290 TraceCheckUtils]: 76: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 12:17:58,742 INFO L290 TraceCheckUtils]: 75: Hoare triple {38430#false} ~i~0 := 0; {38430#false} is VALID [2022-04-15 12:17:58,743 INFO L290 TraceCheckUtils]: 74: Hoare triple {38792#(< main_~i~0 1024)} assume !(~i~0 < 1024); {38430#false} is VALID [2022-04-15 12:17:58,743 INFO L290 TraceCheckUtils]: 73: Hoare triple {38796#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38792#(< main_~i~0 1024)} is VALID [2022-04-15 12:17:58,743 INFO L290 TraceCheckUtils]: 72: Hoare triple {38796#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38796#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:58,744 INFO L290 TraceCheckUtils]: 71: Hoare triple {38803#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38796#(< main_~i~0 1023)} is VALID [2022-04-15 12:17:58,744 INFO L290 TraceCheckUtils]: 70: Hoare triple {38803#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38803#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:58,744 INFO L290 TraceCheckUtils]: 69: Hoare triple {38810#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38803#(< main_~i~0 1022)} is VALID [2022-04-15 12:17:58,744 INFO L290 TraceCheckUtils]: 68: Hoare triple {38810#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38810#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:58,745 INFO L290 TraceCheckUtils]: 67: Hoare triple {38817#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38810#(< main_~i~0 1021)} is VALID [2022-04-15 12:17:58,745 INFO L290 TraceCheckUtils]: 66: Hoare triple {38817#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38817#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:58,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {38824#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38817#(< main_~i~0 1020)} is VALID [2022-04-15 12:17:58,746 INFO L290 TraceCheckUtils]: 64: Hoare triple {38824#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38824#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:58,746 INFO L290 TraceCheckUtils]: 63: Hoare triple {38831#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38824#(< main_~i~0 1019)} is VALID [2022-04-15 12:17:58,746 INFO L290 TraceCheckUtils]: 62: Hoare triple {38831#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38831#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:58,746 INFO L290 TraceCheckUtils]: 61: Hoare triple {38838#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38831#(< main_~i~0 1018)} is VALID [2022-04-15 12:17:58,747 INFO L290 TraceCheckUtils]: 60: Hoare triple {38838#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38838#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:58,747 INFO L290 TraceCheckUtils]: 59: Hoare triple {38845#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38838#(< main_~i~0 1017)} is VALID [2022-04-15 12:17:58,747 INFO L290 TraceCheckUtils]: 58: Hoare triple {38845#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38845#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:58,748 INFO L290 TraceCheckUtils]: 57: Hoare triple {38852#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38845#(< main_~i~0 1016)} is VALID [2022-04-15 12:17:58,748 INFO L290 TraceCheckUtils]: 56: Hoare triple {38852#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38852#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:58,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {38859#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38852#(< main_~i~0 1015)} is VALID [2022-04-15 12:17:58,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {38859#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38859#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:58,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {38866#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38859#(< main_~i~0 1014)} is VALID [2022-04-15 12:17:58,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {38866#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38866#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:58,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {38873#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38866#(< main_~i~0 1013)} is VALID [2022-04-15 12:17:58,750 INFO L290 TraceCheckUtils]: 50: Hoare triple {38873#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38873#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:58,750 INFO L290 TraceCheckUtils]: 49: Hoare triple {38880#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38873#(< main_~i~0 1012)} is VALID [2022-04-15 12:17:58,750 INFO L290 TraceCheckUtils]: 48: Hoare triple {38880#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38880#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:58,751 INFO L290 TraceCheckUtils]: 47: Hoare triple {38887#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38880#(< main_~i~0 1011)} is VALID [2022-04-15 12:17:58,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {38887#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38887#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:58,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {38894#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38887#(< main_~i~0 1010)} is VALID [2022-04-15 12:17:58,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {38894#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38894#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:58,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {38901#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38894#(< main_~i~0 1009)} is VALID [2022-04-15 12:17:58,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {38901#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38901#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:58,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {38908#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38901#(< main_~i~0 1008)} is VALID [2022-04-15 12:17:58,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {38908#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38908#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:58,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {38915#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38908#(< main_~i~0 1007)} is VALID [2022-04-15 12:17:58,753 INFO L290 TraceCheckUtils]: 38: Hoare triple {38915#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38915#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:58,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {38922#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38915#(< main_~i~0 1006)} is VALID [2022-04-15 12:17:58,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {38922#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38922#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:58,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {38929#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38922#(< main_~i~0 1005)} is VALID [2022-04-15 12:17:58,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {38929#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38929#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:58,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {38936#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38929#(< main_~i~0 1004)} is VALID [2022-04-15 12:17:58,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {38936#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38936#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:58,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {38943#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38936#(< main_~i~0 1003)} is VALID [2022-04-15 12:17:58,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {38943#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38943#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:58,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {38950#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38943#(< main_~i~0 1002)} is VALID [2022-04-15 12:17:58,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {38950#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38950#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:58,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {38957#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38950#(< main_~i~0 1001)} is VALID [2022-04-15 12:17:58,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {38957#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38957#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:58,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {38964#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38957#(< main_~i~0 1000)} is VALID [2022-04-15 12:17:58,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {38964#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38964#(< main_~i~0 999)} is VALID [2022-04-15 12:17:58,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {38971#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38964#(< main_~i~0 999)} is VALID [2022-04-15 12:17:58,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {38971#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38971#(< main_~i~0 998)} is VALID [2022-04-15 12:17:58,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {38978#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38971#(< main_~i~0 998)} is VALID [2022-04-15 12:17:58,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {38978#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38978#(< main_~i~0 997)} is VALID [2022-04-15 12:17:58,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {38985#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38978#(< main_~i~0 997)} is VALID [2022-04-15 12:17:58,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {38985#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38985#(< main_~i~0 996)} is VALID [2022-04-15 12:17:58,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {38992#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38985#(< main_~i~0 996)} is VALID [2022-04-15 12:17:58,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {38992#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38992#(< main_~i~0 995)} is VALID [2022-04-15 12:17:58,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {38999#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38992#(< main_~i~0 995)} is VALID [2022-04-15 12:17:58,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {38999#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38999#(< main_~i~0 994)} is VALID [2022-04-15 12:17:58,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {39006#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38999#(< main_~i~0 994)} is VALID [2022-04-15 12:17:58,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {39006#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39006#(< main_~i~0 993)} is VALID [2022-04-15 12:17:58,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {39013#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39006#(< main_~i~0 993)} is VALID [2022-04-15 12:17:58,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {39013#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39013#(< main_~i~0 992)} is VALID [2022-04-15 12:17:58,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {39020#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39013#(< main_~i~0 992)} is VALID [2022-04-15 12:17:58,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {39020#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39020#(< main_~i~0 991)} is VALID [2022-04-15 12:17:58,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {39027#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39020#(< main_~i~0 991)} is VALID [2022-04-15 12:17:58,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {39027#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39027#(< main_~i~0 990)} is VALID [2022-04-15 12:17:58,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {38429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {39027#(< main_~i~0 990)} is VALID [2022-04-15 12:17:58,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {38429#true} call #t~ret6 := main(); {38429#true} is VALID [2022-04-15 12:17:58,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38429#true} {38429#true} #64#return; {38429#true} is VALID [2022-04-15 12:17:58,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {38429#true} assume true; {38429#true} is VALID [2022-04-15 12:17:58,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {38429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {38429#true} is VALID [2022-04-15 12:17:58,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {38429#true} call ULTIMATE.init(); {38429#true} is VALID [2022-04-15 12:17:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:17:58,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098946752] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:58,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:58,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-15 12:17:58,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:58,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [441252936] [2022-04-15 12:17:58,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [441252936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:58,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:58,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 12:17:58,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673252998] [2022-04-15 12:17:58,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:58,764 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-15 12:17:58,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:58,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:58,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:58,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 12:17:58,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:58,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 12:17:58,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 12:17:58,828 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:03,291 INFO L93 Difference]: Finished difference Result 278 states and 352 transitions. [2022-04-15 12:18:03,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 12:18:03,292 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-15 12:18:03,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 343 transitions. [2022-04-15 12:18:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 343 transitions. [2022-04-15 12:18:03,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 343 transitions. [2022-04-15 12:18:03,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:03,515 INFO L225 Difference]: With dead ends: 278 [2022-04-15 12:18:03,515 INFO L226 Difference]: Without dead ends: 261 [2022-04-15 12:18:03,516 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5186, Invalid=6586, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 12:18:03,516 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 810 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:03,517 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [810 Valid, 32 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-15 12:18:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 94. [2022-04-15 12:18:03,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:03,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:03,861 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:03,861 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:03,864 INFO L93 Difference]: Finished difference Result 261 states and 331 transitions. [2022-04-15 12:18:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 331 transitions. [2022-04-15 12:18:03,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:03,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:03,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-15 12:18:03,865 INFO L87 Difference]: Start difference. First operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-15 12:18:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:03,868 INFO L93 Difference]: Finished difference Result 261 states and 331 transitions. [2022-04-15 12:18:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 331 transitions. [2022-04-15 12:18:03,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:03,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:03,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:03,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-04-15 12:18:03,869 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 91 [2022-04-15 12:18:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:03,869 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-04-15 12:18:03,870 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:03,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 98 transitions. [2022-04-15 12:18:04,040 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:18:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-04-15 12:18:04,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-15 12:18:04,041 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:04,041 INFO L499 BasicCegarLoop]: trace histogram [35, 35, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:04,060 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:04,246 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:04,246 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:04,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:04,246 INFO L85 PathProgramCache]: Analyzing trace with hash 518547671, now seen corresponding path program 71 times [2022-04-15 12:18:04,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:04,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1308416301] [2022-04-15 12:18:04,251 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:18:04,251 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:18:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash 518547671, now seen corresponding path program 72 times [2022-04-15 12:18:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:04,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339984632] [2022-04-15 12:18:04,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:04,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:04,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {40428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {40387#true} is VALID [2022-04-15 12:18:04,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {40387#true} assume true; {40387#true} is VALID [2022-04-15 12:18:04,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40387#true} {40387#true} #64#return; {40387#true} is VALID [2022-04-15 12:18:04,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {40387#true} call ULTIMATE.init(); {40428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:04,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {40428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {40387#true} is VALID [2022-04-15 12:18:04,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {40387#true} assume true; {40387#true} is VALID [2022-04-15 12:18:04,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40387#true} {40387#true} #64#return; {40387#true} is VALID [2022-04-15 12:18:04,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {40387#true} call #t~ret6 := main(); {40387#true} is VALID [2022-04-15 12:18:04,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {40387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40392#(= main_~i~0 0)} is VALID [2022-04-15 12:18:04,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {40392#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40392#(= main_~i~0 0)} is VALID [2022-04-15 12:18:04,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {40392#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40393#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:04,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {40393#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40393#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:04,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {40393#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40394#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:04,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {40394#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40394#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:04,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {40394#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40395#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:04,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {40395#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40395#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:04,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {40395#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40396#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:04,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {40396#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40396#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:04,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {40396#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40397#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:04,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {40397#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40397#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:04,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {40397#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40398#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:04,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {40398#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40398#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:04,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {40398#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40399#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:04,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {40399#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40399#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:04,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {40399#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40400#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:04,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {40400#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40400#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:04,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {40400#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40401#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:04,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {40401#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40401#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:04,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {40401#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40402#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:04,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {40402#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40402#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:04,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {40402#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40403#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:04,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {40403#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40403#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:04,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {40403#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40404#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:04,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {40404#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40404#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:04,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {40404#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40405#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:04,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {40405#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40405#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:04,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {40405#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40406#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:04,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {40406#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40406#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:04,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {40406#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40407#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:04,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {40407#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40407#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:04,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {40407#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40408#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:04,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {40408#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40408#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:04,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {40408#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40409#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {40409#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40409#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {40409#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40410#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {40410#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40410#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:04,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {40410#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40411#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:04,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {40411#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40411#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:04,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {40411#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40412#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:04,786 INFO L290 TraceCheckUtils]: 46: Hoare triple {40412#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40412#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:04,787 INFO L290 TraceCheckUtils]: 47: Hoare triple {40412#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40413#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:04,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {40413#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40413#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:04,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {40413#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40414#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:04,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {40414#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40414#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:04,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {40414#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40415#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:04,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {40415#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40415#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:04,789 INFO L290 TraceCheckUtils]: 53: Hoare triple {40415#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40416#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:04,789 INFO L290 TraceCheckUtils]: 54: Hoare triple {40416#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40416#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:04,789 INFO L290 TraceCheckUtils]: 55: Hoare triple {40416#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40417#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:04,789 INFO L290 TraceCheckUtils]: 56: Hoare triple {40417#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40417#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:04,790 INFO L290 TraceCheckUtils]: 57: Hoare triple {40417#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40418#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:04,790 INFO L290 TraceCheckUtils]: 58: Hoare triple {40418#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40418#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:04,790 INFO L290 TraceCheckUtils]: 59: Hoare triple {40418#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40419#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:04,791 INFO L290 TraceCheckUtils]: 60: Hoare triple {40419#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40419#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:04,791 INFO L290 TraceCheckUtils]: 61: Hoare triple {40419#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40420#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:04,791 INFO L290 TraceCheckUtils]: 62: Hoare triple {40420#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40420#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:04,792 INFO L290 TraceCheckUtils]: 63: Hoare triple {40420#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40421#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:04,792 INFO L290 TraceCheckUtils]: 64: Hoare triple {40421#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40421#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:04,792 INFO L290 TraceCheckUtils]: 65: Hoare triple {40421#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40422#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:04,792 INFO L290 TraceCheckUtils]: 66: Hoare triple {40422#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40422#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:04,793 INFO L290 TraceCheckUtils]: 67: Hoare triple {40422#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40423#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:04,793 INFO L290 TraceCheckUtils]: 68: Hoare triple {40423#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40423#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:04,793 INFO L290 TraceCheckUtils]: 69: Hoare triple {40423#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40424#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:04,794 INFO L290 TraceCheckUtils]: 70: Hoare triple {40424#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40424#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:04,794 INFO L290 TraceCheckUtils]: 71: Hoare triple {40424#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40425#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:04,794 INFO L290 TraceCheckUtils]: 72: Hoare triple {40425#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40425#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:04,795 INFO L290 TraceCheckUtils]: 73: Hoare triple {40425#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40426#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:04,795 INFO L290 TraceCheckUtils]: 74: Hoare triple {40426#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40426#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:04,795 INFO L290 TraceCheckUtils]: 75: Hoare triple {40426#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40427#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 76: Hoare triple {40427#(<= main_~i~0 35)} assume !(~i~0 < 1024); {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 77: Hoare triple {40388#false} ~i~0 := 0; {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 78: Hoare triple {40388#false} #t~short5 := ~i~0 < 1024; {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 79: Hoare triple {40388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {40388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 81: Hoare triple {40388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 82: Hoare triple {40388#false} #t~short5 := ~i~0 < 1024; {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 83: Hoare triple {40388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 84: Hoare triple {40388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 85: Hoare triple {40388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 86: Hoare triple {40388#false} #t~short5 := ~i~0 < 1024; {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 87: Hoare triple {40388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 88: Hoare triple {40388#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L272 TraceCheckUtils]: 89: Hoare triple {40388#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 90: Hoare triple {40388#false} ~cond := #in~cond; {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 91: Hoare triple {40388#false} assume 0 == ~cond; {40388#false} is VALID [2022-04-15 12:18:04,796 INFO L290 TraceCheckUtils]: 92: Hoare triple {40388#false} assume !false; {40388#false} is VALID [2022-04-15 12:18:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:04,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:04,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339984632] [2022-04-15 12:18:04,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339984632] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:04,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157192449] [2022-04-15 12:18:04,797 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:04,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:04,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:04,798 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:04,827 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:04,971 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:18:04,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:04,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:18:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:04,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:05,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {40387#true} call ULTIMATE.init(); {40387#true} is VALID [2022-04-15 12:18:05,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {40387#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {40387#true} is VALID [2022-04-15 12:18:05,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {40387#true} assume true; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40387#true} {40387#true} #64#return; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {40387#true} call #t~ret6 := main(); {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {40387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 42: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 50: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 51: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 52: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 53: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 54: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 55: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 57: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 58: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 59: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,198 INFO L290 TraceCheckUtils]: 60: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 61: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 62: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 63: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 64: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 65: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 66: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 67: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 68: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 69: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 70: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 71: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 72: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 73: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 74: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 75: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,199 INFO L290 TraceCheckUtils]: 76: Hoare triple {40387#true} assume !(~i~0 < 1024); {40387#true} is VALID [2022-04-15 12:18:05,200 INFO L290 TraceCheckUtils]: 77: Hoare triple {40387#true} ~i~0 := 0; {40663#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:05,200 INFO L290 TraceCheckUtils]: 78: Hoare triple {40663#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {40663#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:05,200 INFO L290 TraceCheckUtils]: 79: Hoare triple {40663#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40663#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:05,200 INFO L290 TraceCheckUtils]: 80: Hoare triple {40663#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40663#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:05,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {40663#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40393#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:05,201 INFO L290 TraceCheckUtils]: 82: Hoare triple {40393#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {40393#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:05,201 INFO L290 TraceCheckUtils]: 83: Hoare triple {40393#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40393#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:05,201 INFO L290 TraceCheckUtils]: 84: Hoare triple {40393#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40393#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:05,202 INFO L290 TraceCheckUtils]: 85: Hoare triple {40393#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40394#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:05,202 INFO L290 TraceCheckUtils]: 86: Hoare triple {40394#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {40394#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:05,202 INFO L290 TraceCheckUtils]: 87: Hoare triple {40394#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40394#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:05,202 INFO L290 TraceCheckUtils]: 88: Hoare triple {40394#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {40394#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:05,203 INFO L272 TraceCheckUtils]: 89: Hoare triple {40394#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {40700#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:05,203 INFO L290 TraceCheckUtils]: 90: Hoare triple {40700#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40704#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:05,203 INFO L290 TraceCheckUtils]: 91: Hoare triple {40704#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40388#false} is VALID [2022-04-15 12:18:05,204 INFO L290 TraceCheckUtils]: 92: Hoare triple {40388#false} assume !false; {40388#false} is VALID [2022-04-15 12:18:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2022-04-15 12:18:05,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:05,446 INFO L290 TraceCheckUtils]: 92: Hoare triple {40388#false} assume !false; {40388#false} is VALID [2022-04-15 12:18:05,446 INFO L290 TraceCheckUtils]: 91: Hoare triple {40704#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40388#false} is VALID [2022-04-15 12:18:05,446 INFO L290 TraceCheckUtils]: 90: Hoare triple {40700#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40704#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:05,447 INFO L272 TraceCheckUtils]: 89: Hoare triple {40720#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {40700#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:05,447 INFO L290 TraceCheckUtils]: 88: Hoare triple {40720#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {40720#(<= main_~i~0 512)} is VALID [2022-04-15 12:18:05,447 INFO L290 TraceCheckUtils]: 87: Hoare triple {40720#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40720#(<= main_~i~0 512)} is VALID [2022-04-15 12:18:05,448 INFO L290 TraceCheckUtils]: 86: Hoare triple {40720#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {40720#(<= main_~i~0 512)} is VALID [2022-04-15 12:18:05,448 INFO L290 TraceCheckUtils]: 85: Hoare triple {40733#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40720#(<= main_~i~0 512)} is VALID [2022-04-15 12:18:05,448 INFO L290 TraceCheckUtils]: 84: Hoare triple {40733#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40733#(<= main_~i~0 511)} is VALID [2022-04-15 12:18:05,449 INFO L290 TraceCheckUtils]: 83: Hoare triple {40733#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40733#(<= main_~i~0 511)} is VALID [2022-04-15 12:18:05,449 INFO L290 TraceCheckUtils]: 82: Hoare triple {40733#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {40733#(<= main_~i~0 511)} is VALID [2022-04-15 12:18:05,449 INFO L290 TraceCheckUtils]: 81: Hoare triple {40746#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40733#(<= main_~i~0 511)} is VALID [2022-04-15 12:18:05,449 INFO L290 TraceCheckUtils]: 80: Hoare triple {40746#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40746#(<= main_~i~0 510)} is VALID [2022-04-15 12:18:05,450 INFO L290 TraceCheckUtils]: 79: Hoare triple {40746#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40746#(<= main_~i~0 510)} is VALID [2022-04-15 12:18:05,450 INFO L290 TraceCheckUtils]: 78: Hoare triple {40746#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {40746#(<= main_~i~0 510)} is VALID [2022-04-15 12:18:05,450 INFO L290 TraceCheckUtils]: 77: Hoare triple {40387#true} ~i~0 := 0; {40746#(<= main_~i~0 510)} is VALID [2022-04-15 12:18:05,450 INFO L290 TraceCheckUtils]: 76: Hoare triple {40387#true} assume !(~i~0 < 1024); {40387#true} is VALID [2022-04-15 12:18:05,450 INFO L290 TraceCheckUtils]: 75: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,450 INFO L290 TraceCheckUtils]: 74: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,450 INFO L290 TraceCheckUtils]: 73: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,450 INFO L290 TraceCheckUtils]: 72: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,450 INFO L290 TraceCheckUtils]: 71: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 70: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 69: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 68: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 67: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 66: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 65: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 64: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 63: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 62: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 60: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 59: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 58: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 56: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 55: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 54: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 53: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,451 INFO L290 TraceCheckUtils]: 51: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 50: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 49: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 45: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 43: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 42: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 41: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 40: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 12:18:05,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 12:18:05,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {40387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40387#true} is VALID [2022-04-15 12:18:05,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {40387#true} call #t~ret6 := main(); {40387#true} is VALID [2022-04-15 12:18:05,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40387#true} {40387#true} #64#return; {40387#true} is VALID [2022-04-15 12:18:05,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {40387#true} assume true; {40387#true} is VALID [2022-04-15 12:18:05,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {40387#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {40387#true} is VALID [2022-04-15 12:18:05,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {40387#true} call ULTIMATE.init(); {40387#true} is VALID [2022-04-15 12:18:05,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2022-04-15 12:18:05,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157192449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:05,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:05,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 7, 7] total 45 [2022-04-15 12:18:05,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:05,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1308416301] [2022-04-15 12:18:05,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1308416301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:05,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:05,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 12:18:05,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383586790] [2022-04-15 12:18:05,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:05,455 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2022-04-15 12:18:05,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:05,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:05,505 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:18:05,505 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 12:18:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:05,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 12:18:05,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=867, Invalid=1113, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:18:05,506 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:10,187 INFO L93 Difference]: Finished difference Result 285 states and 361 transitions. [2022-04-15 12:18:10,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 12:18:10,187 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2022-04-15 12:18:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:10,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 352 transitions. [2022-04-15 12:18:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 352 transitions. [2022-04-15 12:18:10,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 352 transitions. [2022-04-15 12:18:10,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:10,417 INFO L225 Difference]: With dead ends: 285 [2022-04-15 12:18:10,417 INFO L226 Difference]: Without dead ends: 268 [2022-04-15 12:18:10,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2380, Invalid=4100, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 12:18:10,419 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 819 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:10,419 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [819 Valid, 42 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-15 12:18:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 96. [2022-04-15 12:18:10,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:10,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 268 states. Second operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:10,786 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:10,786 INFO L87 Difference]: Start difference. First operand 268 states. Second operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:10,789 INFO L93 Difference]: Finished difference Result 268 states and 340 transitions. [2022-04-15 12:18:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 340 transitions. [2022-04-15 12:18:10,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:10,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:10,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 268 states. [2022-04-15 12:18:10,790 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 268 states. [2022-04-15 12:18:10,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:10,793 INFO L93 Difference]: Finished difference Result 268 states and 340 transitions. [2022-04-15 12:18:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 340 transitions. [2022-04-15 12:18:10,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:10,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:10,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:10,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2022-04-15 12:18:10,794 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 93 [2022-04-15 12:18:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:10,794 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2022-04-15 12:18:10,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:10,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 100 transitions. [2022-04-15 12:18:10,959 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:18:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-15 12:18:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 12:18:10,959 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:10,959 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:10,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:11,160 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:11,160 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:11,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash -506845579, now seen corresponding path program 73 times [2022-04-15 12:18:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:11,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [935238726] [2022-04-15 12:18:11,164 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:18:11,164 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:18:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash -506845579, now seen corresponding path program 74 times [2022-04-15 12:18:11,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:11,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108805004] [2022-04-15 12:18:11,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:11,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:11,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:11,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {42404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {42362#true} is VALID [2022-04-15 12:18:11,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {42362#true} assume true; {42362#true} is VALID [2022-04-15 12:18:11,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42362#true} {42362#true} #64#return; {42362#true} is VALID [2022-04-15 12:18:11,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {42362#true} call ULTIMATE.init(); {42404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:11,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {42404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {42362#true} is VALID [2022-04-15 12:18:11,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {42362#true} assume true; {42362#true} is VALID [2022-04-15 12:18:11,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42362#true} {42362#true} #64#return; {42362#true} is VALID [2022-04-15 12:18:11,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {42362#true} call #t~ret6 := main(); {42362#true} is VALID [2022-04-15 12:18:11,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {42362#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42367#(= main_~i~0 0)} is VALID [2022-04-15 12:18:11,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {42367#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42367#(= main_~i~0 0)} is VALID [2022-04-15 12:18:11,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {42367#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42368#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:11,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {42368#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42368#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:11,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {42368#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42369#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:11,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {42369#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42369#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:11,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {42369#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42370#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:11,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {42370#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42370#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:11,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {42370#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42371#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:11,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {42371#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42371#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:11,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {42371#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42372#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:11,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {42372#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42372#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:11,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {42372#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42373#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:11,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {42373#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42373#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:11,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {42373#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42374#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:11,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {42374#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42374#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:11,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {42374#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42375#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:11,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {42375#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42375#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:11,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {42375#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42376#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:11,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {42376#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42376#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:11,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {42376#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42377#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:11,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {42377#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42377#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:11,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {42377#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42378#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:11,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {42378#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42378#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:11,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {42378#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42379#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:11,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {42379#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42379#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:11,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {42379#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42380#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:11,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {42380#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42380#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:11,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {42380#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42381#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:11,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {42381#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42381#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:11,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {42381#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42382#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:11,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {42382#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42382#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:11,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {42382#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42383#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:11,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {42383#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42383#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:11,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {42383#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42384#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:11,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {42384#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42384#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:11,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {42384#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42385#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:11,745 INFO L290 TraceCheckUtils]: 42: Hoare triple {42385#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42385#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:11,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {42385#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42386#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:11,745 INFO L290 TraceCheckUtils]: 44: Hoare triple {42386#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42386#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:11,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {42386#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42387#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:11,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {42387#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42387#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:11,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {42387#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42388#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:11,746 INFO L290 TraceCheckUtils]: 48: Hoare triple {42388#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42388#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:11,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {42388#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42389#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:11,747 INFO L290 TraceCheckUtils]: 50: Hoare triple {42389#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42389#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:11,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {42389#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42390#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:11,747 INFO L290 TraceCheckUtils]: 52: Hoare triple {42390#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42390#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:11,748 INFO L290 TraceCheckUtils]: 53: Hoare triple {42390#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42391#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:11,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {42391#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42391#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:11,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {42391#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42392#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:11,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {42392#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42392#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:11,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {42392#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42393#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:11,749 INFO L290 TraceCheckUtils]: 58: Hoare triple {42393#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42393#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:11,750 INFO L290 TraceCheckUtils]: 59: Hoare triple {42393#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42394#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:11,750 INFO L290 TraceCheckUtils]: 60: Hoare triple {42394#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42394#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:11,750 INFO L290 TraceCheckUtils]: 61: Hoare triple {42394#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42395#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:11,750 INFO L290 TraceCheckUtils]: 62: Hoare triple {42395#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42395#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:11,751 INFO L290 TraceCheckUtils]: 63: Hoare triple {42395#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42396#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:11,751 INFO L290 TraceCheckUtils]: 64: Hoare triple {42396#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42396#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:11,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {42396#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42397#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:11,751 INFO L290 TraceCheckUtils]: 66: Hoare triple {42397#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42397#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:11,752 INFO L290 TraceCheckUtils]: 67: Hoare triple {42397#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42398#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:11,752 INFO L290 TraceCheckUtils]: 68: Hoare triple {42398#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42398#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:11,752 INFO L290 TraceCheckUtils]: 69: Hoare triple {42398#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42399#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:11,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {42399#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42399#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:11,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {42399#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42400#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:11,753 INFO L290 TraceCheckUtils]: 72: Hoare triple {42400#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42400#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:11,753 INFO L290 TraceCheckUtils]: 73: Hoare triple {42400#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42401#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:11,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {42401#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42401#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:11,754 INFO L290 TraceCheckUtils]: 75: Hoare triple {42401#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42402#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:11,754 INFO L290 TraceCheckUtils]: 76: Hoare triple {42402#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42402#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:11,755 INFO L290 TraceCheckUtils]: 77: Hoare triple {42402#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42403#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:11,755 INFO L290 TraceCheckUtils]: 78: Hoare triple {42403#(<= main_~i~0 36)} assume !(~i~0 < 1024); {42363#false} is VALID [2022-04-15 12:18:11,755 INFO L290 TraceCheckUtils]: 79: Hoare triple {42363#false} ~i~0 := 0; {42363#false} is VALID [2022-04-15 12:18:11,755 INFO L290 TraceCheckUtils]: 80: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 12:18:11,755 INFO L290 TraceCheckUtils]: 81: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 12:18:11,755 INFO L290 TraceCheckUtils]: 82: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 12:18:11,755 INFO L290 TraceCheckUtils]: 83: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-15 12:18:11,755 INFO L290 TraceCheckUtils]: 84: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 12:18:11,755 INFO L290 TraceCheckUtils]: 85: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 12:18:11,755 INFO L290 TraceCheckUtils]: 86: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 12:18:11,755 INFO L290 TraceCheckUtils]: 87: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-15 12:18:11,755 INFO L290 TraceCheckUtils]: 88: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 12:18:11,755 INFO L290 TraceCheckUtils]: 89: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 12:18:11,755 INFO L290 TraceCheckUtils]: 90: Hoare triple {42363#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 12:18:11,755 INFO L272 TraceCheckUtils]: 91: Hoare triple {42363#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {42363#false} is VALID [2022-04-15 12:18:11,756 INFO L290 TraceCheckUtils]: 92: Hoare triple {42363#false} ~cond := #in~cond; {42363#false} is VALID [2022-04-15 12:18:11,756 INFO L290 TraceCheckUtils]: 93: Hoare triple {42363#false} assume 0 == ~cond; {42363#false} is VALID [2022-04-15 12:18:11,756 INFO L290 TraceCheckUtils]: 94: Hoare triple {42363#false} assume !false; {42363#false} is VALID [2022-04-15 12:18:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:11,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:11,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108805004] [2022-04-15 12:18:11,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108805004] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:11,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365434375] [2022-04-15 12:18:11,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:11,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:11,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:11,757 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:11,758 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:11,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:11,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:11,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 12:18:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:11,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:12,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {42362#true} call ULTIMATE.init(); {42362#true} is VALID [2022-04-15 12:18:12,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {42362#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {42362#true} is VALID [2022-04-15 12:18:12,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {42362#true} assume true; {42362#true} is VALID [2022-04-15 12:18:12,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42362#true} {42362#true} #64#return; {42362#true} is VALID [2022-04-15 12:18:12,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {42362#true} call #t~ret6 := main(); {42362#true} is VALID [2022-04-15 12:18:12,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {42362#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42423#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:12,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {42423#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42423#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:12,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {42423#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42368#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:12,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {42368#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42368#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:12,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {42368#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42369#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:12,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {42369#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42369#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:12,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {42369#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42370#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:12,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {42370#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42370#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:12,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {42370#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42371#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:12,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {42371#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42371#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:12,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {42371#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42372#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:12,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {42372#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42372#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:12,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {42372#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42373#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:12,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {42373#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42373#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:12,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {42373#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42374#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:12,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {42374#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42374#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:12,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {42374#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42375#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:12,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {42375#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42375#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:12,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {42375#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42376#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:12,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {42376#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42376#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:12,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {42376#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42377#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:12,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {42377#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42377#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:12,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {42377#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42378#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:12,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {42378#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42378#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:12,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {42378#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42379#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:12,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {42379#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42379#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:12,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {42379#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42380#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:12,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {42380#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42380#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:12,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {42380#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42381#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:12,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {42381#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42381#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:12,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {42381#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42382#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:12,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {42382#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42382#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:12,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {42382#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42383#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:12,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {42383#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42383#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:12,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {42383#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42384#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:12,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {42384#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42384#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:12,440 INFO L290 TraceCheckUtils]: 41: Hoare triple {42384#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42385#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:12,440 INFO L290 TraceCheckUtils]: 42: Hoare triple {42385#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42385#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:12,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {42385#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42386#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:12,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {42386#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42386#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:12,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {42386#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42387#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:12,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {42387#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42387#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:12,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {42387#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42388#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:12,442 INFO L290 TraceCheckUtils]: 48: Hoare triple {42388#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42388#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:12,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {42388#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42389#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:12,443 INFO L290 TraceCheckUtils]: 50: Hoare triple {42389#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42389#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:12,443 INFO L290 TraceCheckUtils]: 51: Hoare triple {42389#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42390#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:12,444 INFO L290 TraceCheckUtils]: 52: Hoare triple {42390#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42390#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:12,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {42390#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42391#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:12,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {42391#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42391#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:12,445 INFO L290 TraceCheckUtils]: 55: Hoare triple {42391#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42392#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:12,445 INFO L290 TraceCheckUtils]: 56: Hoare triple {42392#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42392#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:12,445 INFO L290 TraceCheckUtils]: 57: Hoare triple {42392#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42393#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:12,445 INFO L290 TraceCheckUtils]: 58: Hoare triple {42393#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42393#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:12,446 INFO L290 TraceCheckUtils]: 59: Hoare triple {42393#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42394#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:12,446 INFO L290 TraceCheckUtils]: 60: Hoare triple {42394#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42394#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:12,446 INFO L290 TraceCheckUtils]: 61: Hoare triple {42394#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42395#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:12,447 INFO L290 TraceCheckUtils]: 62: Hoare triple {42395#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42395#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:12,447 INFO L290 TraceCheckUtils]: 63: Hoare triple {42395#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42396#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:12,447 INFO L290 TraceCheckUtils]: 64: Hoare triple {42396#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42396#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:12,448 INFO L290 TraceCheckUtils]: 65: Hoare triple {42396#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42397#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:12,448 INFO L290 TraceCheckUtils]: 66: Hoare triple {42397#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42397#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:12,448 INFO L290 TraceCheckUtils]: 67: Hoare triple {42397#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42398#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:12,449 INFO L290 TraceCheckUtils]: 68: Hoare triple {42398#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42398#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:12,449 INFO L290 TraceCheckUtils]: 69: Hoare triple {42398#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42399#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:12,449 INFO L290 TraceCheckUtils]: 70: Hoare triple {42399#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42399#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:12,450 INFO L290 TraceCheckUtils]: 71: Hoare triple {42399#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42400#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:12,450 INFO L290 TraceCheckUtils]: 72: Hoare triple {42400#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42400#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:12,450 INFO L290 TraceCheckUtils]: 73: Hoare triple {42400#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42401#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:12,450 INFO L290 TraceCheckUtils]: 74: Hoare triple {42401#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42401#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:12,451 INFO L290 TraceCheckUtils]: 75: Hoare triple {42401#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42402#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:12,451 INFO L290 TraceCheckUtils]: 76: Hoare triple {42402#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42402#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:12,451 INFO L290 TraceCheckUtils]: 77: Hoare triple {42402#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42403#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:12,452 INFO L290 TraceCheckUtils]: 78: Hoare triple {42403#(<= main_~i~0 36)} assume !(~i~0 < 1024); {42363#false} is VALID [2022-04-15 12:18:12,452 INFO L290 TraceCheckUtils]: 79: Hoare triple {42363#false} ~i~0 := 0; {42363#false} is VALID [2022-04-15 12:18:12,452 INFO L290 TraceCheckUtils]: 80: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 12:18:12,452 INFO L290 TraceCheckUtils]: 81: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 12:18:12,452 INFO L290 TraceCheckUtils]: 82: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 12:18:12,452 INFO L290 TraceCheckUtils]: 83: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-15 12:18:12,452 INFO L290 TraceCheckUtils]: 84: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 12:18:12,452 INFO L290 TraceCheckUtils]: 85: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 12:18:12,452 INFO L290 TraceCheckUtils]: 86: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 12:18:12,452 INFO L290 TraceCheckUtils]: 87: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-15 12:18:12,452 INFO L290 TraceCheckUtils]: 88: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 12:18:12,452 INFO L290 TraceCheckUtils]: 89: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 12:18:12,452 INFO L290 TraceCheckUtils]: 90: Hoare triple {42363#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 12:18:12,452 INFO L272 TraceCheckUtils]: 91: Hoare triple {42363#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {42363#false} is VALID [2022-04-15 12:18:12,453 INFO L290 TraceCheckUtils]: 92: Hoare triple {42363#false} ~cond := #in~cond; {42363#false} is VALID [2022-04-15 12:18:12,453 INFO L290 TraceCheckUtils]: 93: Hoare triple {42363#false} assume 0 == ~cond; {42363#false} is VALID [2022-04-15 12:18:12,453 INFO L290 TraceCheckUtils]: 94: Hoare triple {42363#false} assume !false; {42363#false} is VALID [2022-04-15 12:18:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:12,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 94: Hoare triple {42363#false} assume !false; {42363#false} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 93: Hoare triple {42363#false} assume 0 == ~cond; {42363#false} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 92: Hoare triple {42363#false} ~cond := #in~cond; {42363#false} is VALID [2022-04-15 12:18:14,069 INFO L272 TraceCheckUtils]: 91: Hoare triple {42363#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {42363#false} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 90: Hoare triple {42363#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 89: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 88: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 87: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 86: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 85: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 84: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 83: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 82: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 81: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 80: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 79: Hoare triple {42363#false} ~i~0 := 0; {42363#false} is VALID [2022-04-15 12:18:14,069 INFO L290 TraceCheckUtils]: 78: Hoare triple {42739#(< main_~i~0 1024)} assume !(~i~0 < 1024); {42363#false} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 77: Hoare triple {42743#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42739#(< main_~i~0 1024)} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 76: Hoare triple {42743#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42743#(< main_~i~0 1023)} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 75: Hoare triple {42750#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42743#(< main_~i~0 1023)} is VALID [2022-04-15 12:18:14,071 INFO L290 TraceCheckUtils]: 74: Hoare triple {42750#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42750#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:14,071 INFO L290 TraceCheckUtils]: 73: Hoare triple {42757#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42750#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:14,071 INFO L290 TraceCheckUtils]: 72: Hoare triple {42757#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42757#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:14,072 INFO L290 TraceCheckUtils]: 71: Hoare triple {42764#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42757#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:14,072 INFO L290 TraceCheckUtils]: 70: Hoare triple {42764#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42764#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:14,087 INFO L290 TraceCheckUtils]: 69: Hoare triple {42771#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42764#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:14,088 INFO L290 TraceCheckUtils]: 68: Hoare triple {42771#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42771#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:14,088 INFO L290 TraceCheckUtils]: 67: Hoare triple {42778#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42771#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:14,088 INFO L290 TraceCheckUtils]: 66: Hoare triple {42778#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42778#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:14,089 INFO L290 TraceCheckUtils]: 65: Hoare triple {42785#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42778#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:14,089 INFO L290 TraceCheckUtils]: 64: Hoare triple {42785#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42785#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:14,089 INFO L290 TraceCheckUtils]: 63: Hoare triple {42792#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42785#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:14,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {42792#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42792#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:14,090 INFO L290 TraceCheckUtils]: 61: Hoare triple {42799#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42792#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:14,090 INFO L290 TraceCheckUtils]: 60: Hoare triple {42799#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42799#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:14,090 INFO L290 TraceCheckUtils]: 59: Hoare triple {42806#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42799#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:14,091 INFO L290 TraceCheckUtils]: 58: Hoare triple {42806#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42806#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:14,091 INFO L290 TraceCheckUtils]: 57: Hoare triple {42813#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42806#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:14,091 INFO L290 TraceCheckUtils]: 56: Hoare triple {42813#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42813#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:14,091 INFO L290 TraceCheckUtils]: 55: Hoare triple {42820#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42813#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:14,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {42820#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42820#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:14,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {42827#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42820#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:14,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {42827#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42827#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:14,093 INFO L290 TraceCheckUtils]: 51: Hoare triple {42834#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42827#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:14,093 INFO L290 TraceCheckUtils]: 50: Hoare triple {42834#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42834#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:14,093 INFO L290 TraceCheckUtils]: 49: Hoare triple {42841#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42834#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:14,093 INFO L290 TraceCheckUtils]: 48: Hoare triple {42841#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42841#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:14,094 INFO L290 TraceCheckUtils]: 47: Hoare triple {42848#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42841#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:14,094 INFO L290 TraceCheckUtils]: 46: Hoare triple {42848#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42848#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:14,094 INFO L290 TraceCheckUtils]: 45: Hoare triple {42855#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42848#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:14,094 INFO L290 TraceCheckUtils]: 44: Hoare triple {42855#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42855#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:14,095 INFO L290 TraceCheckUtils]: 43: Hoare triple {42862#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42855#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:14,095 INFO L290 TraceCheckUtils]: 42: Hoare triple {42862#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42862#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:14,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {42869#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42862#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:14,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {42869#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42869#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:14,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {42876#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42869#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:14,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {42876#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42876#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:14,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {42883#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42876#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:14,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {42883#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42883#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:14,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {42890#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42883#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:14,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {42890#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42890#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:14,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {42897#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42890#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:14,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {42897#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42897#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:14,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {42904#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42897#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:14,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {42904#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42904#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:14,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {42911#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42904#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:14,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {42911#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42911#(< main_~i~0 999)} is VALID [2022-04-15 12:18:14,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {42918#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42911#(< main_~i~0 999)} is VALID [2022-04-15 12:18:14,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {42918#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42918#(< main_~i~0 998)} is VALID [2022-04-15 12:18:14,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {42925#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42918#(< main_~i~0 998)} is VALID [2022-04-15 12:18:14,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {42925#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42925#(< main_~i~0 997)} is VALID [2022-04-15 12:18:14,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {42932#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42925#(< main_~i~0 997)} is VALID [2022-04-15 12:18:14,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {42932#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42932#(< main_~i~0 996)} is VALID [2022-04-15 12:18:14,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {42939#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42932#(< main_~i~0 996)} is VALID [2022-04-15 12:18:14,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {42939#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42939#(< main_~i~0 995)} is VALID [2022-04-15 12:18:14,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {42946#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42939#(< main_~i~0 995)} is VALID [2022-04-15 12:18:14,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {42946#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42946#(< main_~i~0 994)} is VALID [2022-04-15 12:18:14,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {42953#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42946#(< main_~i~0 994)} is VALID [2022-04-15 12:18:14,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {42953#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42953#(< main_~i~0 993)} is VALID [2022-04-15 12:18:14,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {42960#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42953#(< main_~i~0 993)} is VALID [2022-04-15 12:18:14,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {42960#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42960#(< main_~i~0 992)} is VALID [2022-04-15 12:18:14,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {42967#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42960#(< main_~i~0 992)} is VALID [2022-04-15 12:18:14,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {42967#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42967#(< main_~i~0 991)} is VALID [2022-04-15 12:18:14,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {42974#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42967#(< main_~i~0 991)} is VALID [2022-04-15 12:18:14,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {42974#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42974#(< main_~i~0 990)} is VALID [2022-04-15 12:18:14,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {42981#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42974#(< main_~i~0 990)} is VALID [2022-04-15 12:18:14,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {42981#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42981#(< main_~i~0 989)} is VALID [2022-04-15 12:18:14,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {42988#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42981#(< main_~i~0 989)} is VALID [2022-04-15 12:18:14,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {42988#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42988#(< main_~i~0 988)} is VALID [2022-04-15 12:18:14,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {42362#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42988#(< main_~i~0 988)} is VALID [2022-04-15 12:18:14,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {42362#true} call #t~ret6 := main(); {42362#true} is VALID [2022-04-15 12:18:14,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42362#true} {42362#true} #64#return; {42362#true} is VALID [2022-04-15 12:18:14,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {42362#true} assume true; {42362#true} is VALID [2022-04-15 12:18:14,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {42362#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {42362#true} is VALID [2022-04-15 12:18:14,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {42362#true} call ULTIMATE.init(); {42362#true} is VALID [2022-04-15 12:18:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:14,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365434375] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:14,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:14,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 78 [2022-04-15 12:18:14,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:14,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [935238726] [2022-04-15 12:18:14,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [935238726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:14,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:14,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 12:18:14,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898096477] [2022-04-15 12:18:14,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:14,107 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-15 12:18:14,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:14,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:14,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:14,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 12:18:14,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:14,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 12:18:14,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2022-04-15 12:18:14,159 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:18,926 INFO L93 Difference]: Finished difference Result 292 states and 370 transitions. [2022-04-15 12:18:18,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 12:18:18,926 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2022-04-15 12:18:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 361 transitions. [2022-04-15 12:18:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 361 transitions. [2022-04-15 12:18:18,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 361 transitions. [2022-04-15 12:18:19,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 361 edges. 361 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:19,165 INFO L225 Difference]: With dead ends: 292 [2022-04-15 12:18:19,165 INFO L226 Difference]: Without dead ends: 275 [2022-04-15 12:18:19,166 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5778, Invalid=7332, Unknown=0, NotChecked=0, Total=13110 [2022-04-15 12:18:19,166 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 880 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:19,167 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [880 Valid, 37 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-15 12:18:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 98. [2022-04-15 12:18:19,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:19,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:19,572 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:19,572 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:19,575 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2022-04-15 12:18:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 349 transitions. [2022-04-15 12:18:19,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:19,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:19,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 275 states. [2022-04-15 12:18:19,575 INFO L87 Difference]: Start difference. First operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 275 states. [2022-04-15 12:18:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:19,578 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2022-04-15 12:18:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 349 transitions. [2022-04-15 12:18:19,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:19,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:19,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:19,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2022-04-15 12:18:19,579 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 95 [2022-04-15 12:18:19,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:19,580 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2022-04-15 12:18:19,580 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:19,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 102 transitions. [2022-04-15 12:18:19,744 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:18:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-04-15 12:18:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 12:18:19,744 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:19,744 INFO L499 BasicCegarLoop]: trace histogram [37, 37, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:19,761 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:19,951 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:19,952 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1932719251, now seen corresponding path program 75 times [2022-04-15 12:18:19,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:19,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [836845869] [2022-04-15 12:18:19,956 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:18:19,956 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:18:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1932719251, now seen corresponding path program 76 times [2022-04-15 12:18:19,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:19,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305726853] [2022-04-15 12:18:19,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:19,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:20,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:20,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {44459#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {44416#true} is VALID [2022-04-15 12:18:20,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {44416#true} assume true; {44416#true} is VALID [2022-04-15 12:18:20,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44416#true} {44416#true} #64#return; {44416#true} is VALID [2022-04-15 12:18:20,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {44416#true} call ULTIMATE.init(); {44459#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:20,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {44459#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {44416#true} is VALID [2022-04-15 12:18:20,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {44416#true} assume true; {44416#true} is VALID [2022-04-15 12:18:20,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44416#true} {44416#true} #64#return; {44416#true} is VALID [2022-04-15 12:18:20,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {44416#true} call #t~ret6 := main(); {44416#true} is VALID [2022-04-15 12:18:20,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {44416#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {44421#(= main_~i~0 0)} is VALID [2022-04-15 12:18:20,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {44421#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44421#(= main_~i~0 0)} is VALID [2022-04-15 12:18:20,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {44421#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44422#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:20,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {44422#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44422#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:20,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {44422#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44423#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:20,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {44423#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44423#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:20,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {44423#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44424#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:20,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {44424#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44424#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:20,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {44424#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44425#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:20,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {44425#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44425#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:20,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {44425#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44426#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:20,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {44426#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44426#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:20,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {44426#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44427#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:20,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {44427#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44427#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:20,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {44427#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44428#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:20,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {44428#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44428#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:20,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {44428#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44429#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:20,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {44429#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44429#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:20,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {44429#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44430#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:20,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {44430#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44430#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:20,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {44430#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44431#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:20,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {44431#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44431#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:20,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {44431#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44432#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:20,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {44432#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44432#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {44432#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44433#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {44433#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44433#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {44433#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44434#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {44434#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44434#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {44434#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44435#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {44435#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44435#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {44435#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44436#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:20,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {44436#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44436#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:20,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {44436#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44437#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:20,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {44437#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44437#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:20,502 INFO L290 TraceCheckUtils]: 39: Hoare triple {44437#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44438#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:20,502 INFO L290 TraceCheckUtils]: 40: Hoare triple {44438#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44438#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:20,502 INFO L290 TraceCheckUtils]: 41: Hoare triple {44438#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44439#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:20,502 INFO L290 TraceCheckUtils]: 42: Hoare triple {44439#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44439#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:20,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {44439#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44440#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:20,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {44440#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44440#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:20,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {44440#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44441#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:20,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {44441#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44441#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:20,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {44441#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44442#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:20,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {44442#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44442#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:20,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {44442#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44443#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:20,505 INFO L290 TraceCheckUtils]: 50: Hoare triple {44443#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44443#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:20,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {44443#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44444#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:20,505 INFO L290 TraceCheckUtils]: 52: Hoare triple {44444#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44444#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:20,505 INFO L290 TraceCheckUtils]: 53: Hoare triple {44444#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44445#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:20,506 INFO L290 TraceCheckUtils]: 54: Hoare triple {44445#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44445#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:20,506 INFO L290 TraceCheckUtils]: 55: Hoare triple {44445#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44446#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:20,506 INFO L290 TraceCheckUtils]: 56: Hoare triple {44446#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44446#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:20,507 INFO L290 TraceCheckUtils]: 57: Hoare triple {44446#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44447#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:20,507 INFO L290 TraceCheckUtils]: 58: Hoare triple {44447#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44447#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:20,507 INFO L290 TraceCheckUtils]: 59: Hoare triple {44447#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44448#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:20,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {44448#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44448#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:20,508 INFO L290 TraceCheckUtils]: 61: Hoare triple {44448#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44449#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:20,508 INFO L290 TraceCheckUtils]: 62: Hoare triple {44449#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44449#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:20,508 INFO L290 TraceCheckUtils]: 63: Hoare triple {44449#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44450#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:20,508 INFO L290 TraceCheckUtils]: 64: Hoare triple {44450#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44450#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:20,509 INFO L290 TraceCheckUtils]: 65: Hoare triple {44450#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44451#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:20,509 INFO L290 TraceCheckUtils]: 66: Hoare triple {44451#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44451#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:20,509 INFO L290 TraceCheckUtils]: 67: Hoare triple {44451#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44452#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:20,510 INFO L290 TraceCheckUtils]: 68: Hoare triple {44452#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44452#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:20,510 INFO L290 TraceCheckUtils]: 69: Hoare triple {44452#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44453#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:20,510 INFO L290 TraceCheckUtils]: 70: Hoare triple {44453#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44453#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:20,510 INFO L290 TraceCheckUtils]: 71: Hoare triple {44453#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44454#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:20,511 INFO L290 TraceCheckUtils]: 72: Hoare triple {44454#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44454#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:20,511 INFO L290 TraceCheckUtils]: 73: Hoare triple {44454#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44455#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:20,511 INFO L290 TraceCheckUtils]: 74: Hoare triple {44455#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44455#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:20,512 INFO L290 TraceCheckUtils]: 75: Hoare triple {44455#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44456#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:20,512 INFO L290 TraceCheckUtils]: 76: Hoare triple {44456#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44456#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:20,512 INFO L290 TraceCheckUtils]: 77: Hoare triple {44456#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44457#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:20,512 INFO L290 TraceCheckUtils]: 78: Hoare triple {44457#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44457#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:20,513 INFO L290 TraceCheckUtils]: 79: Hoare triple {44457#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44458#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:20,513 INFO L290 TraceCheckUtils]: 80: Hoare triple {44458#(<= main_~i~0 37)} assume !(~i~0 < 1024); {44417#false} is VALID [2022-04-15 12:18:20,513 INFO L290 TraceCheckUtils]: 81: Hoare triple {44417#false} ~i~0 := 0; {44417#false} is VALID [2022-04-15 12:18:20,513 INFO L290 TraceCheckUtils]: 82: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 12:18:20,513 INFO L290 TraceCheckUtils]: 83: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 12:18:20,513 INFO L290 TraceCheckUtils]: 84: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 12:18:20,513 INFO L290 TraceCheckUtils]: 85: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-15 12:18:20,513 INFO L290 TraceCheckUtils]: 86: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 12:18:20,513 INFO L290 TraceCheckUtils]: 87: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 12:18:20,513 INFO L290 TraceCheckUtils]: 88: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 12:18:20,513 INFO L290 TraceCheckUtils]: 89: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-15 12:18:20,513 INFO L290 TraceCheckUtils]: 90: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 12:18:20,514 INFO L290 TraceCheckUtils]: 91: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 12:18:20,514 INFO L290 TraceCheckUtils]: 92: Hoare triple {44417#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 12:18:20,514 INFO L272 TraceCheckUtils]: 93: Hoare triple {44417#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {44417#false} is VALID [2022-04-15 12:18:20,514 INFO L290 TraceCheckUtils]: 94: Hoare triple {44417#false} ~cond := #in~cond; {44417#false} is VALID [2022-04-15 12:18:20,514 INFO L290 TraceCheckUtils]: 95: Hoare triple {44417#false} assume 0 == ~cond; {44417#false} is VALID [2022-04-15 12:18:20,514 INFO L290 TraceCheckUtils]: 96: Hoare triple {44417#false} assume !false; {44417#false} is VALID [2022-04-15 12:18:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:20,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:20,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305726853] [2022-04-15 12:18:20,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305726853] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:20,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094016468] [2022-04-15 12:18:20,514 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:20,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:20,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:20,516 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:20,517 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:20,701 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:20,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:20,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 12:18:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:20,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:21,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {44416#true} call ULTIMATE.init(); {44416#true} is VALID [2022-04-15 12:18:21,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {44416#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {44416#true} is VALID [2022-04-15 12:18:21,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {44416#true} assume true; {44416#true} is VALID [2022-04-15 12:18:21,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44416#true} {44416#true} #64#return; {44416#true} is VALID [2022-04-15 12:18:21,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {44416#true} call #t~ret6 := main(); {44416#true} is VALID [2022-04-15 12:18:21,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {44416#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {44478#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:21,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {44478#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44478#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:21,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {44478#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44422#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:21,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {44422#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44422#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:21,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {44422#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44423#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:21,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {44423#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44423#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:21,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {44423#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44424#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:21,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {44424#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44424#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:21,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {44424#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44425#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:21,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {44425#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44425#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:21,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {44425#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44426#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:21,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {44426#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44426#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:21,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {44426#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44427#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:21,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {44427#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44427#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:21,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {44427#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44428#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:21,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {44428#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44428#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:21,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {44428#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44429#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:21,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {44429#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44429#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:21,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {44429#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44430#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:21,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {44430#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44430#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:21,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {44430#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44431#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:21,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {44431#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44431#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:21,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {44431#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44432#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:21,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {44432#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44432#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:21,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {44432#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44433#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:21,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {44433#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44433#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:21,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {44433#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44434#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:21,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {44434#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44434#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:21,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {44434#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44435#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:21,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {44435#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44435#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:21,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {44435#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44436#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:21,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {44436#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44436#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:21,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {44436#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44437#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:21,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {44437#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44437#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:21,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {44437#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44438#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:21,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {44438#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44438#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:21,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {44438#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44439#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:21,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {44439#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44439#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:21,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {44439#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44440#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:21,158 INFO L290 TraceCheckUtils]: 44: Hoare triple {44440#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44440#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:21,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {44440#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44441#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:21,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {44441#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44441#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:21,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {44441#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44442#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:21,159 INFO L290 TraceCheckUtils]: 48: Hoare triple {44442#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44442#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:21,160 INFO L290 TraceCheckUtils]: 49: Hoare triple {44442#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44443#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:21,160 INFO L290 TraceCheckUtils]: 50: Hoare triple {44443#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44443#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:21,160 INFO L290 TraceCheckUtils]: 51: Hoare triple {44443#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44444#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:21,160 INFO L290 TraceCheckUtils]: 52: Hoare triple {44444#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44444#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:21,161 INFO L290 TraceCheckUtils]: 53: Hoare triple {44444#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44445#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:21,161 INFO L290 TraceCheckUtils]: 54: Hoare triple {44445#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44445#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:21,161 INFO L290 TraceCheckUtils]: 55: Hoare triple {44445#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44446#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:21,162 INFO L290 TraceCheckUtils]: 56: Hoare triple {44446#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44446#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:21,162 INFO L290 TraceCheckUtils]: 57: Hoare triple {44446#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44447#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:21,162 INFO L290 TraceCheckUtils]: 58: Hoare triple {44447#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44447#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:21,162 INFO L290 TraceCheckUtils]: 59: Hoare triple {44447#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44448#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:21,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {44448#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44448#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:21,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {44448#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44449#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:21,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {44449#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44449#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:21,164 INFO L290 TraceCheckUtils]: 63: Hoare triple {44449#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44450#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:21,164 INFO L290 TraceCheckUtils]: 64: Hoare triple {44450#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44450#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:21,164 INFO L290 TraceCheckUtils]: 65: Hoare triple {44450#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44451#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:21,164 INFO L290 TraceCheckUtils]: 66: Hoare triple {44451#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44451#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:21,165 INFO L290 TraceCheckUtils]: 67: Hoare triple {44451#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44452#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:21,165 INFO L290 TraceCheckUtils]: 68: Hoare triple {44452#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44452#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:21,165 INFO L290 TraceCheckUtils]: 69: Hoare triple {44452#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44453#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:21,165 INFO L290 TraceCheckUtils]: 70: Hoare triple {44453#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44453#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:21,166 INFO L290 TraceCheckUtils]: 71: Hoare triple {44453#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44454#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:21,166 INFO L290 TraceCheckUtils]: 72: Hoare triple {44454#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44454#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:21,166 INFO L290 TraceCheckUtils]: 73: Hoare triple {44454#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44455#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:21,167 INFO L290 TraceCheckUtils]: 74: Hoare triple {44455#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44455#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:21,167 INFO L290 TraceCheckUtils]: 75: Hoare triple {44455#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44456#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:21,167 INFO L290 TraceCheckUtils]: 76: Hoare triple {44456#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44456#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:21,167 INFO L290 TraceCheckUtils]: 77: Hoare triple {44456#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44457#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:21,168 INFO L290 TraceCheckUtils]: 78: Hoare triple {44457#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44457#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:21,168 INFO L290 TraceCheckUtils]: 79: Hoare triple {44457#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44458#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:21,168 INFO L290 TraceCheckUtils]: 80: Hoare triple {44458#(<= main_~i~0 37)} assume !(~i~0 < 1024); {44417#false} is VALID [2022-04-15 12:18:21,168 INFO L290 TraceCheckUtils]: 81: Hoare triple {44417#false} ~i~0 := 0; {44417#false} is VALID [2022-04-15 12:18:21,168 INFO L290 TraceCheckUtils]: 82: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L290 TraceCheckUtils]: 83: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L290 TraceCheckUtils]: 84: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L290 TraceCheckUtils]: 85: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L290 TraceCheckUtils]: 86: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L290 TraceCheckUtils]: 87: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L290 TraceCheckUtils]: 88: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L290 TraceCheckUtils]: 89: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L290 TraceCheckUtils]: 90: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L290 TraceCheckUtils]: 91: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L290 TraceCheckUtils]: 92: Hoare triple {44417#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L272 TraceCheckUtils]: 93: Hoare triple {44417#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L290 TraceCheckUtils]: 94: Hoare triple {44417#false} ~cond := #in~cond; {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L290 TraceCheckUtils]: 95: Hoare triple {44417#false} assume 0 == ~cond; {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L290 TraceCheckUtils]: 96: Hoare triple {44417#false} assume !false; {44417#false} is VALID [2022-04-15 12:18:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:21,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:22,851 INFO L290 TraceCheckUtils]: 96: Hoare triple {44417#false} assume !false; {44417#false} is VALID [2022-04-15 12:18:22,851 INFO L290 TraceCheckUtils]: 95: Hoare triple {44417#false} assume 0 == ~cond; {44417#false} is VALID [2022-04-15 12:18:22,851 INFO L290 TraceCheckUtils]: 94: Hoare triple {44417#false} ~cond := #in~cond; {44417#false} is VALID [2022-04-15 12:18:22,851 INFO L272 TraceCheckUtils]: 93: Hoare triple {44417#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {44417#false} is VALID [2022-04-15 12:18:22,851 INFO L290 TraceCheckUtils]: 92: Hoare triple {44417#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 12:18:22,851 INFO L290 TraceCheckUtils]: 91: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 12:18:22,851 INFO L290 TraceCheckUtils]: 90: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 12:18:22,851 INFO L290 TraceCheckUtils]: 89: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-15 12:18:22,851 INFO L290 TraceCheckUtils]: 88: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 12:18:22,851 INFO L290 TraceCheckUtils]: 87: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 12:18:22,851 INFO L290 TraceCheckUtils]: 86: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 12:18:22,851 INFO L290 TraceCheckUtils]: 85: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-15 12:18:22,851 INFO L290 TraceCheckUtils]: 84: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 12:18:22,852 INFO L290 TraceCheckUtils]: 83: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 12:18:22,852 INFO L290 TraceCheckUtils]: 82: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 12:18:22,852 INFO L290 TraceCheckUtils]: 81: Hoare triple {44417#false} ~i~0 := 0; {44417#false} is VALID [2022-04-15 12:18:22,852 INFO L290 TraceCheckUtils]: 80: Hoare triple {44800#(< main_~i~0 1024)} assume !(~i~0 < 1024); {44417#false} is VALID [2022-04-15 12:18:22,852 INFO L290 TraceCheckUtils]: 79: Hoare triple {44804#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44800#(< main_~i~0 1024)} is VALID [2022-04-15 12:18:22,852 INFO L290 TraceCheckUtils]: 78: Hoare triple {44804#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44804#(< main_~i~0 1023)} is VALID [2022-04-15 12:18:22,853 INFO L290 TraceCheckUtils]: 77: Hoare triple {44811#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44804#(< main_~i~0 1023)} is VALID [2022-04-15 12:18:22,853 INFO L290 TraceCheckUtils]: 76: Hoare triple {44811#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44811#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:22,853 INFO L290 TraceCheckUtils]: 75: Hoare triple {44818#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44811#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:22,854 INFO L290 TraceCheckUtils]: 74: Hoare triple {44818#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44818#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:22,854 INFO L290 TraceCheckUtils]: 73: Hoare triple {44825#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44818#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:22,854 INFO L290 TraceCheckUtils]: 72: Hoare triple {44825#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44825#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:22,854 INFO L290 TraceCheckUtils]: 71: Hoare triple {44832#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44825#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:22,855 INFO L290 TraceCheckUtils]: 70: Hoare triple {44832#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44832#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:22,855 INFO L290 TraceCheckUtils]: 69: Hoare triple {44839#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44832#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:22,855 INFO L290 TraceCheckUtils]: 68: Hoare triple {44839#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44839#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:22,856 INFO L290 TraceCheckUtils]: 67: Hoare triple {44846#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44839#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:22,856 INFO L290 TraceCheckUtils]: 66: Hoare triple {44846#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44846#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:22,856 INFO L290 TraceCheckUtils]: 65: Hoare triple {44853#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44846#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:22,856 INFO L290 TraceCheckUtils]: 64: Hoare triple {44853#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44853#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:22,857 INFO L290 TraceCheckUtils]: 63: Hoare triple {44860#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44853#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:22,857 INFO L290 TraceCheckUtils]: 62: Hoare triple {44860#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44860#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:22,857 INFO L290 TraceCheckUtils]: 61: Hoare triple {44867#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44860#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:22,857 INFO L290 TraceCheckUtils]: 60: Hoare triple {44867#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44867#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:22,858 INFO L290 TraceCheckUtils]: 59: Hoare triple {44874#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44867#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:22,858 INFO L290 TraceCheckUtils]: 58: Hoare triple {44874#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44874#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:22,858 INFO L290 TraceCheckUtils]: 57: Hoare triple {44881#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44874#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:22,859 INFO L290 TraceCheckUtils]: 56: Hoare triple {44881#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44881#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:22,859 INFO L290 TraceCheckUtils]: 55: Hoare triple {44888#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44881#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:22,859 INFO L290 TraceCheckUtils]: 54: Hoare triple {44888#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44888#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:22,860 INFO L290 TraceCheckUtils]: 53: Hoare triple {44895#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44888#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:22,860 INFO L290 TraceCheckUtils]: 52: Hoare triple {44895#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44895#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:22,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {44902#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44895#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:22,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {44902#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44902#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:22,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {44909#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44902#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:22,861 INFO L290 TraceCheckUtils]: 48: Hoare triple {44909#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44909#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:22,861 INFO L290 TraceCheckUtils]: 47: Hoare triple {44916#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44909#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:22,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {44916#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44916#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:22,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {44923#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44916#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:22,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {44923#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44923#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:22,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {44930#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44923#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:22,863 INFO L290 TraceCheckUtils]: 42: Hoare triple {44930#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44930#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:22,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {44937#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44930#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:22,863 INFO L290 TraceCheckUtils]: 40: Hoare triple {44937#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44937#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:22,863 INFO L290 TraceCheckUtils]: 39: Hoare triple {44944#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44937#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:22,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {44944#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44944#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:22,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {44951#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44944#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:22,864 INFO L290 TraceCheckUtils]: 36: Hoare triple {44951#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44951#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:22,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {44958#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44951#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:22,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {44958#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44958#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:22,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {44965#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44958#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:22,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {44965#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44965#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:22,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {44972#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44965#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:22,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {44972#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44972#(< main_~i~0 999)} is VALID [2022-04-15 12:18:22,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {44979#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44972#(< main_~i~0 999)} is VALID [2022-04-15 12:18:22,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {44979#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44979#(< main_~i~0 998)} is VALID [2022-04-15 12:18:22,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {44986#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44979#(< main_~i~0 998)} is VALID [2022-04-15 12:18:22,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {44986#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44986#(< main_~i~0 997)} is VALID [2022-04-15 12:18:22,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {44993#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44986#(< main_~i~0 997)} is VALID [2022-04-15 12:18:22,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {44993#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44993#(< main_~i~0 996)} is VALID [2022-04-15 12:18:22,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {45000#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44993#(< main_~i~0 996)} is VALID [2022-04-15 12:18:22,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {45000#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45000#(< main_~i~0 995)} is VALID [2022-04-15 12:18:22,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {45007#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45000#(< main_~i~0 995)} is VALID [2022-04-15 12:18:22,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {45007#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45007#(< main_~i~0 994)} is VALID [2022-04-15 12:18:22,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {45014#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45007#(< main_~i~0 994)} is VALID [2022-04-15 12:18:22,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {45014#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45014#(< main_~i~0 993)} is VALID [2022-04-15 12:18:22,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {45021#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45014#(< main_~i~0 993)} is VALID [2022-04-15 12:18:22,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {45021#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45021#(< main_~i~0 992)} is VALID [2022-04-15 12:18:22,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {45028#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45021#(< main_~i~0 992)} is VALID [2022-04-15 12:18:22,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {45028#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45028#(< main_~i~0 991)} is VALID [2022-04-15 12:18:22,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {45035#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45028#(< main_~i~0 991)} is VALID [2022-04-15 12:18:22,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {45035#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45035#(< main_~i~0 990)} is VALID [2022-04-15 12:18:22,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {45042#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45035#(< main_~i~0 990)} is VALID [2022-04-15 12:18:22,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {45042#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45042#(< main_~i~0 989)} is VALID [2022-04-15 12:18:22,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {45049#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45042#(< main_~i~0 989)} is VALID [2022-04-15 12:18:22,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {45049#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45049#(< main_~i~0 988)} is VALID [2022-04-15 12:18:22,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {45056#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45049#(< main_~i~0 988)} is VALID [2022-04-15 12:18:22,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {45056#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45056#(< main_~i~0 987)} is VALID [2022-04-15 12:18:22,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {44416#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {45056#(< main_~i~0 987)} is VALID [2022-04-15 12:18:22,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {44416#true} call #t~ret6 := main(); {44416#true} is VALID [2022-04-15 12:18:22,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44416#true} {44416#true} #64#return; {44416#true} is VALID [2022-04-15 12:18:22,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {44416#true} assume true; {44416#true} is VALID [2022-04-15 12:18:22,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {44416#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {44416#true} is VALID [2022-04-15 12:18:22,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {44416#true} call ULTIMATE.init(); {44416#true} is VALID [2022-04-15 12:18:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:22,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094016468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:22,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:22,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-15 12:18:22,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:22,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [836845869] [2022-04-15 12:18:22,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [836845869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:22,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:22,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 12:18:22,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456925376] [2022-04-15 12:18:22,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:22,875 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-15 12:18:22,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:22,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:22,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 12:18:22,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:22,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 12:18:22,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 12:18:22,929 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:27,998 INFO L93 Difference]: Finished difference Result 299 states and 379 transitions. [2022-04-15 12:18:27,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 12:18:27,999 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-15 12:18:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 370 transitions. [2022-04-15 12:18:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 370 transitions. [2022-04-15 12:18:28,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 370 transitions. [2022-04-15 12:18:28,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:28,238 INFO L225 Difference]: With dead ends: 299 [2022-04-15 12:18:28,238 INFO L226 Difference]: Without dead ends: 282 [2022-04-15 12:18:28,239 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=6086, Invalid=7720, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 12:18:28,239 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 858 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:28,240 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [858 Valid, 37 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:28,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-04-15 12:18:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 100. [2022-04-15 12:18:28,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:28,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,652 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,653 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:28,656 INFO L93 Difference]: Finished difference Result 282 states and 358 transitions. [2022-04-15 12:18:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 358 transitions. [2022-04-15 12:18:28,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:28,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:28,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 282 states. [2022-04-15 12:18:28,656 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 282 states. [2022-04-15 12:18:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:28,660 INFO L93 Difference]: Finished difference Result 282 states and 358 transitions. [2022-04-15 12:18:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 358 transitions. [2022-04-15 12:18:28,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:28,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:28,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:28,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2022-04-15 12:18:28,662 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 97 [2022-04-15 12:18:28,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:28,662 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2022-04-15 12:18:28,662 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 104 transitions. [2022-04-15 12:18:28,843 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:18:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2022-04-15 12:18:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 12:18:28,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:28,844 INFO L499 BasicCegarLoop]: trace histogram [38, 38, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:28,863 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:18:29,044 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:18:29,045 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:29,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:29,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1302377265, now seen corresponding path program 77 times [2022-04-15 12:18:29,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:29,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1615764514] [2022-04-15 12:18:29,049 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:18:29,049 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:18:29,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1302377265, now seen corresponding path program 78 times [2022-04-15 12:18:29,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:29,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724674366] [2022-04-15 12:18:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:29,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:29,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:29,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {46562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {46518#true} is VALID [2022-04-15 12:18:29,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {46518#true} assume true; {46518#true} is VALID [2022-04-15 12:18:29,671 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46518#true} {46518#true} #64#return; {46518#true} is VALID [2022-04-15 12:18:29,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {46518#true} call ULTIMATE.init(); {46562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:29,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {46562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {46518#true} is VALID [2022-04-15 12:18:29,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {46518#true} assume true; {46518#true} is VALID [2022-04-15 12:18:29,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46518#true} {46518#true} #64#return; {46518#true} is VALID [2022-04-15 12:18:29,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {46518#true} call #t~ret6 := main(); {46518#true} is VALID [2022-04-15 12:18:29,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {46518#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46523#(= main_~i~0 0)} is VALID [2022-04-15 12:18:29,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {46523#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46523#(= main_~i~0 0)} is VALID [2022-04-15 12:18:29,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {46523#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46524#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:29,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {46524#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46524#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:29,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {46524#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46525#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:29,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {46525#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46525#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:29,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {46525#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46526#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:29,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {46526#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46526#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:29,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {46526#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46527#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:29,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {46527#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46527#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:29,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {46527#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46528#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:29,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {46528#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46528#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:29,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {46528#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46529#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:29,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {46529#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46529#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:29,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {46529#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46530#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:29,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {46530#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46530#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:29,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {46530#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46531#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:29,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {46531#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46531#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:29,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {46531#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46532#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:29,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {46532#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46532#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:29,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {46532#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46533#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:29,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {46533#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46533#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:29,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {46533#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46534#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:29,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {46534#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46534#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:29,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {46534#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46535#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:29,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {46535#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46535#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:29,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {46535#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46536#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:29,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {46536#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46536#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:29,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {46536#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46537#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:29,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {46537#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46537#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:29,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {46537#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46538#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:29,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {46538#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46538#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:29,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {46538#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46539#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:29,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {46539#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46539#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:29,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {46539#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46540#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:29,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {46540#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46540#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:29,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {46540#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46541#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:29,682 INFO L290 TraceCheckUtils]: 42: Hoare triple {46541#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46541#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:29,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {46541#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46542#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:29,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {46542#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46542#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:29,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {46542#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46543#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:29,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {46543#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46543#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:29,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {46543#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46544#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:29,684 INFO L290 TraceCheckUtils]: 48: Hoare triple {46544#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46544#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:29,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {46544#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46545#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:29,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {46545#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46545#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:29,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {46545#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46546#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:29,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {46546#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46546#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:29,685 INFO L290 TraceCheckUtils]: 53: Hoare triple {46546#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46547#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:29,685 INFO L290 TraceCheckUtils]: 54: Hoare triple {46547#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46547#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:29,685 INFO L290 TraceCheckUtils]: 55: Hoare triple {46547#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46548#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:29,686 INFO L290 TraceCheckUtils]: 56: Hoare triple {46548#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46548#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:29,686 INFO L290 TraceCheckUtils]: 57: Hoare triple {46548#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46549#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:29,686 INFO L290 TraceCheckUtils]: 58: Hoare triple {46549#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46549#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:29,687 INFO L290 TraceCheckUtils]: 59: Hoare triple {46549#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46550#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:29,687 INFO L290 TraceCheckUtils]: 60: Hoare triple {46550#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46550#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:29,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {46550#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46551#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:29,687 INFO L290 TraceCheckUtils]: 62: Hoare triple {46551#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46551#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:29,688 INFO L290 TraceCheckUtils]: 63: Hoare triple {46551#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46552#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:29,688 INFO L290 TraceCheckUtils]: 64: Hoare triple {46552#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46552#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:29,688 INFO L290 TraceCheckUtils]: 65: Hoare triple {46552#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46553#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:29,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {46553#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46553#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:29,689 INFO L290 TraceCheckUtils]: 67: Hoare triple {46553#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46554#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:29,689 INFO L290 TraceCheckUtils]: 68: Hoare triple {46554#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46554#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:29,689 INFO L290 TraceCheckUtils]: 69: Hoare triple {46554#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46555#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:29,690 INFO L290 TraceCheckUtils]: 70: Hoare triple {46555#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46555#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:29,690 INFO L290 TraceCheckUtils]: 71: Hoare triple {46555#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46556#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:29,690 INFO L290 TraceCheckUtils]: 72: Hoare triple {46556#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46556#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:29,690 INFO L290 TraceCheckUtils]: 73: Hoare triple {46556#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46557#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:29,691 INFO L290 TraceCheckUtils]: 74: Hoare triple {46557#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46557#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:29,691 INFO L290 TraceCheckUtils]: 75: Hoare triple {46557#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46558#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:29,691 INFO L290 TraceCheckUtils]: 76: Hoare triple {46558#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46558#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:29,692 INFO L290 TraceCheckUtils]: 77: Hoare triple {46558#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46559#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:29,692 INFO L290 TraceCheckUtils]: 78: Hoare triple {46559#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46559#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:29,692 INFO L290 TraceCheckUtils]: 79: Hoare triple {46559#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46560#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:29,692 INFO L290 TraceCheckUtils]: 80: Hoare triple {46560#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46560#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:29,693 INFO L290 TraceCheckUtils]: 81: Hoare triple {46560#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46561#(<= main_~i~0 38)} is VALID [2022-04-15 12:18:29,693 INFO L290 TraceCheckUtils]: 82: Hoare triple {46561#(<= main_~i~0 38)} assume !(~i~0 < 1024); {46519#false} is VALID [2022-04-15 12:18:29,693 INFO L290 TraceCheckUtils]: 83: Hoare triple {46519#false} ~i~0 := 0; {46519#false} is VALID [2022-04-15 12:18:29,693 INFO L290 TraceCheckUtils]: 84: Hoare triple {46519#false} #t~short5 := ~i~0 < 1024; {46519#false} is VALID [2022-04-15 12:18:29,693 INFO L290 TraceCheckUtils]: 85: Hoare triple {46519#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46519#false} is VALID [2022-04-15 12:18:29,693 INFO L290 TraceCheckUtils]: 86: Hoare triple {46519#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46519#false} is VALID [2022-04-15 12:18:29,693 INFO L290 TraceCheckUtils]: 87: Hoare triple {46519#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46519#false} is VALID [2022-04-15 12:18:29,693 INFO L290 TraceCheckUtils]: 88: Hoare triple {46519#false} #t~short5 := ~i~0 < 1024; {46519#false} is VALID [2022-04-15 12:18:29,693 INFO L290 TraceCheckUtils]: 89: Hoare triple {46519#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46519#false} is VALID [2022-04-15 12:18:29,693 INFO L290 TraceCheckUtils]: 90: Hoare triple {46519#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46519#false} is VALID [2022-04-15 12:18:29,693 INFO L290 TraceCheckUtils]: 91: Hoare triple {46519#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46519#false} is VALID [2022-04-15 12:18:29,693 INFO L290 TraceCheckUtils]: 92: Hoare triple {46519#false} #t~short5 := ~i~0 < 1024; {46519#false} is VALID [2022-04-15 12:18:29,693 INFO L290 TraceCheckUtils]: 93: Hoare triple {46519#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46519#false} is VALID [2022-04-15 12:18:29,694 INFO L290 TraceCheckUtils]: 94: Hoare triple {46519#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {46519#false} is VALID [2022-04-15 12:18:29,694 INFO L272 TraceCheckUtils]: 95: Hoare triple {46519#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {46519#false} is VALID [2022-04-15 12:18:29,694 INFO L290 TraceCheckUtils]: 96: Hoare triple {46519#false} ~cond := #in~cond; {46519#false} is VALID [2022-04-15 12:18:29,694 INFO L290 TraceCheckUtils]: 97: Hoare triple {46519#false} assume 0 == ~cond; {46519#false} is VALID [2022-04-15 12:18:29,694 INFO L290 TraceCheckUtils]: 98: Hoare triple {46519#false} assume !false; {46519#false} is VALID [2022-04-15 12:18:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:29,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:29,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724674366] [2022-04-15 12:18:29,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724674366] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:29,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921670098] [2022-04-15 12:18:29,694 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:29,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:29,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:29,695 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:18:29,696 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:18:29,881 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:18:29,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:29,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:18:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:29,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:30,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {46518#true} call ULTIMATE.init(); {46518#true} is VALID [2022-04-15 12:18:30,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {46518#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {46518#true} is VALID [2022-04-15 12:18:30,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {46518#true} assume true; {46518#true} is VALID [2022-04-15 12:18:30,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46518#true} {46518#true} #64#return; {46518#true} is VALID [2022-04-15 12:18:30,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {46518#true} call #t~ret6 := main(); {46518#true} is VALID [2022-04-15 12:18:30,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {46518#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46518#true} is VALID [2022-04-15 12:18:30,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 38: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 43: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 46: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 50: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 51: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 52: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 53: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 54: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 55: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 58: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 59: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 60: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 61: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 62: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 63: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 64: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,108 INFO L290 TraceCheckUtils]: 65: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 66: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 67: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 68: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 69: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 70: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 71: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 72: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 73: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 74: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 75: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 76: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 77: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 78: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 79: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 80: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 81: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,109 INFO L290 TraceCheckUtils]: 82: Hoare triple {46518#true} assume !(~i~0 < 1024); {46518#true} is VALID [2022-04-15 12:18:30,115 INFO L290 TraceCheckUtils]: 83: Hoare triple {46518#true} ~i~0 := 0; {46815#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:30,116 INFO L290 TraceCheckUtils]: 84: Hoare triple {46815#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {46815#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:30,116 INFO L290 TraceCheckUtils]: 85: Hoare triple {46815#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46815#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:30,116 INFO L290 TraceCheckUtils]: 86: Hoare triple {46815#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46815#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:30,116 INFO L290 TraceCheckUtils]: 87: Hoare triple {46815#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46524#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:30,117 INFO L290 TraceCheckUtils]: 88: Hoare triple {46524#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {46524#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:30,117 INFO L290 TraceCheckUtils]: 89: Hoare triple {46524#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46524#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:30,117 INFO L290 TraceCheckUtils]: 90: Hoare triple {46524#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46524#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:30,118 INFO L290 TraceCheckUtils]: 91: Hoare triple {46524#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46525#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:30,118 INFO L290 TraceCheckUtils]: 92: Hoare triple {46525#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {46525#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:30,118 INFO L290 TraceCheckUtils]: 93: Hoare triple {46525#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46525#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:30,118 INFO L290 TraceCheckUtils]: 94: Hoare triple {46525#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {46525#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:30,119 INFO L272 TraceCheckUtils]: 95: Hoare triple {46525#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {46852#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:30,119 INFO L290 TraceCheckUtils]: 96: Hoare triple {46852#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {46856#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:30,119 INFO L290 TraceCheckUtils]: 97: Hoare triple {46856#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {46519#false} is VALID [2022-04-15 12:18:30,119 INFO L290 TraceCheckUtils]: 98: Hoare triple {46519#false} assume !false; {46519#false} is VALID [2022-04-15 12:18:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2022-04-15 12:18:30,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:30,360 INFO L290 TraceCheckUtils]: 98: Hoare triple {46519#false} assume !false; {46519#false} is VALID [2022-04-15 12:18:30,360 INFO L290 TraceCheckUtils]: 97: Hoare triple {46856#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {46519#false} is VALID [2022-04-15 12:18:30,361 INFO L290 TraceCheckUtils]: 96: Hoare triple {46852#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {46856#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:30,361 INFO L272 TraceCheckUtils]: 95: Hoare triple {46872#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {46852#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:30,361 INFO L290 TraceCheckUtils]: 94: Hoare triple {46872#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {46872#(<= main_~i~0 512)} is VALID [2022-04-15 12:18:30,362 INFO L290 TraceCheckUtils]: 93: Hoare triple {46872#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46872#(<= main_~i~0 512)} is VALID [2022-04-15 12:18:30,362 INFO L290 TraceCheckUtils]: 92: Hoare triple {46872#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {46872#(<= main_~i~0 512)} is VALID [2022-04-15 12:18:30,362 INFO L290 TraceCheckUtils]: 91: Hoare triple {46885#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46872#(<= main_~i~0 512)} is VALID [2022-04-15 12:18:30,362 INFO L290 TraceCheckUtils]: 90: Hoare triple {46885#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46885#(<= main_~i~0 511)} is VALID [2022-04-15 12:18:30,363 INFO L290 TraceCheckUtils]: 89: Hoare triple {46885#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46885#(<= main_~i~0 511)} is VALID [2022-04-15 12:18:30,363 INFO L290 TraceCheckUtils]: 88: Hoare triple {46885#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {46885#(<= main_~i~0 511)} is VALID [2022-04-15 12:18:30,363 INFO L290 TraceCheckUtils]: 87: Hoare triple {46898#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46885#(<= main_~i~0 511)} is VALID [2022-04-15 12:18:30,363 INFO L290 TraceCheckUtils]: 86: Hoare triple {46898#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46898#(<= main_~i~0 510)} is VALID [2022-04-15 12:18:30,364 INFO L290 TraceCheckUtils]: 85: Hoare triple {46898#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46898#(<= main_~i~0 510)} is VALID [2022-04-15 12:18:30,364 INFO L290 TraceCheckUtils]: 84: Hoare triple {46898#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {46898#(<= main_~i~0 510)} is VALID [2022-04-15 12:18:30,364 INFO L290 TraceCheckUtils]: 83: Hoare triple {46518#true} ~i~0 := 0; {46898#(<= main_~i~0 510)} is VALID [2022-04-15 12:18:30,364 INFO L290 TraceCheckUtils]: 82: Hoare triple {46518#true} assume !(~i~0 < 1024); {46518#true} is VALID [2022-04-15 12:18:30,364 INFO L290 TraceCheckUtils]: 81: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,364 INFO L290 TraceCheckUtils]: 80: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,364 INFO L290 TraceCheckUtils]: 79: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,364 INFO L290 TraceCheckUtils]: 78: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,364 INFO L290 TraceCheckUtils]: 77: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 76: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 75: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 74: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 73: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 72: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 71: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 70: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 69: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 68: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 67: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 66: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 65: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 64: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 63: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 62: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 60: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 59: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,365 INFO L290 TraceCheckUtils]: 57: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 56: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 55: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 54: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 53: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 52: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 51: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 50: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 43: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {46518#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {46518#true} call #t~ret6 := main(); {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46518#true} {46518#true} #64#return; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {46518#true} assume true; {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {46518#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {46518#true} is VALID [2022-04-15 12:18:30,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {46518#true} call ULTIMATE.init(); {46518#true} is VALID [2022-04-15 12:18:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2022-04-15 12:18:30,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921670098] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:30,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:30,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 7, 7] total 48 [2022-04-15 12:18:30,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:30,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1615764514] [2022-04-15 12:18:30,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1615764514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:30,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:30,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 12:18:30,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174657423] [2022-04-15 12:18:30,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:30,370 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-04-15 12:18:30,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:30,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:30,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:30,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 12:18:30,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:30,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 12:18:30,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=996, Invalid=1260, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:18:30,423 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:35,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:35,734 INFO L93 Difference]: Finished difference Result 306 states and 388 transitions. [2022-04-15 12:18:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 12:18:35,734 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-04-15 12:18:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 379 transitions. [2022-04-15 12:18:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 379 transitions. [2022-04-15 12:18:35,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 379 transitions. [2022-04-15 12:18:36,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:36,027 INFO L225 Difference]: With dead ends: 306 [2022-04-15 12:18:36,027 INFO L226 Difference]: Without dead ends: 289 [2022-04-15 12:18:36,027 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2752, Invalid=4730, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 12:18:36,028 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 770 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:36,028 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 52 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-15 12:18:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 102. [2022-04-15 12:18:36,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:36,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,448 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,448 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:36,451 INFO L93 Difference]: Finished difference Result 289 states and 367 transitions. [2022-04-15 12:18:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 367 transitions. [2022-04-15 12:18:36,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:36,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:36,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-15 12:18:36,452 INFO L87 Difference]: Start difference. First operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-15 12:18:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:36,455 INFO L93 Difference]: Finished difference Result 289 states and 367 transitions. [2022-04-15 12:18:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 367 transitions. [2022-04-15 12:18:36,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:36,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:36,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:36,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2022-04-15 12:18:36,456 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 99 [2022-04-15 12:18:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:36,456 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2022-04-15 12:18:36,456 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 106 transitions. [2022-04-15 12:18:36,642 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:18:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2022-04-15 12:18:36,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 12:18:36,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:36,642 INFO L499 BasicCegarLoop]: trace histogram [39, 39, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:36,659 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:18:36,857 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:18:36,857 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:36,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:36,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1134117455, now seen corresponding path program 79 times [2022-04-15 12:18:36,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:36,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [409437485] [2022-04-15 12:18:36,862 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:18:36,862 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:18:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1134117455, now seen corresponding path program 80 times [2022-04-15 12:18:36,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:36,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815404432] [2022-04-15 12:18:36,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:36,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:37,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:37,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {48679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {48634#true} is VALID [2022-04-15 12:18:37,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {48634#true} assume true; {48634#true} is VALID [2022-04-15 12:18:37,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48634#true} {48634#true} #64#return; {48634#true} is VALID [2022-04-15 12:18:37,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {48634#true} call ULTIMATE.init(); {48679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:37,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {48679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {48634#true} is VALID [2022-04-15 12:18:37,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {48634#true} assume true; {48634#true} is VALID [2022-04-15 12:18:37,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48634#true} {48634#true} #64#return; {48634#true} is VALID [2022-04-15 12:18:37,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {48634#true} call #t~ret6 := main(); {48634#true} is VALID [2022-04-15 12:18:37,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {48634#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {48639#(= main_~i~0 0)} is VALID [2022-04-15 12:18:37,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {48639#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48639#(= main_~i~0 0)} is VALID [2022-04-15 12:18:37,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {48639#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48640#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:37,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {48640#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48640#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:37,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {48640#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48641#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:37,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {48641#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48641#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:37,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {48641#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48642#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:37,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {48642#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48642#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:37,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {48642#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48643#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:37,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {48643#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48643#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:37,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {48643#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48644#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:37,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {48644#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48644#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:37,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {48644#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48645#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:37,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {48645#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48645#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:37,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {48645#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48646#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:37,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {48646#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48646#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:37,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {48646#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48647#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:37,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {48647#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48647#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:37,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {48647#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48648#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:37,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {48648#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48648#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:37,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {48648#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48649#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:37,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {48649#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48649#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:37,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {48649#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48650#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:37,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {48650#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48650#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:37,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {48650#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48651#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:37,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {48651#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48651#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:37,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {48651#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48652#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:37,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {48652#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48652#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:37,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {48652#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48653#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:37,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {48653#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48653#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:37,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {48653#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48654#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:37,491 INFO L290 TraceCheckUtils]: 36: Hoare triple {48654#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48654#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:37,491 INFO L290 TraceCheckUtils]: 37: Hoare triple {48654#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48655#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:37,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {48655#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48655#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:37,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {48655#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48656#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:37,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {48656#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48656#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:37,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {48656#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48657#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:37,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {48657#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48657#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:37,493 INFO L290 TraceCheckUtils]: 43: Hoare triple {48657#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48658#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:37,493 INFO L290 TraceCheckUtils]: 44: Hoare triple {48658#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48658#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:37,493 INFO L290 TraceCheckUtils]: 45: Hoare triple {48658#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48659#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:37,494 INFO L290 TraceCheckUtils]: 46: Hoare triple {48659#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48659#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:37,494 INFO L290 TraceCheckUtils]: 47: Hoare triple {48659#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48660#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:37,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {48660#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48660#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:37,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {48660#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48661#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:37,495 INFO L290 TraceCheckUtils]: 50: Hoare triple {48661#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48661#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:37,495 INFO L290 TraceCheckUtils]: 51: Hoare triple {48661#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48662#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:37,495 INFO L290 TraceCheckUtils]: 52: Hoare triple {48662#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48662#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:37,496 INFO L290 TraceCheckUtils]: 53: Hoare triple {48662#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48663#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:37,496 INFO L290 TraceCheckUtils]: 54: Hoare triple {48663#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48663#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:37,496 INFO L290 TraceCheckUtils]: 55: Hoare triple {48663#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48664#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:37,496 INFO L290 TraceCheckUtils]: 56: Hoare triple {48664#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48664#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:37,497 INFO L290 TraceCheckUtils]: 57: Hoare triple {48664#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48665#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:37,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {48665#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48665#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:37,497 INFO L290 TraceCheckUtils]: 59: Hoare triple {48665#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48666#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:37,497 INFO L290 TraceCheckUtils]: 60: Hoare triple {48666#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48666#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:37,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {48666#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48667#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:37,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {48667#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48667#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:37,498 INFO L290 TraceCheckUtils]: 63: Hoare triple {48667#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48668#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:37,498 INFO L290 TraceCheckUtils]: 64: Hoare triple {48668#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48668#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:37,499 INFO L290 TraceCheckUtils]: 65: Hoare triple {48668#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48669#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:37,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {48669#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48669#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:37,499 INFO L290 TraceCheckUtils]: 67: Hoare triple {48669#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48670#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:37,500 INFO L290 TraceCheckUtils]: 68: Hoare triple {48670#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48670#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:37,500 INFO L290 TraceCheckUtils]: 69: Hoare triple {48670#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48671#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:37,500 INFO L290 TraceCheckUtils]: 70: Hoare triple {48671#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48671#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:37,500 INFO L290 TraceCheckUtils]: 71: Hoare triple {48671#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48672#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:37,501 INFO L290 TraceCheckUtils]: 72: Hoare triple {48672#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48672#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:37,501 INFO L290 TraceCheckUtils]: 73: Hoare triple {48672#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48673#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:37,501 INFO L290 TraceCheckUtils]: 74: Hoare triple {48673#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48673#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:37,502 INFO L290 TraceCheckUtils]: 75: Hoare triple {48673#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48674#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:37,502 INFO L290 TraceCheckUtils]: 76: Hoare triple {48674#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48674#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:37,502 INFO L290 TraceCheckUtils]: 77: Hoare triple {48674#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48675#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:37,502 INFO L290 TraceCheckUtils]: 78: Hoare triple {48675#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48675#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:37,503 INFO L290 TraceCheckUtils]: 79: Hoare triple {48675#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48676#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:37,503 INFO L290 TraceCheckUtils]: 80: Hoare triple {48676#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48676#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:37,503 INFO L290 TraceCheckUtils]: 81: Hoare triple {48676#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48677#(<= main_~i~0 38)} is VALID [2022-04-15 12:18:37,503 INFO L290 TraceCheckUtils]: 82: Hoare triple {48677#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48677#(<= main_~i~0 38)} is VALID [2022-04-15 12:18:37,504 INFO L290 TraceCheckUtils]: 83: Hoare triple {48677#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48678#(<= main_~i~0 39)} is VALID [2022-04-15 12:18:37,504 INFO L290 TraceCheckUtils]: 84: Hoare triple {48678#(<= main_~i~0 39)} assume !(~i~0 < 1024); {48635#false} is VALID [2022-04-15 12:18:37,504 INFO L290 TraceCheckUtils]: 85: Hoare triple {48635#false} ~i~0 := 0; {48635#false} is VALID [2022-04-15 12:18:37,504 INFO L290 TraceCheckUtils]: 86: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 12:18:37,504 INFO L290 TraceCheckUtils]: 87: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 12:18:37,504 INFO L290 TraceCheckUtils]: 88: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 12:18:37,504 INFO L290 TraceCheckUtils]: 89: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-15 12:18:37,504 INFO L290 TraceCheckUtils]: 90: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 12:18:37,504 INFO L290 TraceCheckUtils]: 91: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 12:18:37,504 INFO L290 TraceCheckUtils]: 92: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 12:18:37,505 INFO L290 TraceCheckUtils]: 93: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-15 12:18:37,505 INFO L290 TraceCheckUtils]: 94: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 12:18:37,505 INFO L290 TraceCheckUtils]: 95: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 12:18:37,505 INFO L290 TraceCheckUtils]: 96: Hoare triple {48635#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 12:18:37,505 INFO L272 TraceCheckUtils]: 97: Hoare triple {48635#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {48635#false} is VALID [2022-04-15 12:18:37,505 INFO L290 TraceCheckUtils]: 98: Hoare triple {48635#false} ~cond := #in~cond; {48635#false} is VALID [2022-04-15 12:18:37,505 INFO L290 TraceCheckUtils]: 99: Hoare triple {48635#false} assume 0 == ~cond; {48635#false} is VALID [2022-04-15 12:18:37,505 INFO L290 TraceCheckUtils]: 100: Hoare triple {48635#false} assume !false; {48635#false} is VALID [2022-04-15 12:18:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:37,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:37,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815404432] [2022-04-15 12:18:37,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815404432] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:37,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179991508] [2022-04-15 12:18:37,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:37,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:37,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:37,507 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:18:37,507 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:18:37,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:37,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:37,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 12:18:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:37,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:38,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {48634#true} call ULTIMATE.init(); {48634#true} is VALID [2022-04-15 12:18:38,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {48634#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {48634#true} is VALID [2022-04-15 12:18:38,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {48634#true} assume true; {48634#true} is VALID [2022-04-15 12:18:38,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48634#true} {48634#true} #64#return; {48634#true} is VALID [2022-04-15 12:18:38,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {48634#true} call #t~ret6 := main(); {48634#true} is VALID [2022-04-15 12:18:38,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {48634#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {48698#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:38,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {48698#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48698#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:38,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {48698#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48640#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:38,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {48640#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48640#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:38,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {48640#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48641#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:38,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {48641#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48641#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:38,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {48641#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48642#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:38,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {48642#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48642#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:38,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {48642#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48643#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:38,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {48643#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48643#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:38,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {48643#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48644#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:38,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {48644#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48644#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:38,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {48644#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48645#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:38,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {48645#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48645#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:38,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {48645#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48646#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:38,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {48646#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48646#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:38,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {48646#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48647#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:38,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {48647#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48647#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:38,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {48647#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48648#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:38,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {48648#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48648#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:38,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {48648#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48649#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:38,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {48649#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48649#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:38,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {48649#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48650#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:38,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {48650#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48650#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:38,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {48650#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48651#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:38,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {48651#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48651#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:38,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {48651#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48652#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:38,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {48652#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48652#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:38,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {48652#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48653#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:38,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {48653#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48653#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:38,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {48653#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48654#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:38,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {48654#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48654#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:38,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {48654#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48655#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:38,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {48655#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48655#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:38,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {48655#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48656#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:38,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {48656#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48656#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:38,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {48656#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48657#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:38,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {48657#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48657#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:38,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {48657#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48658#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:38,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {48658#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48658#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:38,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {48658#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48659#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:38,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {48659#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48659#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:38,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {48659#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48660#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:38,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {48660#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48660#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:38,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {48660#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48661#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:38,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {48661#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48661#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:38,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {48661#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48662#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:38,193 INFO L290 TraceCheckUtils]: 52: Hoare triple {48662#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48662#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:38,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {48662#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48663#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:38,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {48663#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48663#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:38,194 INFO L290 TraceCheckUtils]: 55: Hoare triple {48663#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48664#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:38,194 INFO L290 TraceCheckUtils]: 56: Hoare triple {48664#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48664#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:38,194 INFO L290 TraceCheckUtils]: 57: Hoare triple {48664#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48665#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:38,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {48665#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48665#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:38,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {48665#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48666#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:38,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {48666#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48666#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:38,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {48666#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48667#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:38,196 INFO L290 TraceCheckUtils]: 62: Hoare triple {48667#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48667#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:38,196 INFO L290 TraceCheckUtils]: 63: Hoare triple {48667#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48668#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:38,196 INFO L290 TraceCheckUtils]: 64: Hoare triple {48668#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48668#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:38,197 INFO L290 TraceCheckUtils]: 65: Hoare triple {48668#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48669#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:38,197 INFO L290 TraceCheckUtils]: 66: Hoare triple {48669#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48669#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:38,197 INFO L290 TraceCheckUtils]: 67: Hoare triple {48669#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48670#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:38,197 INFO L290 TraceCheckUtils]: 68: Hoare triple {48670#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48670#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:38,198 INFO L290 TraceCheckUtils]: 69: Hoare triple {48670#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48671#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:38,198 INFO L290 TraceCheckUtils]: 70: Hoare triple {48671#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48671#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:38,198 INFO L290 TraceCheckUtils]: 71: Hoare triple {48671#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48672#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:38,199 INFO L290 TraceCheckUtils]: 72: Hoare triple {48672#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48672#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:38,199 INFO L290 TraceCheckUtils]: 73: Hoare triple {48672#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48673#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:38,199 INFO L290 TraceCheckUtils]: 74: Hoare triple {48673#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48673#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:38,200 INFO L290 TraceCheckUtils]: 75: Hoare triple {48673#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48674#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:38,200 INFO L290 TraceCheckUtils]: 76: Hoare triple {48674#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48674#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:38,200 INFO L290 TraceCheckUtils]: 77: Hoare triple {48674#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48675#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:38,200 INFO L290 TraceCheckUtils]: 78: Hoare triple {48675#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48675#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:38,201 INFO L290 TraceCheckUtils]: 79: Hoare triple {48675#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48676#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:38,201 INFO L290 TraceCheckUtils]: 80: Hoare triple {48676#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48676#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:38,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {48676#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48677#(<= main_~i~0 38)} is VALID [2022-04-15 12:18:38,201 INFO L290 TraceCheckUtils]: 82: Hoare triple {48677#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48677#(<= main_~i~0 38)} is VALID [2022-04-15 12:18:38,202 INFO L290 TraceCheckUtils]: 83: Hoare triple {48677#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48678#(<= main_~i~0 39)} is VALID [2022-04-15 12:18:38,202 INFO L290 TraceCheckUtils]: 84: Hoare triple {48678#(<= main_~i~0 39)} assume !(~i~0 < 1024); {48635#false} is VALID [2022-04-15 12:18:38,202 INFO L290 TraceCheckUtils]: 85: Hoare triple {48635#false} ~i~0 := 0; {48635#false} is VALID [2022-04-15 12:18:38,202 INFO L290 TraceCheckUtils]: 86: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 12:18:38,202 INFO L290 TraceCheckUtils]: 87: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 12:18:38,202 INFO L290 TraceCheckUtils]: 88: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 12:18:38,202 INFO L290 TraceCheckUtils]: 89: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-15 12:18:38,202 INFO L290 TraceCheckUtils]: 90: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 12:18:38,202 INFO L290 TraceCheckUtils]: 91: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 12:18:38,202 INFO L290 TraceCheckUtils]: 92: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 12:18:38,203 INFO L290 TraceCheckUtils]: 93: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-15 12:18:38,203 INFO L290 TraceCheckUtils]: 94: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 12:18:38,203 INFO L290 TraceCheckUtils]: 95: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 12:18:38,203 INFO L290 TraceCheckUtils]: 96: Hoare triple {48635#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 12:18:38,203 INFO L272 TraceCheckUtils]: 97: Hoare triple {48635#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {48635#false} is VALID [2022-04-15 12:18:38,203 INFO L290 TraceCheckUtils]: 98: Hoare triple {48635#false} ~cond := #in~cond; {48635#false} is VALID [2022-04-15 12:18:38,203 INFO L290 TraceCheckUtils]: 99: Hoare triple {48635#false} assume 0 == ~cond; {48635#false} is VALID [2022-04-15 12:18:38,203 INFO L290 TraceCheckUtils]: 100: Hoare triple {48635#false} assume !false; {48635#false} is VALID [2022-04-15 12:18:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:38,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:39,971 INFO L290 TraceCheckUtils]: 100: Hoare triple {48635#false} assume !false; {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L290 TraceCheckUtils]: 99: Hoare triple {48635#false} assume 0 == ~cond; {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L290 TraceCheckUtils]: 98: Hoare triple {48635#false} ~cond := #in~cond; {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L272 TraceCheckUtils]: 97: Hoare triple {48635#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L290 TraceCheckUtils]: 96: Hoare triple {48635#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L290 TraceCheckUtils]: 95: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L290 TraceCheckUtils]: 94: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L290 TraceCheckUtils]: 93: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L290 TraceCheckUtils]: 92: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L290 TraceCheckUtils]: 91: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L290 TraceCheckUtils]: 90: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L290 TraceCheckUtils]: 89: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L290 TraceCheckUtils]: 88: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L290 TraceCheckUtils]: 87: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L290 TraceCheckUtils]: 86: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 12:18:39,972 INFO L290 TraceCheckUtils]: 85: Hoare triple {48635#false} ~i~0 := 0; {48635#false} is VALID [2022-04-15 12:18:39,973 INFO L290 TraceCheckUtils]: 84: Hoare triple {49032#(< main_~i~0 1024)} assume !(~i~0 < 1024); {48635#false} is VALID [2022-04-15 12:18:39,973 INFO L290 TraceCheckUtils]: 83: Hoare triple {49036#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49032#(< main_~i~0 1024)} is VALID [2022-04-15 12:18:39,973 INFO L290 TraceCheckUtils]: 82: Hoare triple {49036#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49036#(< main_~i~0 1023)} is VALID [2022-04-15 12:18:39,974 INFO L290 TraceCheckUtils]: 81: Hoare triple {49043#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49036#(< main_~i~0 1023)} is VALID [2022-04-15 12:18:39,974 INFO L290 TraceCheckUtils]: 80: Hoare triple {49043#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49043#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:39,974 INFO L290 TraceCheckUtils]: 79: Hoare triple {49050#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49043#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:39,974 INFO L290 TraceCheckUtils]: 78: Hoare triple {49050#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49050#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:39,975 INFO L290 TraceCheckUtils]: 77: Hoare triple {49057#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49050#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:39,975 INFO L290 TraceCheckUtils]: 76: Hoare triple {49057#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49057#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:39,975 INFO L290 TraceCheckUtils]: 75: Hoare triple {49064#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49057#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:39,976 INFO L290 TraceCheckUtils]: 74: Hoare triple {49064#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49064#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:39,976 INFO L290 TraceCheckUtils]: 73: Hoare triple {49071#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49064#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:39,976 INFO L290 TraceCheckUtils]: 72: Hoare triple {49071#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49071#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:39,976 INFO L290 TraceCheckUtils]: 71: Hoare triple {49078#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49071#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:39,977 INFO L290 TraceCheckUtils]: 70: Hoare triple {49078#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49078#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:39,977 INFO L290 TraceCheckUtils]: 69: Hoare triple {49085#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49078#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:39,977 INFO L290 TraceCheckUtils]: 68: Hoare triple {49085#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49085#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:39,978 INFO L290 TraceCheckUtils]: 67: Hoare triple {49092#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49085#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:39,978 INFO L290 TraceCheckUtils]: 66: Hoare triple {49092#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49092#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:39,978 INFO L290 TraceCheckUtils]: 65: Hoare triple {49099#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49092#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:39,978 INFO L290 TraceCheckUtils]: 64: Hoare triple {49099#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49099#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:39,979 INFO L290 TraceCheckUtils]: 63: Hoare triple {49106#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49099#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:39,979 INFO L290 TraceCheckUtils]: 62: Hoare triple {49106#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49106#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:39,979 INFO L290 TraceCheckUtils]: 61: Hoare triple {49113#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49106#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:39,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {49113#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49113#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:39,980 INFO L290 TraceCheckUtils]: 59: Hoare triple {49120#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49113#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:39,980 INFO L290 TraceCheckUtils]: 58: Hoare triple {49120#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49120#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:39,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {49127#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49120#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:39,981 INFO L290 TraceCheckUtils]: 56: Hoare triple {49127#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49127#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:39,981 INFO L290 TraceCheckUtils]: 55: Hoare triple {49134#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49127#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:39,981 INFO L290 TraceCheckUtils]: 54: Hoare triple {49134#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49134#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:39,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {49141#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49134#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:39,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {49141#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49141#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:39,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {49148#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49141#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:39,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {49148#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49148#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:39,983 INFO L290 TraceCheckUtils]: 49: Hoare triple {49155#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49148#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:39,983 INFO L290 TraceCheckUtils]: 48: Hoare triple {49155#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49155#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:39,983 INFO L290 TraceCheckUtils]: 47: Hoare triple {49162#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49155#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:39,983 INFO L290 TraceCheckUtils]: 46: Hoare triple {49162#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49162#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:39,984 INFO L290 TraceCheckUtils]: 45: Hoare triple {49169#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49162#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:39,984 INFO L290 TraceCheckUtils]: 44: Hoare triple {49169#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49169#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:39,984 INFO L290 TraceCheckUtils]: 43: Hoare triple {49176#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49169#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:39,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {49176#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49176#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:39,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {49183#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49176#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:39,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {49183#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49183#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:39,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {49190#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49183#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:39,986 INFO L290 TraceCheckUtils]: 38: Hoare triple {49190#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49190#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:39,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {49197#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49190#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:39,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {49197#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49197#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:39,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {49204#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49197#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:39,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {49204#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49204#(< main_~i~0 999)} is VALID [2022-04-15 12:18:39,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {49211#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49204#(< main_~i~0 999)} is VALID [2022-04-15 12:18:39,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {49211#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49211#(< main_~i~0 998)} is VALID [2022-04-15 12:18:39,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {49218#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49211#(< main_~i~0 998)} is VALID [2022-04-15 12:18:39,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {49218#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49218#(< main_~i~0 997)} is VALID [2022-04-15 12:18:39,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {49225#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49218#(< main_~i~0 997)} is VALID [2022-04-15 12:18:39,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {49225#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49225#(< main_~i~0 996)} is VALID [2022-04-15 12:18:39,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {49232#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49225#(< main_~i~0 996)} is VALID [2022-04-15 12:18:39,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {49232#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49232#(< main_~i~0 995)} is VALID [2022-04-15 12:18:39,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {49239#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49232#(< main_~i~0 995)} is VALID [2022-04-15 12:18:39,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {49239#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49239#(< main_~i~0 994)} is VALID [2022-04-15 12:18:39,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {49246#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49239#(< main_~i~0 994)} is VALID [2022-04-15 12:18:39,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {49246#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49246#(< main_~i~0 993)} is VALID [2022-04-15 12:18:39,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {49253#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49246#(< main_~i~0 993)} is VALID [2022-04-15 12:18:39,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {49253#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49253#(< main_~i~0 992)} is VALID [2022-04-15 12:18:39,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {49260#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49253#(< main_~i~0 992)} is VALID [2022-04-15 12:18:39,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {49260#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49260#(< main_~i~0 991)} is VALID [2022-04-15 12:18:39,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {49267#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49260#(< main_~i~0 991)} is VALID [2022-04-15 12:18:39,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {49267#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49267#(< main_~i~0 990)} is VALID [2022-04-15 12:18:39,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {49274#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49267#(< main_~i~0 990)} is VALID [2022-04-15 12:18:39,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {49274#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49274#(< main_~i~0 989)} is VALID [2022-04-15 12:18:39,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {49281#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49274#(< main_~i~0 989)} is VALID [2022-04-15 12:18:39,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {49281#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49281#(< main_~i~0 988)} is VALID [2022-04-15 12:18:39,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {49288#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49281#(< main_~i~0 988)} is VALID [2022-04-15 12:18:39,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {49288#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49288#(< main_~i~0 987)} is VALID [2022-04-15 12:18:39,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {49295#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49288#(< main_~i~0 987)} is VALID [2022-04-15 12:18:39,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {49295#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49295#(< main_~i~0 986)} is VALID [2022-04-15 12:18:39,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {49302#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49295#(< main_~i~0 986)} is VALID [2022-04-15 12:18:39,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {49302#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49302#(< main_~i~0 985)} is VALID [2022-04-15 12:18:39,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {48634#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {49302#(< main_~i~0 985)} is VALID [2022-04-15 12:18:39,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {48634#true} call #t~ret6 := main(); {48634#true} is VALID [2022-04-15 12:18:39,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48634#true} {48634#true} #64#return; {48634#true} is VALID [2022-04-15 12:18:39,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {48634#true} assume true; {48634#true} is VALID [2022-04-15 12:18:39,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {48634#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {48634#true} is VALID [2022-04-15 12:18:39,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {48634#true} call ULTIMATE.init(); {48634#true} is VALID [2022-04-15 12:18:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:39,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179991508] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:39,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:39,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 84 [2022-04-15 12:18:39,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:39,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [409437485] [2022-04-15 12:18:39,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [409437485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:39,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:39,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 12:18:39,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236128619] [2022-04-15 12:18:39,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:39,997 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-15 12:18:39,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:39,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:40,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:40,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 12:18:40,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:40,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 12:18:40,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 12:18:40,056 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:45,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:45,738 INFO L93 Difference]: Finished difference Result 313 states and 397 transitions. [2022-04-15 12:18:45,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 12:18:45,738 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-15 12:18:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 388 transitions. [2022-04-15 12:18:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 388 transitions. [2022-04-15 12:18:45,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 388 transitions. [2022-04-15 12:18:45,988 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:18:45,992 INFO L225 Difference]: With dead ends: 313 [2022-04-15 12:18:45,992 INFO L226 Difference]: Without dead ends: 296 [2022-04-15 12:18:45,993 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=6726, Invalid=8526, Unknown=0, NotChecked=0, Total=15252 [2022-04-15 12:18:45,996 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 961 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:45,997 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [961 Valid, 37 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-04-15 12:18:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 104. [2022-04-15 12:18:46,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:46,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:46,422 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:46,422 INFO L87 Difference]: Start difference. First operand 296 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:46,426 INFO L93 Difference]: Finished difference Result 296 states and 376 transitions. [2022-04-15 12:18:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 376 transitions. [2022-04-15 12:18:46,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:46,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:46,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 296 states. [2022-04-15 12:18:46,426 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 296 states. [2022-04-15 12:18:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:46,430 INFO L93 Difference]: Finished difference Result 296 states and 376 transitions. [2022-04-15 12:18:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 376 transitions. [2022-04-15 12:18:46,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:46,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:46,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:46,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2022-04-15 12:18:46,431 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 101 [2022-04-15 12:18:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:46,431 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2022-04-15 12:18:46,431 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:46,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 108 transitions. [2022-04-15 12:18:46,628 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:18:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2022-04-15 12:18:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 12:18:46,629 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:46,629 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:46,646 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:18:46,829 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:18:46,830 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:46,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:46,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1649770003, now seen corresponding path program 81 times [2022-04-15 12:18:46,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:46,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1667911372] [2022-04-15 12:18:46,834 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:18:46,834 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:18:46,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1649770003, now seen corresponding path program 82 times [2022-04-15 12:18:46,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:46,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018788969] [2022-04-15 12:18:46,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:47,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:47,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {50878#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {50832#true} is VALID [2022-04-15 12:18:47,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {50832#true} assume true; {50832#true} is VALID [2022-04-15 12:18:47,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50832#true} {50832#true} #64#return; {50832#true} is VALID [2022-04-15 12:18:47,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {50832#true} call ULTIMATE.init(); {50878#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:47,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {50878#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {50832#true} is VALID [2022-04-15 12:18:47,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {50832#true} assume true; {50832#true} is VALID [2022-04-15 12:18:47,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50832#true} {50832#true} #64#return; {50832#true} is VALID [2022-04-15 12:18:47,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {50832#true} call #t~ret6 := main(); {50832#true} is VALID [2022-04-15 12:18:47,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {50832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {50837#(= main_~i~0 0)} is VALID [2022-04-15 12:18:47,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {50837#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50837#(= main_~i~0 0)} is VALID [2022-04-15 12:18:47,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {50837#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50838#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:47,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {50838#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50838#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:47,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {50838#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50839#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:47,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {50839#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50839#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:47,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {50839#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50840#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:47,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {50840#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50840#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:47,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {50840#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50841#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:47,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {50841#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50841#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:47,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {50841#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50842#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:47,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {50842#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50842#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:47,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {50842#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50843#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:47,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {50843#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50843#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:47,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {50843#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50844#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:47,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {50844#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50844#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:47,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {50844#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50845#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:47,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {50845#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50845#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:47,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {50845#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50846#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:47,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {50846#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50846#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:47,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {50846#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50847#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:47,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {50847#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50847#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:47,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {50847#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50848#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:47,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {50848#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50848#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:47,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {50848#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50849#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:47,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {50849#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50849#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:47,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {50849#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50850#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:47,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {50850#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50850#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:47,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {50850#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50851#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:47,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {50851#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50851#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:47,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {50851#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50852#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:47,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {50852#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50852#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:47,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {50852#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50853#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:47,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {50853#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50853#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:47,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {50853#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50854#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:47,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {50854#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50854#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:47,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {50854#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50855#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:47,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {50855#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50855#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:47,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {50855#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50856#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:47,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {50856#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50856#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:47,529 INFO L290 TraceCheckUtils]: 45: Hoare triple {50856#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50857#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:47,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {50857#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50857#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:47,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {50857#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50858#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:47,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {50858#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50858#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:47,530 INFO L290 TraceCheckUtils]: 49: Hoare triple {50858#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50859#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:47,530 INFO L290 TraceCheckUtils]: 50: Hoare triple {50859#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50859#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:47,530 INFO L290 TraceCheckUtils]: 51: Hoare triple {50859#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50860#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:47,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {50860#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50860#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:47,531 INFO L290 TraceCheckUtils]: 53: Hoare triple {50860#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50861#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:47,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {50861#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50861#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:47,531 INFO L290 TraceCheckUtils]: 55: Hoare triple {50861#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50862#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:47,531 INFO L290 TraceCheckUtils]: 56: Hoare triple {50862#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50862#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:47,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {50862#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50863#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:47,532 INFO L290 TraceCheckUtils]: 58: Hoare triple {50863#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50863#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:47,532 INFO L290 TraceCheckUtils]: 59: Hoare triple {50863#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50864#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:47,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {50864#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50864#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:47,533 INFO L290 TraceCheckUtils]: 61: Hoare triple {50864#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50865#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:47,533 INFO L290 TraceCheckUtils]: 62: Hoare triple {50865#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50865#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:47,533 INFO L290 TraceCheckUtils]: 63: Hoare triple {50865#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50866#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:47,533 INFO L290 TraceCheckUtils]: 64: Hoare triple {50866#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50866#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:47,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {50866#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50867#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:47,534 INFO L290 TraceCheckUtils]: 66: Hoare triple {50867#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50867#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:47,534 INFO L290 TraceCheckUtils]: 67: Hoare triple {50867#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50868#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:47,534 INFO L290 TraceCheckUtils]: 68: Hoare triple {50868#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50868#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:47,535 INFO L290 TraceCheckUtils]: 69: Hoare triple {50868#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50869#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:47,535 INFO L290 TraceCheckUtils]: 70: Hoare triple {50869#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50869#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:47,535 INFO L290 TraceCheckUtils]: 71: Hoare triple {50869#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50870#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:47,536 INFO L290 TraceCheckUtils]: 72: Hoare triple {50870#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50870#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:47,536 INFO L290 TraceCheckUtils]: 73: Hoare triple {50870#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50871#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:47,536 INFO L290 TraceCheckUtils]: 74: Hoare triple {50871#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50871#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:47,536 INFO L290 TraceCheckUtils]: 75: Hoare triple {50871#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50872#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:47,537 INFO L290 TraceCheckUtils]: 76: Hoare triple {50872#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50872#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:47,537 INFO L290 TraceCheckUtils]: 77: Hoare triple {50872#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50873#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:47,537 INFO L290 TraceCheckUtils]: 78: Hoare triple {50873#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50873#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:47,537 INFO L290 TraceCheckUtils]: 79: Hoare triple {50873#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50874#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:47,538 INFO L290 TraceCheckUtils]: 80: Hoare triple {50874#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50874#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:47,538 INFO L290 TraceCheckUtils]: 81: Hoare triple {50874#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50875#(<= main_~i~0 38)} is VALID [2022-04-15 12:18:47,538 INFO L290 TraceCheckUtils]: 82: Hoare triple {50875#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50875#(<= main_~i~0 38)} is VALID [2022-04-15 12:18:47,538 INFO L290 TraceCheckUtils]: 83: Hoare triple {50875#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50876#(<= main_~i~0 39)} is VALID [2022-04-15 12:18:47,539 INFO L290 TraceCheckUtils]: 84: Hoare triple {50876#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50876#(<= main_~i~0 39)} is VALID [2022-04-15 12:18:47,539 INFO L290 TraceCheckUtils]: 85: Hoare triple {50876#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50877#(<= main_~i~0 40)} is VALID [2022-04-15 12:18:47,539 INFO L290 TraceCheckUtils]: 86: Hoare triple {50877#(<= main_~i~0 40)} assume !(~i~0 < 1024); {50833#false} is VALID [2022-04-15 12:18:47,539 INFO L290 TraceCheckUtils]: 87: Hoare triple {50833#false} ~i~0 := 0; {50833#false} is VALID [2022-04-15 12:18:47,539 INFO L290 TraceCheckUtils]: 88: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 12:18:47,539 INFO L290 TraceCheckUtils]: 89: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 12:18:47,539 INFO L290 TraceCheckUtils]: 90: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 12:18:47,539 INFO L290 TraceCheckUtils]: 91: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-15 12:18:47,540 INFO L290 TraceCheckUtils]: 92: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 12:18:47,540 INFO L290 TraceCheckUtils]: 93: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 12:18:47,540 INFO L290 TraceCheckUtils]: 94: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 12:18:47,540 INFO L290 TraceCheckUtils]: 95: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-15 12:18:47,540 INFO L290 TraceCheckUtils]: 96: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 12:18:47,540 INFO L290 TraceCheckUtils]: 97: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 12:18:47,540 INFO L290 TraceCheckUtils]: 98: Hoare triple {50833#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 12:18:47,540 INFO L272 TraceCheckUtils]: 99: Hoare triple {50833#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {50833#false} is VALID [2022-04-15 12:18:47,540 INFO L290 TraceCheckUtils]: 100: Hoare triple {50833#false} ~cond := #in~cond; {50833#false} is VALID [2022-04-15 12:18:47,540 INFO L290 TraceCheckUtils]: 101: Hoare triple {50833#false} assume 0 == ~cond; {50833#false} is VALID [2022-04-15 12:18:47,540 INFO L290 TraceCheckUtils]: 102: Hoare triple {50833#false} assume !false; {50833#false} is VALID [2022-04-15 12:18:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:47,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:47,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018788969] [2022-04-15 12:18:47,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018788969] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:47,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756090938] [2022-04-15 12:18:47,541 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:47,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:47,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:47,542 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:18:47,545 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:18:47,768 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:47,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:47,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 12:18:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:47,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:48,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {50832#true} call ULTIMATE.init(); {50832#true} is VALID [2022-04-15 12:18:48,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {50832#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {50832#true} is VALID [2022-04-15 12:18:48,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {50832#true} assume true; {50832#true} is VALID [2022-04-15 12:18:48,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50832#true} {50832#true} #64#return; {50832#true} is VALID [2022-04-15 12:18:48,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {50832#true} call #t~ret6 := main(); {50832#true} is VALID [2022-04-15 12:18:48,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {50832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {50897#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:48,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {50897#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50897#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:48,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {50897#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50838#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:48,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {50838#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50838#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:48,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {50838#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50839#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:48,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {50839#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50839#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:48,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {50839#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50840#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:48,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {50840#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50840#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:48,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {50840#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50841#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:48,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {50841#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50841#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:48,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {50841#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50842#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:48,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {50842#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50842#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:48,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {50842#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50843#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:48,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {50843#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50843#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:48,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {50843#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50844#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:48,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {50844#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50844#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:48,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {50844#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50845#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:48,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {50845#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50845#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:48,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {50845#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50846#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:48,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {50846#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50846#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:48,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {50846#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50847#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:48,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {50847#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50847#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:48,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {50847#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50848#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:48,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {50848#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50848#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:48,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {50848#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50849#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:48,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {50849#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50849#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:48,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {50849#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50850#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:48,252 INFO L290 TraceCheckUtils]: 32: Hoare triple {50850#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50850#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:48,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {50850#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50851#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:48,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {50851#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50851#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:48,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {50851#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50852#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:48,253 INFO L290 TraceCheckUtils]: 36: Hoare triple {50852#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50852#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:48,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {50852#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50853#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:48,254 INFO L290 TraceCheckUtils]: 38: Hoare triple {50853#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50853#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:48,254 INFO L290 TraceCheckUtils]: 39: Hoare triple {50853#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50854#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:48,254 INFO L290 TraceCheckUtils]: 40: Hoare triple {50854#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50854#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:48,254 INFO L290 TraceCheckUtils]: 41: Hoare triple {50854#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50855#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:48,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {50855#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50855#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:48,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {50855#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50856#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:48,255 INFO L290 TraceCheckUtils]: 44: Hoare triple {50856#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50856#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:48,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {50856#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50857#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:48,256 INFO L290 TraceCheckUtils]: 46: Hoare triple {50857#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50857#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:48,256 INFO L290 TraceCheckUtils]: 47: Hoare triple {50857#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50858#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:48,256 INFO L290 TraceCheckUtils]: 48: Hoare triple {50858#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50858#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:48,257 INFO L290 TraceCheckUtils]: 49: Hoare triple {50858#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50859#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:48,257 INFO L290 TraceCheckUtils]: 50: Hoare triple {50859#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50859#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:48,257 INFO L290 TraceCheckUtils]: 51: Hoare triple {50859#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50860#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:48,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {50860#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50860#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:48,258 INFO L290 TraceCheckUtils]: 53: Hoare triple {50860#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50861#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:48,258 INFO L290 TraceCheckUtils]: 54: Hoare triple {50861#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50861#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:48,258 INFO L290 TraceCheckUtils]: 55: Hoare triple {50861#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50862#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:48,259 INFO L290 TraceCheckUtils]: 56: Hoare triple {50862#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50862#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:48,259 INFO L290 TraceCheckUtils]: 57: Hoare triple {50862#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50863#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:48,259 INFO L290 TraceCheckUtils]: 58: Hoare triple {50863#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50863#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:48,259 INFO L290 TraceCheckUtils]: 59: Hoare triple {50863#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50864#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:48,260 INFO L290 TraceCheckUtils]: 60: Hoare triple {50864#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50864#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:48,260 INFO L290 TraceCheckUtils]: 61: Hoare triple {50864#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50865#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:48,260 INFO L290 TraceCheckUtils]: 62: Hoare triple {50865#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50865#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:48,261 INFO L290 TraceCheckUtils]: 63: Hoare triple {50865#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50866#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:48,261 INFO L290 TraceCheckUtils]: 64: Hoare triple {50866#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50866#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:48,261 INFO L290 TraceCheckUtils]: 65: Hoare triple {50866#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50867#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:48,261 INFO L290 TraceCheckUtils]: 66: Hoare triple {50867#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50867#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:48,262 INFO L290 TraceCheckUtils]: 67: Hoare triple {50867#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50868#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:48,262 INFO L290 TraceCheckUtils]: 68: Hoare triple {50868#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50868#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:48,262 INFO L290 TraceCheckUtils]: 69: Hoare triple {50868#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50869#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:48,262 INFO L290 TraceCheckUtils]: 70: Hoare triple {50869#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50869#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:48,263 INFO L290 TraceCheckUtils]: 71: Hoare triple {50869#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50870#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:48,263 INFO L290 TraceCheckUtils]: 72: Hoare triple {50870#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50870#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:48,263 INFO L290 TraceCheckUtils]: 73: Hoare triple {50870#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50871#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:48,264 INFO L290 TraceCheckUtils]: 74: Hoare triple {50871#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50871#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:48,264 INFO L290 TraceCheckUtils]: 75: Hoare triple {50871#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50872#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:48,264 INFO L290 TraceCheckUtils]: 76: Hoare triple {50872#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50872#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:48,264 INFO L290 TraceCheckUtils]: 77: Hoare triple {50872#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50873#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:48,265 INFO L290 TraceCheckUtils]: 78: Hoare triple {50873#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50873#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:48,265 INFO L290 TraceCheckUtils]: 79: Hoare triple {50873#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50874#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:48,265 INFO L290 TraceCheckUtils]: 80: Hoare triple {50874#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50874#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:48,266 INFO L290 TraceCheckUtils]: 81: Hoare triple {50874#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50875#(<= main_~i~0 38)} is VALID [2022-04-15 12:18:48,266 INFO L290 TraceCheckUtils]: 82: Hoare triple {50875#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50875#(<= main_~i~0 38)} is VALID [2022-04-15 12:18:48,266 INFO L290 TraceCheckUtils]: 83: Hoare triple {50875#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50876#(<= main_~i~0 39)} is VALID [2022-04-15 12:18:48,266 INFO L290 TraceCheckUtils]: 84: Hoare triple {50876#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50876#(<= main_~i~0 39)} is VALID [2022-04-15 12:18:48,267 INFO L290 TraceCheckUtils]: 85: Hoare triple {50876#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50877#(<= main_~i~0 40)} is VALID [2022-04-15 12:18:48,267 INFO L290 TraceCheckUtils]: 86: Hoare triple {50877#(<= main_~i~0 40)} assume !(~i~0 < 1024); {50833#false} is VALID [2022-04-15 12:18:48,267 INFO L290 TraceCheckUtils]: 87: Hoare triple {50833#false} ~i~0 := 0; {50833#false} is VALID [2022-04-15 12:18:48,267 INFO L290 TraceCheckUtils]: 88: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 12:18:48,267 INFO L290 TraceCheckUtils]: 89: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 12:18:48,267 INFO L290 TraceCheckUtils]: 90: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 12:18:48,267 INFO L290 TraceCheckUtils]: 91: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-15 12:18:48,267 INFO L290 TraceCheckUtils]: 92: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 12:18:48,267 INFO L290 TraceCheckUtils]: 93: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 12:18:48,267 INFO L290 TraceCheckUtils]: 94: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 12:18:48,267 INFO L290 TraceCheckUtils]: 95: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-15 12:18:48,267 INFO L290 TraceCheckUtils]: 96: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 12:18:48,268 INFO L290 TraceCheckUtils]: 97: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 12:18:48,268 INFO L290 TraceCheckUtils]: 98: Hoare triple {50833#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 12:18:48,268 INFO L272 TraceCheckUtils]: 99: Hoare triple {50833#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {50833#false} is VALID [2022-04-15 12:18:48,268 INFO L290 TraceCheckUtils]: 100: Hoare triple {50833#false} ~cond := #in~cond; {50833#false} is VALID [2022-04-15 12:18:48,268 INFO L290 TraceCheckUtils]: 101: Hoare triple {50833#false} assume 0 == ~cond; {50833#false} is VALID [2022-04-15 12:18:48,268 INFO L290 TraceCheckUtils]: 102: Hoare triple {50833#false} assume !false; {50833#false} is VALID [2022-04-15 12:18:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:48,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:50,127 INFO L290 TraceCheckUtils]: 102: Hoare triple {50833#false} assume !false; {50833#false} is VALID [2022-04-15 12:18:50,127 INFO L290 TraceCheckUtils]: 101: Hoare triple {50833#false} assume 0 == ~cond; {50833#false} is VALID [2022-04-15 12:18:50,127 INFO L290 TraceCheckUtils]: 100: Hoare triple {50833#false} ~cond := #in~cond; {50833#false} is VALID [2022-04-15 12:18:50,127 INFO L272 TraceCheckUtils]: 99: Hoare triple {50833#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {50833#false} is VALID [2022-04-15 12:18:50,127 INFO L290 TraceCheckUtils]: 98: Hoare triple {50833#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 12:18:50,127 INFO L290 TraceCheckUtils]: 97: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 12:18:50,128 INFO L290 TraceCheckUtils]: 96: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 12:18:50,128 INFO L290 TraceCheckUtils]: 95: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-15 12:18:50,128 INFO L290 TraceCheckUtils]: 94: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 12:18:50,128 INFO L290 TraceCheckUtils]: 93: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 12:18:50,128 INFO L290 TraceCheckUtils]: 92: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 12:18:50,128 INFO L290 TraceCheckUtils]: 91: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-15 12:18:50,128 INFO L290 TraceCheckUtils]: 90: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 12:18:50,128 INFO L290 TraceCheckUtils]: 89: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 12:18:50,128 INFO L290 TraceCheckUtils]: 88: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 12:18:50,128 INFO L290 TraceCheckUtils]: 87: Hoare triple {50833#false} ~i~0 := 0; {50833#false} is VALID [2022-04-15 12:18:50,128 INFO L290 TraceCheckUtils]: 86: Hoare triple {51237#(< main_~i~0 1024)} assume !(~i~0 < 1024); {50833#false} is VALID [2022-04-15 12:18:50,129 INFO L290 TraceCheckUtils]: 85: Hoare triple {51241#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51237#(< main_~i~0 1024)} is VALID [2022-04-15 12:18:50,129 INFO L290 TraceCheckUtils]: 84: Hoare triple {51241#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51241#(< main_~i~0 1023)} is VALID [2022-04-15 12:18:50,129 INFO L290 TraceCheckUtils]: 83: Hoare triple {51248#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51241#(< main_~i~0 1023)} is VALID [2022-04-15 12:18:50,129 INFO L290 TraceCheckUtils]: 82: Hoare triple {51248#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51248#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:50,130 INFO L290 TraceCheckUtils]: 81: Hoare triple {51255#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51248#(< main_~i~0 1022)} is VALID [2022-04-15 12:18:50,130 INFO L290 TraceCheckUtils]: 80: Hoare triple {51255#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51255#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:50,130 INFO L290 TraceCheckUtils]: 79: Hoare triple {51262#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51255#(< main_~i~0 1021)} is VALID [2022-04-15 12:18:50,131 INFO L290 TraceCheckUtils]: 78: Hoare triple {51262#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51262#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:50,131 INFO L290 TraceCheckUtils]: 77: Hoare triple {51269#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51262#(< main_~i~0 1020)} is VALID [2022-04-15 12:18:50,131 INFO L290 TraceCheckUtils]: 76: Hoare triple {51269#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51269#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:50,131 INFO L290 TraceCheckUtils]: 75: Hoare triple {51276#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51269#(< main_~i~0 1019)} is VALID [2022-04-15 12:18:50,132 INFO L290 TraceCheckUtils]: 74: Hoare triple {51276#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51276#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:50,132 INFO L290 TraceCheckUtils]: 73: Hoare triple {51283#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51276#(< main_~i~0 1018)} is VALID [2022-04-15 12:18:50,132 INFO L290 TraceCheckUtils]: 72: Hoare triple {51283#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51283#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:50,133 INFO L290 TraceCheckUtils]: 71: Hoare triple {51290#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51283#(< main_~i~0 1017)} is VALID [2022-04-15 12:18:50,133 INFO L290 TraceCheckUtils]: 70: Hoare triple {51290#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51290#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:50,133 INFO L290 TraceCheckUtils]: 69: Hoare triple {51297#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51290#(< main_~i~0 1016)} is VALID [2022-04-15 12:18:50,133 INFO L290 TraceCheckUtils]: 68: Hoare triple {51297#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51297#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:50,134 INFO L290 TraceCheckUtils]: 67: Hoare triple {51304#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51297#(< main_~i~0 1015)} is VALID [2022-04-15 12:18:50,134 INFO L290 TraceCheckUtils]: 66: Hoare triple {51304#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51304#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:50,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {51311#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51304#(< main_~i~0 1014)} is VALID [2022-04-15 12:18:50,134 INFO L290 TraceCheckUtils]: 64: Hoare triple {51311#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51311#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:50,135 INFO L290 TraceCheckUtils]: 63: Hoare triple {51318#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51311#(< main_~i~0 1013)} is VALID [2022-04-15 12:18:50,135 INFO L290 TraceCheckUtils]: 62: Hoare triple {51318#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51318#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:50,135 INFO L290 TraceCheckUtils]: 61: Hoare triple {51325#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51318#(< main_~i~0 1012)} is VALID [2022-04-15 12:18:50,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {51325#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51325#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:50,136 INFO L290 TraceCheckUtils]: 59: Hoare triple {51332#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51325#(< main_~i~0 1011)} is VALID [2022-04-15 12:18:50,136 INFO L290 TraceCheckUtils]: 58: Hoare triple {51332#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51332#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:50,137 INFO L290 TraceCheckUtils]: 57: Hoare triple {51339#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51332#(< main_~i~0 1010)} is VALID [2022-04-15 12:18:50,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {51339#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51339#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:50,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {51346#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51339#(< main_~i~0 1009)} is VALID [2022-04-15 12:18:50,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {51346#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51346#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:50,138 INFO L290 TraceCheckUtils]: 53: Hoare triple {51353#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51346#(< main_~i~0 1008)} is VALID [2022-04-15 12:18:50,138 INFO L290 TraceCheckUtils]: 52: Hoare triple {51353#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51353#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:50,138 INFO L290 TraceCheckUtils]: 51: Hoare triple {51360#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51353#(< main_~i~0 1007)} is VALID [2022-04-15 12:18:50,138 INFO L290 TraceCheckUtils]: 50: Hoare triple {51360#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51360#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:50,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {51367#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51360#(< main_~i~0 1006)} is VALID [2022-04-15 12:18:50,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {51367#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51367#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:50,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {51374#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51367#(< main_~i~0 1005)} is VALID [2022-04-15 12:18:50,140 INFO L290 TraceCheckUtils]: 46: Hoare triple {51374#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51374#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:50,140 INFO L290 TraceCheckUtils]: 45: Hoare triple {51381#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51374#(< main_~i~0 1004)} is VALID [2022-04-15 12:18:50,140 INFO L290 TraceCheckUtils]: 44: Hoare triple {51381#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51381#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:50,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {51388#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51381#(< main_~i~0 1003)} is VALID [2022-04-15 12:18:50,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {51388#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51388#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:50,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {51395#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51388#(< main_~i~0 1002)} is VALID [2022-04-15 12:18:50,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {51395#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51395#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:50,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {51402#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51395#(< main_~i~0 1001)} is VALID [2022-04-15 12:18:50,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {51402#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51402#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:50,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {51409#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51402#(< main_~i~0 1000)} is VALID [2022-04-15 12:18:50,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {51409#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51409#(< main_~i~0 999)} is VALID [2022-04-15 12:18:50,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {51416#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51409#(< main_~i~0 999)} is VALID [2022-04-15 12:18:50,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {51416#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51416#(< main_~i~0 998)} is VALID [2022-04-15 12:18:50,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {51423#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51416#(< main_~i~0 998)} is VALID [2022-04-15 12:18:50,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {51423#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51423#(< main_~i~0 997)} is VALID [2022-04-15 12:18:50,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {51430#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51423#(< main_~i~0 997)} is VALID [2022-04-15 12:18:50,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {51430#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51430#(< main_~i~0 996)} is VALID [2022-04-15 12:18:50,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {51437#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51430#(< main_~i~0 996)} is VALID [2022-04-15 12:18:50,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {51437#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51437#(< main_~i~0 995)} is VALID [2022-04-15 12:18:50,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {51444#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51437#(< main_~i~0 995)} is VALID [2022-04-15 12:18:50,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {51444#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51444#(< main_~i~0 994)} is VALID [2022-04-15 12:18:50,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {51451#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51444#(< main_~i~0 994)} is VALID [2022-04-15 12:18:50,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {51451#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51451#(< main_~i~0 993)} is VALID [2022-04-15 12:18:50,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {51458#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51451#(< main_~i~0 993)} is VALID [2022-04-15 12:18:50,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {51458#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51458#(< main_~i~0 992)} is VALID [2022-04-15 12:18:50,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {51465#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51458#(< main_~i~0 992)} is VALID [2022-04-15 12:18:50,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {51465#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51465#(< main_~i~0 991)} is VALID [2022-04-15 12:18:50,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {51472#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51465#(< main_~i~0 991)} is VALID [2022-04-15 12:18:50,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {51472#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51472#(< main_~i~0 990)} is VALID [2022-04-15 12:18:50,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {51479#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51472#(< main_~i~0 990)} is VALID [2022-04-15 12:18:50,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {51479#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51479#(< main_~i~0 989)} is VALID [2022-04-15 12:18:50,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {51486#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51479#(< main_~i~0 989)} is VALID [2022-04-15 12:18:50,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {51486#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51486#(< main_~i~0 988)} is VALID [2022-04-15 12:18:50,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {51493#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51486#(< main_~i~0 988)} is VALID [2022-04-15 12:18:50,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {51493#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51493#(< main_~i~0 987)} is VALID [2022-04-15 12:18:50,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {51500#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51493#(< main_~i~0 987)} is VALID [2022-04-15 12:18:50,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {51500#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51500#(< main_~i~0 986)} is VALID [2022-04-15 12:18:50,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {51507#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51500#(< main_~i~0 986)} is VALID [2022-04-15 12:18:50,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {51507#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51507#(< main_~i~0 985)} is VALID [2022-04-15 12:18:50,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {51514#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51507#(< main_~i~0 985)} is VALID [2022-04-15 12:18:50,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {51514#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51514#(< main_~i~0 984)} is VALID [2022-04-15 12:18:50,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {50832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {51514#(< main_~i~0 984)} is VALID [2022-04-15 12:18:50,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {50832#true} call #t~ret6 := main(); {50832#true} is VALID [2022-04-15 12:18:50,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50832#true} {50832#true} #64#return; {50832#true} is VALID [2022-04-15 12:18:50,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {50832#true} assume true; {50832#true} is VALID [2022-04-15 12:18:50,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {50832#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {50832#true} is VALID [2022-04-15 12:18:50,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {50832#true} call ULTIMATE.init(); {50832#true} is VALID [2022-04-15 12:18:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:50,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756090938] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:50,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:50,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-15 12:18:50,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:50,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1667911372] [2022-04-15 12:18:50,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1667911372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:50,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:50,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 12:18:50,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843918576] [2022-04-15 12:18:50,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:50,153 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2022-04-15 12:18:50,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:50,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:50,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:50,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 12:18:50,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:50,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 12:18:50,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 12:18:50,209 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:56,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:56,272 INFO L93 Difference]: Finished difference Result 320 states and 406 transitions. [2022-04-15 12:18:56,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 12:18:56,272 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2022-04-15 12:18:56,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 397 transitions. [2022-04-15 12:18:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 397 transitions. [2022-04-15 12:18:56,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 397 transitions. [2022-04-15 12:18:56,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:56,536 INFO L225 Difference]: With dead ends: 320 [2022-04-15 12:18:56,536 INFO L226 Difference]: Without dead ends: 303 [2022-04-15 12:18:56,537 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=7058, Invalid=8944, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 12:18:56,537 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 768 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:56,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [768 Valid, 62 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:18:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-15 12:18:56,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 106. [2022-04-15 12:18:56,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:56,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:56,975 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:56,975 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:56,979 INFO L93 Difference]: Finished difference Result 303 states and 385 transitions. [2022-04-15 12:18:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 385 transitions. [2022-04-15 12:18:56,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:56,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:56,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 303 states. [2022-04-15 12:18:56,980 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 303 states. [2022-04-15 12:18:56,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:56,983 INFO L93 Difference]: Finished difference Result 303 states and 385 transitions. [2022-04-15 12:18:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 385 transitions. [2022-04-15 12:18:56,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:56,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:56,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:56,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2022-04-15 12:18:56,985 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 103 [2022-04-15 12:18:56,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:56,985 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2022-04-15 12:18:56,985 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:56,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 110 transitions. [2022-04-15 12:18:57,197 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:18:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-04-15 12:18:57,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 12:18:57,198 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:57,198 INFO L499 BasicCegarLoop]: trace histogram [41, 41, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:57,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-04-15 12:18:57,410 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:18:57,410 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:57,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:57,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1200991733, now seen corresponding path program 83 times [2022-04-15 12:18:57,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:57,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [585574533] [2022-04-15 12:18:57,414 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:18:57,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:18:57,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1200991733, now seen corresponding path program 84 times [2022-04-15 12:18:57,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:57,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678493839] [2022-04-15 12:18:57,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:57,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:58,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:58,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {53125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {53078#true} is VALID [2022-04-15 12:18:58,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {53078#true} assume true; {53078#true} is VALID [2022-04-15 12:18:58,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53078#true} {53078#true} #64#return; {53078#true} is VALID [2022-04-15 12:18:58,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {53078#true} call ULTIMATE.init(); {53125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:58,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {53125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {53078#true} is VALID [2022-04-15 12:18:58,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {53078#true} assume true; {53078#true} is VALID [2022-04-15 12:18:58,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53078#true} {53078#true} #64#return; {53078#true} is VALID [2022-04-15 12:18:58,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {53078#true} call #t~ret6 := main(); {53078#true} is VALID [2022-04-15 12:18:58,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {53078#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {53083#(= main_~i~0 0)} is VALID [2022-04-15 12:18:58,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {53083#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53083#(= main_~i~0 0)} is VALID [2022-04-15 12:18:58,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {53083#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53084#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:58,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {53084#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53084#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:58,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {53084#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53085#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:58,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {53085#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53085#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:58,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {53085#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53086#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:58,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {53086#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53086#(<= main_~i~0 3)} is VALID [2022-04-15 12:18:58,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {53086#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53087#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:58,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {53087#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53087#(<= main_~i~0 4)} is VALID [2022-04-15 12:18:58,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {53087#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53088#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:58,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {53088#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53088#(<= main_~i~0 5)} is VALID [2022-04-15 12:18:58,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {53088#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53089#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:58,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {53089#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53089#(<= main_~i~0 6)} is VALID [2022-04-15 12:18:58,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {53089#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53090#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:58,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {53090#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53090#(<= main_~i~0 7)} is VALID [2022-04-15 12:18:58,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {53090#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53091#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:58,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {53091#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53091#(<= main_~i~0 8)} is VALID [2022-04-15 12:18:58,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {53091#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53092#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:58,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {53092#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53092#(<= main_~i~0 9)} is VALID [2022-04-15 12:18:58,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {53092#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53093#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:58,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {53093#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53093#(<= main_~i~0 10)} is VALID [2022-04-15 12:18:58,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {53093#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53094#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:58,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {53094#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53094#(<= main_~i~0 11)} is VALID [2022-04-15 12:18:58,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {53094#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53095#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:58,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {53095#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53095#(<= main_~i~0 12)} is VALID [2022-04-15 12:18:58,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {53095#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53096#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:58,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {53096#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53096#(<= main_~i~0 13)} is VALID [2022-04-15 12:18:58,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {53096#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53097#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:58,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {53097#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53097#(<= main_~i~0 14)} is VALID [2022-04-15 12:18:58,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {53097#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53098#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:58,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {53098#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53098#(<= main_~i~0 15)} is VALID [2022-04-15 12:18:58,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {53098#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53099#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:58,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {53099#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53099#(<= main_~i~0 16)} is VALID [2022-04-15 12:18:58,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {53099#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53100#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:58,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {53100#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53100#(<= main_~i~0 17)} is VALID [2022-04-15 12:18:58,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {53100#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53101#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:58,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {53101#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53101#(<= main_~i~0 18)} is VALID [2022-04-15 12:18:58,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {53101#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53102#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:58,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {53102#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53102#(<= main_~i~0 19)} is VALID [2022-04-15 12:18:58,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {53102#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53103#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:58,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {53103#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53103#(<= main_~i~0 20)} is VALID [2022-04-15 12:18:58,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {53103#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53104#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:58,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {53104#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53104#(<= main_~i~0 21)} is VALID [2022-04-15 12:18:58,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {53104#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53105#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:58,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {53105#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53105#(<= main_~i~0 22)} is VALID [2022-04-15 12:18:58,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {53105#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53106#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:58,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {53106#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53106#(<= main_~i~0 23)} is VALID [2022-04-15 12:18:58,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {53106#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53107#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:58,058 INFO L290 TraceCheckUtils]: 54: Hoare triple {53107#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53107#(<= main_~i~0 24)} is VALID [2022-04-15 12:18:58,058 INFO L290 TraceCheckUtils]: 55: Hoare triple {53107#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53108#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:58,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {53108#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53108#(<= main_~i~0 25)} is VALID [2022-04-15 12:18:58,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {53108#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53109#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:58,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {53109#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53109#(<= main_~i~0 26)} is VALID [2022-04-15 12:18:58,059 INFO L290 TraceCheckUtils]: 59: Hoare triple {53109#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53110#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:58,060 INFO L290 TraceCheckUtils]: 60: Hoare triple {53110#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53110#(<= main_~i~0 27)} is VALID [2022-04-15 12:18:58,060 INFO L290 TraceCheckUtils]: 61: Hoare triple {53110#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53111#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:58,060 INFO L290 TraceCheckUtils]: 62: Hoare triple {53111#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53111#(<= main_~i~0 28)} is VALID [2022-04-15 12:18:58,060 INFO L290 TraceCheckUtils]: 63: Hoare triple {53111#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53112#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:58,061 INFO L290 TraceCheckUtils]: 64: Hoare triple {53112#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53112#(<= main_~i~0 29)} is VALID [2022-04-15 12:18:58,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {53112#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53113#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:58,061 INFO L290 TraceCheckUtils]: 66: Hoare triple {53113#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53113#(<= main_~i~0 30)} is VALID [2022-04-15 12:18:58,062 INFO L290 TraceCheckUtils]: 67: Hoare triple {53113#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53114#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:58,062 INFO L290 TraceCheckUtils]: 68: Hoare triple {53114#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53114#(<= main_~i~0 31)} is VALID [2022-04-15 12:18:58,062 INFO L290 TraceCheckUtils]: 69: Hoare triple {53114#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53115#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:58,062 INFO L290 TraceCheckUtils]: 70: Hoare triple {53115#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53115#(<= main_~i~0 32)} is VALID [2022-04-15 12:18:58,063 INFO L290 TraceCheckUtils]: 71: Hoare triple {53115#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53116#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:58,063 INFO L290 TraceCheckUtils]: 72: Hoare triple {53116#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53116#(<= main_~i~0 33)} is VALID [2022-04-15 12:18:58,063 INFO L290 TraceCheckUtils]: 73: Hoare triple {53116#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53117#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:58,063 INFO L290 TraceCheckUtils]: 74: Hoare triple {53117#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53117#(<= main_~i~0 34)} is VALID [2022-04-15 12:18:58,064 INFO L290 TraceCheckUtils]: 75: Hoare triple {53117#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53118#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:58,064 INFO L290 TraceCheckUtils]: 76: Hoare triple {53118#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53118#(<= main_~i~0 35)} is VALID [2022-04-15 12:18:58,064 INFO L290 TraceCheckUtils]: 77: Hoare triple {53118#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53119#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:58,065 INFO L290 TraceCheckUtils]: 78: Hoare triple {53119#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53119#(<= main_~i~0 36)} is VALID [2022-04-15 12:18:58,065 INFO L290 TraceCheckUtils]: 79: Hoare triple {53119#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53120#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:58,065 INFO L290 TraceCheckUtils]: 80: Hoare triple {53120#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53120#(<= main_~i~0 37)} is VALID [2022-04-15 12:18:58,065 INFO L290 TraceCheckUtils]: 81: Hoare triple {53120#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53121#(<= main_~i~0 38)} is VALID [2022-04-15 12:18:58,066 INFO L290 TraceCheckUtils]: 82: Hoare triple {53121#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53121#(<= main_~i~0 38)} is VALID [2022-04-15 12:18:58,066 INFO L290 TraceCheckUtils]: 83: Hoare triple {53121#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53122#(<= main_~i~0 39)} is VALID [2022-04-15 12:18:58,066 INFO L290 TraceCheckUtils]: 84: Hoare triple {53122#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53122#(<= main_~i~0 39)} is VALID [2022-04-15 12:18:58,067 INFO L290 TraceCheckUtils]: 85: Hoare triple {53122#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53123#(<= main_~i~0 40)} is VALID [2022-04-15 12:18:58,067 INFO L290 TraceCheckUtils]: 86: Hoare triple {53123#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53123#(<= main_~i~0 40)} is VALID [2022-04-15 12:18:58,067 INFO L290 TraceCheckUtils]: 87: Hoare triple {53123#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53124#(<= main_~i~0 41)} is VALID [2022-04-15 12:18:58,067 INFO L290 TraceCheckUtils]: 88: Hoare triple {53124#(<= main_~i~0 41)} assume !(~i~0 < 1024); {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 89: Hoare triple {53079#false} ~i~0 := 0; {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 90: Hoare triple {53079#false} #t~short5 := ~i~0 < 1024; {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 91: Hoare triple {53079#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 92: Hoare triple {53079#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 93: Hoare triple {53079#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 94: Hoare triple {53079#false} #t~short5 := ~i~0 < 1024; {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 95: Hoare triple {53079#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 96: Hoare triple {53079#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 97: Hoare triple {53079#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 98: Hoare triple {53079#false} #t~short5 := ~i~0 < 1024; {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 99: Hoare triple {53079#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 100: Hoare triple {53079#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L272 TraceCheckUtils]: 101: Hoare triple {53079#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 102: Hoare triple {53079#false} ~cond := #in~cond; {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 103: Hoare triple {53079#false} assume 0 == ~cond; {53079#false} is VALID [2022-04-15 12:18:58,068 INFO L290 TraceCheckUtils]: 104: Hoare triple {53079#false} assume !false; {53079#false} is VALID [2022-04-15 12:18:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:18:58,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:58,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678493839] [2022-04-15 12:18:58,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678493839] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:58,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225908861] [2022-04-15 12:18:58,069 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:58,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:58,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:58,070 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:18:58,071 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:18:58,272 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:18:58,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:58,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:18:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:58,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:58,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {53078#true} call ULTIMATE.init(); {53078#true} is VALID [2022-04-15 12:18:58,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {53078#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {53078#true} is VALID [2022-04-15 12:18:58,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {53078#true} assume true; {53078#true} is VALID [2022-04-15 12:18:58,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53078#true} {53078#true} #64#return; {53078#true} is VALID [2022-04-15 12:18:58,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {53078#true} call #t~ret6 := main(); {53078#true} is VALID [2022-04-15 12:18:58,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {53078#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {53078#true} is VALID [2022-04-15 12:18:58,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 42: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 43: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 45: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 46: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 47: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,541 INFO L290 TraceCheckUtils]: 48: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 50: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 51: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 52: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 53: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 54: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 55: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 57: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 58: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 59: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 60: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 61: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 62: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 63: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 64: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 65: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 66: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 67: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,542 INFO L290 TraceCheckUtils]: 68: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 69: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 70: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 71: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 72: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 73: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 74: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 75: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 76: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 77: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 78: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 79: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 80: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 81: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 82: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 83: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 84: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 85: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 86: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 87: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,543 INFO L290 TraceCheckUtils]: 88: Hoare triple {53078#true} assume !(~i~0 < 1024); {53078#true} is VALID [2022-04-15 12:18:58,544 INFO L290 TraceCheckUtils]: 89: Hoare triple {53078#true} ~i~0 := 0; {53396#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:58,544 INFO L290 TraceCheckUtils]: 90: Hoare triple {53396#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {53396#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:58,544 INFO L290 TraceCheckUtils]: 91: Hoare triple {53396#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53396#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:58,545 INFO L290 TraceCheckUtils]: 92: Hoare triple {53396#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53396#(<= main_~i~0 0)} is VALID [2022-04-15 12:18:58,545 INFO L290 TraceCheckUtils]: 93: Hoare triple {53396#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53084#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:58,545 INFO L290 TraceCheckUtils]: 94: Hoare triple {53084#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {53084#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:58,546 INFO L290 TraceCheckUtils]: 95: Hoare triple {53084#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53084#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:58,546 INFO L290 TraceCheckUtils]: 96: Hoare triple {53084#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53084#(<= main_~i~0 1)} is VALID [2022-04-15 12:18:58,546 INFO L290 TraceCheckUtils]: 97: Hoare triple {53084#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53085#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:58,546 INFO L290 TraceCheckUtils]: 98: Hoare triple {53085#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {53085#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:58,547 INFO L290 TraceCheckUtils]: 99: Hoare triple {53085#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53085#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:58,547 INFO L290 TraceCheckUtils]: 100: Hoare triple {53085#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {53085#(<= main_~i~0 2)} is VALID [2022-04-15 12:18:58,548 INFO L272 TraceCheckUtils]: 101: Hoare triple {53085#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {53433#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:58,548 INFO L290 TraceCheckUtils]: 102: Hoare triple {53433#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53437#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:58,548 INFO L290 TraceCheckUtils]: 103: Hoare triple {53437#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53079#false} is VALID [2022-04-15 12:18:58,548 INFO L290 TraceCheckUtils]: 104: Hoare triple {53079#false} assume !false; {53079#false} is VALID [2022-04-15 12:18:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2022-04-15 12:18:58,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:58,821 INFO L290 TraceCheckUtils]: 104: Hoare triple {53079#false} assume !false; {53079#false} is VALID [2022-04-15 12:18:58,822 INFO L290 TraceCheckUtils]: 103: Hoare triple {53437#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53079#false} is VALID [2022-04-15 12:18:58,822 INFO L290 TraceCheckUtils]: 102: Hoare triple {53433#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53437#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:58,822 INFO L272 TraceCheckUtils]: 101: Hoare triple {53453#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {53433#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:58,822 INFO L290 TraceCheckUtils]: 100: Hoare triple {53453#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {53453#(<= main_~i~0 512)} is VALID [2022-04-15 12:18:58,823 INFO L290 TraceCheckUtils]: 99: Hoare triple {53453#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53453#(<= main_~i~0 512)} is VALID [2022-04-15 12:18:58,823 INFO L290 TraceCheckUtils]: 98: Hoare triple {53453#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {53453#(<= main_~i~0 512)} is VALID [2022-04-15 12:18:58,823 INFO L290 TraceCheckUtils]: 97: Hoare triple {53466#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53453#(<= main_~i~0 512)} is VALID [2022-04-15 12:18:58,824 INFO L290 TraceCheckUtils]: 96: Hoare triple {53466#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53466#(<= main_~i~0 511)} is VALID [2022-04-15 12:18:58,824 INFO L290 TraceCheckUtils]: 95: Hoare triple {53466#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53466#(<= main_~i~0 511)} is VALID [2022-04-15 12:18:58,824 INFO L290 TraceCheckUtils]: 94: Hoare triple {53466#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {53466#(<= main_~i~0 511)} is VALID [2022-04-15 12:18:58,824 INFO L290 TraceCheckUtils]: 93: Hoare triple {53479#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53466#(<= main_~i~0 511)} is VALID [2022-04-15 12:18:58,825 INFO L290 TraceCheckUtils]: 92: Hoare triple {53479#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53479#(<= main_~i~0 510)} is VALID [2022-04-15 12:18:58,825 INFO L290 TraceCheckUtils]: 91: Hoare triple {53479#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53479#(<= main_~i~0 510)} is VALID [2022-04-15 12:18:58,825 INFO L290 TraceCheckUtils]: 90: Hoare triple {53479#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {53479#(<= main_~i~0 510)} is VALID [2022-04-15 12:18:58,825 INFO L290 TraceCheckUtils]: 89: Hoare triple {53078#true} ~i~0 := 0; {53479#(<= main_~i~0 510)} is VALID [2022-04-15 12:18:58,825 INFO L290 TraceCheckUtils]: 88: Hoare triple {53078#true} assume !(~i~0 < 1024); {53078#true} is VALID [2022-04-15 12:18:58,825 INFO L290 TraceCheckUtils]: 87: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,825 INFO L290 TraceCheckUtils]: 86: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 85: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 84: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 83: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 82: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 81: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 80: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 79: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 78: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 77: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 76: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 75: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 74: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 73: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 71: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 70: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 69: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 68: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 67: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,826 INFO L290 TraceCheckUtils]: 66: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 65: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 64: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 63: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 62: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 61: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 60: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 59: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 58: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 57: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 56: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 55: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 52: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 51: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 50: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 48: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 47: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,827 INFO L290 TraceCheckUtils]: 46: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 45: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 44: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 41: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 39: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 37: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 12:18:58,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 12:18:58,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {53078#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {53078#true} is VALID [2022-04-15 12:18:58,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {53078#true} call #t~ret6 := main(); {53078#true} is VALID [2022-04-15 12:18:58,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53078#true} {53078#true} #64#return; {53078#true} is VALID [2022-04-15 12:18:58,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {53078#true} assume true; {53078#true} is VALID [2022-04-15 12:18:58,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {53078#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {53078#true} is VALID [2022-04-15 12:18:58,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {53078#true} call ULTIMATE.init(); {53078#true} is VALID [2022-04-15 12:18:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2022-04-15 12:18:58,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225908861] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:58,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:58,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 7, 7] total 51 [2022-04-15 12:18:58,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:58,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [585574533] [2022-04-15 12:18:58,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [585574533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:58,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:58,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 12:18:58,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312337980] [2022-04-15 12:18:58,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:58,831 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-15 12:18:58,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:58,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:58,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:58,890 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 12:18:58,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:58,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 12:18:58,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1134, Invalid=1416, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:18:58,891 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:05,135 INFO L93 Difference]: Finished difference Result 327 states and 415 transitions. [2022-04-15 12:19:05,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 12:19:05,135 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-15 12:19:05,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 406 transitions. [2022-04-15 12:19:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 406 transitions. [2022-04-15 12:19:05,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 406 transitions. [2022-04-15 12:19:05,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:05,401 INFO L225 Difference]: With dead ends: 327 [2022-04-15 12:19:05,401 INFO L226 Difference]: Without dead ends: 310 [2022-04-15 12:19:05,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3151, Invalid=5405, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 12:19:05,401 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 854 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:05,402 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [854 Valid, 42 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:19:05,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-04-15 12:19:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 108. [2022-04-15 12:19:05,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:05,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 310 states. Second operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:05,871 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:05,871 INFO L87 Difference]: Start difference. First operand 310 states. Second operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:05,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:05,875 INFO L93 Difference]: Finished difference Result 310 states and 394 transitions. [2022-04-15 12:19:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 394 transitions. [2022-04-15 12:19:05,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:05,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:05,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 310 states. [2022-04-15 12:19:05,875 INFO L87 Difference]: Start difference. First operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 310 states. [2022-04-15 12:19:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:05,879 INFO L93 Difference]: Finished difference Result 310 states and 394 transitions. [2022-04-15 12:19:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 394 transitions. [2022-04-15 12:19:05,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:05,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:05,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:05,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2022-04-15 12:19:05,881 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 105 [2022-04-15 12:19:05,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:05,881 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2022-04-15 12:19:05,881 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:05,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 112 transitions. [2022-04-15 12:19:06,105 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:19:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2022-04-15 12:19:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 12:19:06,105 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:06,105 INFO L499 BasicCegarLoop]: trace histogram [42, 42, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:06,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-04-15 12:19:06,306 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:06,306 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:06,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:06,306 INFO L85 PathProgramCache]: Analyzing trace with hash 578196137, now seen corresponding path program 85 times [2022-04-15 12:19:06,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:06,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [107452906] [2022-04-15 12:19:06,310 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:06,311 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash 578196137, now seen corresponding path program 86 times [2022-04-15 12:19:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:06,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669878870] [2022-04-15 12:19:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:06,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:07,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:07,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {55383#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {55335#true} is VALID [2022-04-15 12:19:07,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {55335#true} assume true; {55335#true} is VALID [2022-04-15 12:19:07,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55335#true} {55335#true} #64#return; {55335#true} is VALID [2022-04-15 12:19:07,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {55335#true} call ULTIMATE.init(); {55383#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:07,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {55383#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {55335#true} is VALID [2022-04-15 12:19:07,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {55335#true} assume true; {55335#true} is VALID [2022-04-15 12:19:07,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55335#true} {55335#true} #64#return; {55335#true} is VALID [2022-04-15 12:19:07,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {55335#true} call #t~ret6 := main(); {55335#true} is VALID [2022-04-15 12:19:07,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {55335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {55340#(= main_~i~0 0)} is VALID [2022-04-15 12:19:07,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {55340#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55340#(= main_~i~0 0)} is VALID [2022-04-15 12:19:07,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {55340#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55341#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:07,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {55341#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55341#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:07,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {55341#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55342#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:07,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {55342#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55342#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:07,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {55342#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55343#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:07,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {55343#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55343#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:07,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {55343#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55344#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:07,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {55344#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55344#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:07,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {55344#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55345#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:07,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {55345#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55345#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:07,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {55345#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55346#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:07,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {55346#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55346#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:07,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {55346#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55347#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:07,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {55347#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55347#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:07,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {55347#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55348#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:07,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {55348#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55348#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:07,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {55348#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55349#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:07,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {55349#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55349#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:07,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {55349#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55350#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:07,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {55350#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55350#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:07,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {55350#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55351#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:07,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {55351#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55351#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:07,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {55351#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55352#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:07,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {55352#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55352#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:07,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {55352#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55353#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:07,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {55353#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55353#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:07,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {55353#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55354#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:07,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {55354#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55354#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:07,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {55354#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:07,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {55355#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55355#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:07,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {55355#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55356#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:07,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {55356#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55356#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:07,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {55356#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55357#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:07,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {55357#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55357#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:07,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {55357#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55358#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:07,040 INFO L290 TraceCheckUtils]: 42: Hoare triple {55358#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55358#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:07,041 INFO L290 TraceCheckUtils]: 43: Hoare triple {55358#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55359#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:07,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {55359#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55359#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:07,041 INFO L290 TraceCheckUtils]: 45: Hoare triple {55359#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55360#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:07,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {55360#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55360#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:07,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {55360#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55361#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:07,042 INFO L290 TraceCheckUtils]: 48: Hoare triple {55361#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55361#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:07,042 INFO L290 TraceCheckUtils]: 49: Hoare triple {55361#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55362#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:07,042 INFO L290 TraceCheckUtils]: 50: Hoare triple {55362#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55362#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:07,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {55362#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55363#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:07,043 INFO L290 TraceCheckUtils]: 52: Hoare triple {55363#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55363#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:07,043 INFO L290 TraceCheckUtils]: 53: Hoare triple {55363#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55364#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:07,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {55364#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55364#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:07,044 INFO L290 TraceCheckUtils]: 55: Hoare triple {55364#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55365#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:07,044 INFO L290 TraceCheckUtils]: 56: Hoare triple {55365#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55365#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:07,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {55365#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55366#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:07,045 INFO L290 TraceCheckUtils]: 58: Hoare triple {55366#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55366#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:07,045 INFO L290 TraceCheckUtils]: 59: Hoare triple {55366#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55367#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:07,045 INFO L290 TraceCheckUtils]: 60: Hoare triple {55367#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55367#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:07,046 INFO L290 TraceCheckUtils]: 61: Hoare triple {55367#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55368#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:07,046 INFO L290 TraceCheckUtils]: 62: Hoare triple {55368#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55368#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:07,046 INFO L290 TraceCheckUtils]: 63: Hoare triple {55368#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55369#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:07,046 INFO L290 TraceCheckUtils]: 64: Hoare triple {55369#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55369#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:07,047 INFO L290 TraceCheckUtils]: 65: Hoare triple {55369#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55370#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:07,047 INFO L290 TraceCheckUtils]: 66: Hoare triple {55370#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55370#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:07,047 INFO L290 TraceCheckUtils]: 67: Hoare triple {55370#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55371#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:07,048 INFO L290 TraceCheckUtils]: 68: Hoare triple {55371#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55371#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:07,048 INFO L290 TraceCheckUtils]: 69: Hoare triple {55371#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55372#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:07,048 INFO L290 TraceCheckUtils]: 70: Hoare triple {55372#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55372#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:07,048 INFO L290 TraceCheckUtils]: 71: Hoare triple {55372#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55373#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:07,049 INFO L290 TraceCheckUtils]: 72: Hoare triple {55373#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55373#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:07,049 INFO L290 TraceCheckUtils]: 73: Hoare triple {55373#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55374#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:07,049 INFO L290 TraceCheckUtils]: 74: Hoare triple {55374#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55374#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:07,050 INFO L290 TraceCheckUtils]: 75: Hoare triple {55374#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55375#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:07,050 INFO L290 TraceCheckUtils]: 76: Hoare triple {55375#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55375#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:07,050 INFO L290 TraceCheckUtils]: 77: Hoare triple {55375#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55376#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:07,050 INFO L290 TraceCheckUtils]: 78: Hoare triple {55376#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55376#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:07,051 INFO L290 TraceCheckUtils]: 79: Hoare triple {55376#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55377#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:07,051 INFO L290 TraceCheckUtils]: 80: Hoare triple {55377#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55377#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:07,051 INFO L290 TraceCheckUtils]: 81: Hoare triple {55377#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55378#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:07,051 INFO L290 TraceCheckUtils]: 82: Hoare triple {55378#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55378#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:07,052 INFO L290 TraceCheckUtils]: 83: Hoare triple {55378#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55379#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:07,052 INFO L290 TraceCheckUtils]: 84: Hoare triple {55379#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55379#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:07,052 INFO L290 TraceCheckUtils]: 85: Hoare triple {55379#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55380#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:07,053 INFO L290 TraceCheckUtils]: 86: Hoare triple {55380#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55380#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:07,053 INFO L290 TraceCheckUtils]: 87: Hoare triple {55380#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55381#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:07,053 INFO L290 TraceCheckUtils]: 88: Hoare triple {55381#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55381#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:07,053 INFO L290 TraceCheckUtils]: 89: Hoare triple {55381#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55382#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:07,054 INFO L290 TraceCheckUtils]: 90: Hoare triple {55382#(<= main_~i~0 42)} assume !(~i~0 < 1024); {55336#false} is VALID [2022-04-15 12:19:07,054 INFO L290 TraceCheckUtils]: 91: Hoare triple {55336#false} ~i~0 := 0; {55336#false} is VALID [2022-04-15 12:19:07,054 INFO L290 TraceCheckUtils]: 92: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 12:19:07,054 INFO L290 TraceCheckUtils]: 93: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 12:19:07,054 INFO L290 TraceCheckUtils]: 94: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 12:19:07,054 INFO L290 TraceCheckUtils]: 95: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-15 12:19:07,054 INFO L290 TraceCheckUtils]: 96: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 12:19:07,054 INFO L290 TraceCheckUtils]: 97: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 12:19:07,054 INFO L290 TraceCheckUtils]: 98: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 12:19:07,054 INFO L290 TraceCheckUtils]: 99: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-15 12:19:07,054 INFO L290 TraceCheckUtils]: 100: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 12:19:07,054 INFO L290 TraceCheckUtils]: 101: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 12:19:07,054 INFO L290 TraceCheckUtils]: 102: Hoare triple {55336#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 12:19:07,054 INFO L272 TraceCheckUtils]: 103: Hoare triple {55336#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {55336#false} is VALID [2022-04-15 12:19:07,054 INFO L290 TraceCheckUtils]: 104: Hoare triple {55336#false} ~cond := #in~cond; {55336#false} is VALID [2022-04-15 12:19:07,055 INFO L290 TraceCheckUtils]: 105: Hoare triple {55336#false} assume 0 == ~cond; {55336#false} is VALID [2022-04-15 12:19:07,055 INFO L290 TraceCheckUtils]: 106: Hoare triple {55336#false} assume !false; {55336#false} is VALID [2022-04-15 12:19:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:19:07,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:07,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669878870] [2022-04-15 12:19:07,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669878870] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:07,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35527929] [2022-04-15 12:19:07,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:19:07,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:07,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:07,056 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:07,057 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:07,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:19:07,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:07,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 12:19:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:07,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:07,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {55335#true} call ULTIMATE.init(); {55335#true} is VALID [2022-04-15 12:19:07,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {55335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {55335#true} is VALID [2022-04-15 12:19:07,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {55335#true} assume true; {55335#true} is VALID [2022-04-15 12:19:07,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55335#true} {55335#true} #64#return; {55335#true} is VALID [2022-04-15 12:19:07,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {55335#true} call #t~ret6 := main(); {55335#true} is VALID [2022-04-15 12:19:07,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {55335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {55402#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:07,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {55402#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55402#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:07,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {55402#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55341#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:07,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {55341#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55341#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:07,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {55341#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55342#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:07,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {55342#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55342#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:07,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {55342#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55343#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:07,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {55343#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55343#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:07,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {55343#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55344#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:07,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {55344#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55344#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:07,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {55344#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55345#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:07,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {55345#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55345#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:07,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {55345#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55346#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:07,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {55346#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55346#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:07,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {55346#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55347#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:07,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {55347#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55347#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:07,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {55347#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55348#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:07,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {55348#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55348#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:07,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {55348#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55349#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:07,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {55349#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55349#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:07,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {55349#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55350#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:07,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {55350#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55350#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:07,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {55350#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55351#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:07,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {55351#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55351#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:07,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {55351#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55352#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:07,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {55352#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55352#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:07,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {55352#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55353#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:07,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {55353#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55353#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:07,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {55353#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55354#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:07,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {55354#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55354#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:07,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {55354#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:07,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {55355#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55355#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:07,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {55355#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55356#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:07,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {55356#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55356#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:07,885 INFO L290 TraceCheckUtils]: 39: Hoare triple {55356#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55357#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:07,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {55357#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55357#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:07,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {55357#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55358#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:07,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {55358#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55358#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:07,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {55358#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55359#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:07,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {55359#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55359#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:07,887 INFO L290 TraceCheckUtils]: 45: Hoare triple {55359#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55360#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:07,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {55360#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55360#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:07,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {55360#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55361#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:07,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {55361#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55361#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:07,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {55361#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55362#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:07,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {55362#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55362#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:07,888 INFO L290 TraceCheckUtils]: 51: Hoare triple {55362#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55363#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:07,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {55363#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55363#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:07,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {55363#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55364#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:07,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {55364#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55364#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:07,890 INFO L290 TraceCheckUtils]: 55: Hoare triple {55364#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55365#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:07,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {55365#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55365#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:07,890 INFO L290 TraceCheckUtils]: 57: Hoare triple {55365#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55366#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:07,890 INFO L290 TraceCheckUtils]: 58: Hoare triple {55366#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55366#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:07,891 INFO L290 TraceCheckUtils]: 59: Hoare triple {55366#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55367#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:07,891 INFO L290 TraceCheckUtils]: 60: Hoare triple {55367#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55367#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:07,891 INFO L290 TraceCheckUtils]: 61: Hoare triple {55367#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55368#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:07,891 INFO L290 TraceCheckUtils]: 62: Hoare triple {55368#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55368#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:07,892 INFO L290 TraceCheckUtils]: 63: Hoare triple {55368#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55369#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:07,892 INFO L290 TraceCheckUtils]: 64: Hoare triple {55369#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55369#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:07,892 INFO L290 TraceCheckUtils]: 65: Hoare triple {55369#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55370#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:07,893 INFO L290 TraceCheckUtils]: 66: Hoare triple {55370#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55370#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:07,893 INFO L290 TraceCheckUtils]: 67: Hoare triple {55370#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55371#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:07,893 INFO L290 TraceCheckUtils]: 68: Hoare triple {55371#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55371#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:07,894 INFO L290 TraceCheckUtils]: 69: Hoare triple {55371#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55372#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:07,894 INFO L290 TraceCheckUtils]: 70: Hoare triple {55372#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55372#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:07,894 INFO L290 TraceCheckUtils]: 71: Hoare triple {55372#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55373#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:07,894 INFO L290 TraceCheckUtils]: 72: Hoare triple {55373#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55373#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:07,895 INFO L290 TraceCheckUtils]: 73: Hoare triple {55373#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55374#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:07,895 INFO L290 TraceCheckUtils]: 74: Hoare triple {55374#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55374#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:07,895 INFO L290 TraceCheckUtils]: 75: Hoare triple {55374#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55375#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:07,895 INFO L290 TraceCheckUtils]: 76: Hoare triple {55375#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55375#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:07,896 INFO L290 TraceCheckUtils]: 77: Hoare triple {55375#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55376#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:07,896 INFO L290 TraceCheckUtils]: 78: Hoare triple {55376#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55376#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:07,896 INFO L290 TraceCheckUtils]: 79: Hoare triple {55376#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55377#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:07,897 INFO L290 TraceCheckUtils]: 80: Hoare triple {55377#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55377#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:07,897 INFO L290 TraceCheckUtils]: 81: Hoare triple {55377#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55378#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:07,897 INFO L290 TraceCheckUtils]: 82: Hoare triple {55378#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55378#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:07,897 INFO L290 TraceCheckUtils]: 83: Hoare triple {55378#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55379#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:07,898 INFO L290 TraceCheckUtils]: 84: Hoare triple {55379#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55379#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:07,898 INFO L290 TraceCheckUtils]: 85: Hoare triple {55379#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55380#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:07,898 INFO L290 TraceCheckUtils]: 86: Hoare triple {55380#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55380#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:07,899 INFO L290 TraceCheckUtils]: 87: Hoare triple {55380#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55381#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:07,899 INFO L290 TraceCheckUtils]: 88: Hoare triple {55381#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55381#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:07,899 INFO L290 TraceCheckUtils]: 89: Hoare triple {55381#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55382#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:07,899 INFO L290 TraceCheckUtils]: 90: Hoare triple {55382#(<= main_~i~0 42)} assume !(~i~0 < 1024); {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 91: Hoare triple {55336#false} ~i~0 := 0; {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 92: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 93: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 94: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 95: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 96: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 97: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 98: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 99: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 100: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 101: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 102: Hoare triple {55336#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L272 TraceCheckUtils]: 103: Hoare triple {55336#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 104: Hoare triple {55336#false} ~cond := #in~cond; {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 105: Hoare triple {55336#false} assume 0 == ~cond; {55336#false} is VALID [2022-04-15 12:19:07,900 INFO L290 TraceCheckUtils]: 106: Hoare triple {55336#false} assume !false; {55336#false} is VALID [2022-04-15 12:19:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:19:07,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:10,040 INFO L290 TraceCheckUtils]: 106: Hoare triple {55336#false} assume !false; {55336#false} is VALID [2022-04-15 12:19:10,040 INFO L290 TraceCheckUtils]: 105: Hoare triple {55336#false} assume 0 == ~cond; {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L290 TraceCheckUtils]: 104: Hoare triple {55336#false} ~cond := #in~cond; {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L272 TraceCheckUtils]: 103: Hoare triple {55336#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L290 TraceCheckUtils]: 102: Hoare triple {55336#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L290 TraceCheckUtils]: 101: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L290 TraceCheckUtils]: 100: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L290 TraceCheckUtils]: 99: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L290 TraceCheckUtils]: 98: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L290 TraceCheckUtils]: 97: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L290 TraceCheckUtils]: 96: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L290 TraceCheckUtils]: 95: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L290 TraceCheckUtils]: 94: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L290 TraceCheckUtils]: 93: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L290 TraceCheckUtils]: 92: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L290 TraceCheckUtils]: 91: Hoare triple {55336#false} ~i~0 := 0; {55336#false} is VALID [2022-04-15 12:19:10,041 INFO L290 TraceCheckUtils]: 90: Hoare triple {55754#(< main_~i~0 1024)} assume !(~i~0 < 1024); {55336#false} is VALID [2022-04-15 12:19:10,042 INFO L290 TraceCheckUtils]: 89: Hoare triple {55758#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55754#(< main_~i~0 1024)} is VALID [2022-04-15 12:19:10,042 INFO L290 TraceCheckUtils]: 88: Hoare triple {55758#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55758#(< main_~i~0 1023)} is VALID [2022-04-15 12:19:10,042 INFO L290 TraceCheckUtils]: 87: Hoare triple {55765#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55758#(< main_~i~0 1023)} is VALID [2022-04-15 12:19:10,043 INFO L290 TraceCheckUtils]: 86: Hoare triple {55765#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55765#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:10,043 INFO L290 TraceCheckUtils]: 85: Hoare triple {55772#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55765#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:10,043 INFO L290 TraceCheckUtils]: 84: Hoare triple {55772#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55772#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:10,044 INFO L290 TraceCheckUtils]: 83: Hoare triple {55779#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55772#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:10,044 INFO L290 TraceCheckUtils]: 82: Hoare triple {55779#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55779#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:10,044 INFO L290 TraceCheckUtils]: 81: Hoare triple {55786#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55779#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:10,045 INFO L290 TraceCheckUtils]: 80: Hoare triple {55786#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55786#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:10,045 INFO L290 TraceCheckUtils]: 79: Hoare triple {55793#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55786#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:10,045 INFO L290 TraceCheckUtils]: 78: Hoare triple {55793#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55793#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:10,045 INFO L290 TraceCheckUtils]: 77: Hoare triple {55800#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55793#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:10,046 INFO L290 TraceCheckUtils]: 76: Hoare triple {55800#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55800#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:10,046 INFO L290 TraceCheckUtils]: 75: Hoare triple {55807#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55800#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:10,046 INFO L290 TraceCheckUtils]: 74: Hoare triple {55807#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55807#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:10,047 INFO L290 TraceCheckUtils]: 73: Hoare triple {55814#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55807#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:10,047 INFO L290 TraceCheckUtils]: 72: Hoare triple {55814#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55814#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:10,047 INFO L290 TraceCheckUtils]: 71: Hoare triple {55821#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55814#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:10,047 INFO L290 TraceCheckUtils]: 70: Hoare triple {55821#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55821#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:10,048 INFO L290 TraceCheckUtils]: 69: Hoare triple {55828#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55821#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:10,048 INFO L290 TraceCheckUtils]: 68: Hoare triple {55828#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55828#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:10,048 INFO L290 TraceCheckUtils]: 67: Hoare triple {55835#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55828#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:10,049 INFO L290 TraceCheckUtils]: 66: Hoare triple {55835#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55835#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:10,049 INFO L290 TraceCheckUtils]: 65: Hoare triple {55842#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55835#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:10,049 INFO L290 TraceCheckUtils]: 64: Hoare triple {55842#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55842#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:10,050 INFO L290 TraceCheckUtils]: 63: Hoare triple {55849#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55842#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:10,050 INFO L290 TraceCheckUtils]: 62: Hoare triple {55849#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55849#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:10,050 INFO L290 TraceCheckUtils]: 61: Hoare triple {55856#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55849#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:10,050 INFO L290 TraceCheckUtils]: 60: Hoare triple {55856#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55856#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:10,051 INFO L290 TraceCheckUtils]: 59: Hoare triple {55863#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55856#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:10,051 INFO L290 TraceCheckUtils]: 58: Hoare triple {55863#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55863#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:10,051 INFO L290 TraceCheckUtils]: 57: Hoare triple {55870#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55863#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:10,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {55870#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55870#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:10,052 INFO L290 TraceCheckUtils]: 55: Hoare triple {55877#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55870#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:10,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {55877#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55877#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:10,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {55884#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55877#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:10,053 INFO L290 TraceCheckUtils]: 52: Hoare triple {55884#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55884#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:10,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {55891#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55884#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:10,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {55891#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55891#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:10,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {55898#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55891#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:10,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {55898#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55898#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:10,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {55905#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55898#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:10,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {55905#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55905#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:10,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {55912#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55905#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:10,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {55912#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55912#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:10,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {55919#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55912#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:10,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {55919#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55919#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:10,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {55926#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55919#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:10,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {55926#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55926#(< main_~i~0 999)} is VALID [2022-04-15 12:19:10,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {55933#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55926#(< main_~i~0 999)} is VALID [2022-04-15 12:19:10,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {55933#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55933#(< main_~i~0 998)} is VALID [2022-04-15 12:19:10,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {55940#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55933#(< main_~i~0 998)} is VALID [2022-04-15 12:19:10,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {55940#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55940#(< main_~i~0 997)} is VALID [2022-04-15 12:19:10,058 INFO L290 TraceCheckUtils]: 35: Hoare triple {55947#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55940#(< main_~i~0 997)} is VALID [2022-04-15 12:19:10,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {55947#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55947#(< main_~i~0 996)} is VALID [2022-04-15 12:19:10,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {55954#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55947#(< main_~i~0 996)} is VALID [2022-04-15 12:19:10,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {55954#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55954#(< main_~i~0 995)} is VALID [2022-04-15 12:19:10,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {55961#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55954#(< main_~i~0 995)} is VALID [2022-04-15 12:19:10,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {55961#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55961#(< main_~i~0 994)} is VALID [2022-04-15 12:19:10,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {55968#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55961#(< main_~i~0 994)} is VALID [2022-04-15 12:19:10,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {55968#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55968#(< main_~i~0 993)} is VALID [2022-04-15 12:19:10,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {55975#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55968#(< main_~i~0 993)} is VALID [2022-04-15 12:19:10,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {55975#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55975#(< main_~i~0 992)} is VALID [2022-04-15 12:19:10,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {55982#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55975#(< main_~i~0 992)} is VALID [2022-04-15 12:19:10,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {55982#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55982#(< main_~i~0 991)} is VALID [2022-04-15 12:19:10,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {55989#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55982#(< main_~i~0 991)} is VALID [2022-04-15 12:19:10,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {55989#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55989#(< main_~i~0 990)} is VALID [2022-04-15 12:19:10,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {55996#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55989#(< main_~i~0 990)} is VALID [2022-04-15 12:19:10,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {55996#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55996#(< main_~i~0 989)} is VALID [2022-04-15 12:19:10,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {56003#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55996#(< main_~i~0 989)} is VALID [2022-04-15 12:19:10,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {56003#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56003#(< main_~i~0 988)} is VALID [2022-04-15 12:19:10,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {56010#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56003#(< main_~i~0 988)} is VALID [2022-04-15 12:19:10,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {56010#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56010#(< main_~i~0 987)} is VALID [2022-04-15 12:19:10,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {56017#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56010#(< main_~i~0 987)} is VALID [2022-04-15 12:19:10,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {56017#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56017#(< main_~i~0 986)} is VALID [2022-04-15 12:19:10,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {56024#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56017#(< main_~i~0 986)} is VALID [2022-04-15 12:19:10,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {56024#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56024#(< main_~i~0 985)} is VALID [2022-04-15 12:19:10,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {56031#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56024#(< main_~i~0 985)} is VALID [2022-04-15 12:19:10,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {56031#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56031#(< main_~i~0 984)} is VALID [2022-04-15 12:19:10,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {56038#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56031#(< main_~i~0 984)} is VALID [2022-04-15 12:19:10,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {56038#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56038#(< main_~i~0 983)} is VALID [2022-04-15 12:19:10,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {56045#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56038#(< main_~i~0 983)} is VALID [2022-04-15 12:19:10,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {56045#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56045#(< main_~i~0 982)} is VALID [2022-04-15 12:19:10,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {55335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {56045#(< main_~i~0 982)} is VALID [2022-04-15 12:19:10,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {55335#true} call #t~ret6 := main(); {55335#true} is VALID [2022-04-15 12:19:10,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55335#true} {55335#true} #64#return; {55335#true} is VALID [2022-04-15 12:19:10,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {55335#true} assume true; {55335#true} is VALID [2022-04-15 12:19:10,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {55335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {55335#true} is VALID [2022-04-15 12:19:10,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {55335#true} call ULTIMATE.init(); {55335#true} is VALID [2022-04-15 12:19:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:19:10,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35527929] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:10,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:10,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 90 [2022-04-15 12:19:10,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:10,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [107452906] [2022-04-15 12:19:10,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [107452906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:10,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:10,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 12:19:10,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700214750] [2022-04-15 12:19:10,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:10,068 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2022-04-15 12:19:10,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:10,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:10,186 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:19:10,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 12:19:10,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:10,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 12:19:10,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2022-04-15 12:19:10,187 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:16,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:16,956 INFO L93 Difference]: Finished difference Result 334 states and 424 transitions. [2022-04-15 12:19:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 12:19:16,956 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2022-04-15 12:19:16,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 415 transitions. [2022-04-15 12:19:16,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 415 transitions. [2022-04-15 12:19:16,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 415 transitions. [2022-04-15 12:19:17,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:17,227 INFO L225 Difference]: With dead ends: 334 [2022-04-15 12:19:17,227 INFO L226 Difference]: Without dead ends: 317 [2022-04-15 12:19:17,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=7746, Invalid=9810, Unknown=0, NotChecked=0, Total=17556 [2022-04-15 12:19:17,228 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1062 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:17,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1062 Valid, 27 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:19:17,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-04-15 12:19:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 110. [2022-04-15 12:19:17,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:17,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 317 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:17,717 INFO L74 IsIncluded]: Start isIncluded. First operand 317 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:17,717 INFO L87 Difference]: Start difference. First operand 317 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:17,721 INFO L93 Difference]: Finished difference Result 317 states and 403 transitions. [2022-04-15 12:19:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 403 transitions. [2022-04-15 12:19:17,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:17,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:17,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 317 states. [2022-04-15 12:19:17,722 INFO L87 Difference]: Start difference. First operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 317 states. [2022-04-15 12:19:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:17,725 INFO L93 Difference]: Finished difference Result 317 states and 403 transitions. [2022-04-15 12:19:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 403 transitions. [2022-04-15 12:19:17,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:17,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:17,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:17,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2022-04-15 12:19:17,727 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 107 [2022-04-15 12:19:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:17,727 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2022-04-15 12:19:17,727 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:17,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 114 transitions. [2022-04-15 12:19:17,952 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:19:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2022-04-15 12:19:17,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-15 12:19:17,952 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:17,952 INFO L499 BasicCegarLoop]: trace histogram [43, 43, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:17,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-04-15 12:19:18,153 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:18,153 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:18,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash 980755399, now seen corresponding path program 87 times [2022-04-15 12:19:18,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:18,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046723873] [2022-04-15 12:19:18,158 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:18,158 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:18,158 INFO L85 PathProgramCache]: Analyzing trace with hash 980755399, now seen corresponding path program 88 times [2022-04-15 12:19:18,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:18,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328642239] [2022-04-15 12:19:18,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:18,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:18,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:18,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {57726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {57677#true} is VALID [2022-04-15 12:19:18,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {57677#true} assume true; {57677#true} is VALID [2022-04-15 12:19:18,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57677#true} {57677#true} #64#return; {57677#true} is VALID [2022-04-15 12:19:18,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {57677#true} call ULTIMATE.init(); {57726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:18,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {57726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {57677#true} is VALID [2022-04-15 12:19:18,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {57677#true} assume true; {57677#true} is VALID [2022-04-15 12:19:18,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57677#true} {57677#true} #64#return; {57677#true} is VALID [2022-04-15 12:19:18,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {57677#true} call #t~ret6 := main(); {57677#true} is VALID [2022-04-15 12:19:18,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {57677#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {57682#(= main_~i~0 0)} is VALID [2022-04-15 12:19:18,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {57682#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57682#(= main_~i~0 0)} is VALID [2022-04-15 12:19:18,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {57682#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57683#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:18,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {57683#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57683#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:18,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {57683#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57684#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:18,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {57684#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57684#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:18,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {57684#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57685#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:18,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {57685#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57685#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:18,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {57685#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57686#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:18,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {57686#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57686#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:18,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {57686#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57687#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:18,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {57687#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57687#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:18,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {57687#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57688#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:18,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {57688#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57688#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:18,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {57688#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57689#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:18,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {57689#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57689#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:18,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {57689#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57690#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:18,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {57690#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57690#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:18,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {57690#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57691#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:18,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {57691#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57691#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:18,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {57691#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57692#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:18,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {57692#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57692#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:18,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {57692#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57693#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:18,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {57693#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57693#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:18,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {57693#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57694#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:18,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {57694#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57694#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:18,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {57694#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57695#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:18,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {57695#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57695#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:18,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {57695#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57696#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:18,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {57696#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57696#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:18,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {57696#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57697#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:18,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {57697#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57697#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:18,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {57697#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57698#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:18,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {57698#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57698#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:18,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {57698#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57699#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:18,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {57699#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57699#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:18,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {57699#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57700#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:18,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {57700#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57700#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:18,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {57700#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57701#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:18,897 INFO L290 TraceCheckUtils]: 44: Hoare triple {57701#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57701#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:18,898 INFO L290 TraceCheckUtils]: 45: Hoare triple {57701#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57702#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:18,898 INFO L290 TraceCheckUtils]: 46: Hoare triple {57702#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57702#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:18,898 INFO L290 TraceCheckUtils]: 47: Hoare triple {57702#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57703#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:18,899 INFO L290 TraceCheckUtils]: 48: Hoare triple {57703#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57703#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:18,899 INFO L290 TraceCheckUtils]: 49: Hoare triple {57703#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57704#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:18,899 INFO L290 TraceCheckUtils]: 50: Hoare triple {57704#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57704#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:18,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {57704#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57705#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:18,900 INFO L290 TraceCheckUtils]: 52: Hoare triple {57705#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57705#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:18,900 INFO L290 TraceCheckUtils]: 53: Hoare triple {57705#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57706#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:18,900 INFO L290 TraceCheckUtils]: 54: Hoare triple {57706#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57706#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:18,901 INFO L290 TraceCheckUtils]: 55: Hoare triple {57706#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57707#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:18,901 INFO L290 TraceCheckUtils]: 56: Hoare triple {57707#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57707#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:18,901 INFO L290 TraceCheckUtils]: 57: Hoare triple {57707#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57708#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:18,901 INFO L290 TraceCheckUtils]: 58: Hoare triple {57708#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57708#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:18,902 INFO L290 TraceCheckUtils]: 59: Hoare triple {57708#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57709#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:18,902 INFO L290 TraceCheckUtils]: 60: Hoare triple {57709#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57709#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:18,902 INFO L290 TraceCheckUtils]: 61: Hoare triple {57709#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57710#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:18,902 INFO L290 TraceCheckUtils]: 62: Hoare triple {57710#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57710#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:18,903 INFO L290 TraceCheckUtils]: 63: Hoare triple {57710#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57711#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:18,903 INFO L290 TraceCheckUtils]: 64: Hoare triple {57711#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57711#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:18,903 INFO L290 TraceCheckUtils]: 65: Hoare triple {57711#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57712#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:18,904 INFO L290 TraceCheckUtils]: 66: Hoare triple {57712#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57712#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:18,904 INFO L290 TraceCheckUtils]: 67: Hoare triple {57712#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57713#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:18,904 INFO L290 TraceCheckUtils]: 68: Hoare triple {57713#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57713#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:18,904 INFO L290 TraceCheckUtils]: 69: Hoare triple {57713#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57714#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:18,905 INFO L290 TraceCheckUtils]: 70: Hoare triple {57714#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57714#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:18,905 INFO L290 TraceCheckUtils]: 71: Hoare triple {57714#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57715#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:18,905 INFO L290 TraceCheckUtils]: 72: Hoare triple {57715#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57715#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:18,905 INFO L290 TraceCheckUtils]: 73: Hoare triple {57715#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57716#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:18,906 INFO L290 TraceCheckUtils]: 74: Hoare triple {57716#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57716#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:18,906 INFO L290 TraceCheckUtils]: 75: Hoare triple {57716#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57717#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:18,906 INFO L290 TraceCheckUtils]: 76: Hoare triple {57717#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57717#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:18,907 INFO L290 TraceCheckUtils]: 77: Hoare triple {57717#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57718#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:18,907 INFO L290 TraceCheckUtils]: 78: Hoare triple {57718#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57718#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:18,907 INFO L290 TraceCheckUtils]: 79: Hoare triple {57718#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57719#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:18,907 INFO L290 TraceCheckUtils]: 80: Hoare triple {57719#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57719#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:18,908 INFO L290 TraceCheckUtils]: 81: Hoare triple {57719#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57720#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:18,908 INFO L290 TraceCheckUtils]: 82: Hoare triple {57720#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57720#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:18,908 INFO L290 TraceCheckUtils]: 83: Hoare triple {57720#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57721#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:18,908 INFO L290 TraceCheckUtils]: 84: Hoare triple {57721#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57721#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:18,909 INFO L290 TraceCheckUtils]: 85: Hoare triple {57721#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57722#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:18,909 INFO L290 TraceCheckUtils]: 86: Hoare triple {57722#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57722#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:18,909 INFO L290 TraceCheckUtils]: 87: Hoare triple {57722#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57723#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:18,910 INFO L290 TraceCheckUtils]: 88: Hoare triple {57723#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57723#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:18,910 INFO L290 TraceCheckUtils]: 89: Hoare triple {57723#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57724#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:18,910 INFO L290 TraceCheckUtils]: 90: Hoare triple {57724#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57724#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:18,910 INFO L290 TraceCheckUtils]: 91: Hoare triple {57724#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57725#(<= main_~i~0 43)} is VALID [2022-04-15 12:19:18,911 INFO L290 TraceCheckUtils]: 92: Hoare triple {57725#(<= main_~i~0 43)} assume !(~i~0 < 1024); {57678#false} is VALID [2022-04-15 12:19:18,911 INFO L290 TraceCheckUtils]: 93: Hoare triple {57678#false} ~i~0 := 0; {57678#false} is VALID [2022-04-15 12:19:18,911 INFO L290 TraceCheckUtils]: 94: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 12:19:18,911 INFO L290 TraceCheckUtils]: 95: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 12:19:18,911 INFO L290 TraceCheckUtils]: 96: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 12:19:18,911 INFO L290 TraceCheckUtils]: 97: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-15 12:19:18,911 INFO L290 TraceCheckUtils]: 98: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 12:19:18,911 INFO L290 TraceCheckUtils]: 99: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 12:19:18,911 INFO L290 TraceCheckUtils]: 100: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 12:19:18,911 INFO L290 TraceCheckUtils]: 101: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-15 12:19:18,911 INFO L290 TraceCheckUtils]: 102: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 12:19:18,911 INFO L290 TraceCheckUtils]: 103: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 12:19:18,911 INFO L290 TraceCheckUtils]: 104: Hoare triple {57678#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 12:19:18,911 INFO L272 TraceCheckUtils]: 105: Hoare triple {57678#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {57678#false} is VALID [2022-04-15 12:19:18,912 INFO L290 TraceCheckUtils]: 106: Hoare triple {57678#false} ~cond := #in~cond; {57678#false} is VALID [2022-04-15 12:19:18,912 INFO L290 TraceCheckUtils]: 107: Hoare triple {57678#false} assume 0 == ~cond; {57678#false} is VALID [2022-04-15 12:19:18,912 INFO L290 TraceCheckUtils]: 108: Hoare triple {57678#false} assume !false; {57678#false} is VALID [2022-04-15 12:19:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:19:18,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:18,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328642239] [2022-04-15 12:19:18,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328642239] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:18,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441280459] [2022-04-15 12:19:18,912 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:19:18,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:18,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:18,915 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:18,917 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:19,169 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:19:19,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:19,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 12:19:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:19,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:19,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {57677#true} call ULTIMATE.init(); {57677#true} is VALID [2022-04-15 12:19:19,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {57677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {57677#true} is VALID [2022-04-15 12:19:19,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {57677#true} assume true; {57677#true} is VALID [2022-04-15 12:19:19,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57677#true} {57677#true} #64#return; {57677#true} is VALID [2022-04-15 12:19:19,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {57677#true} call #t~ret6 := main(); {57677#true} is VALID [2022-04-15 12:19:19,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {57677#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {57745#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:19,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {57745#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57745#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:19,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {57745#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57683#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:19,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {57683#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57683#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:19,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {57683#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57684#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:19,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {57684#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57684#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:19,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {57684#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57685#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:19,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {57685#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57685#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:19,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {57685#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57686#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:19,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {57686#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57686#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:19,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {57686#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57687#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:19,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {57687#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57687#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:19,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {57687#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57688#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:19,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {57688#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57688#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:19,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {57688#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57689#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:19,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {57689#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57689#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:19,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {57689#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57690#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:19,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {57690#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57690#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:19,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {57690#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57691#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:19,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {57691#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57691#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:19,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {57691#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57692#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:19,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {57692#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57692#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:19,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {57692#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57693#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:19,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {57693#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57693#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:19,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {57693#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57694#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:19,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {57694#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57694#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:19,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {57694#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57695#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:19,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {57695#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57695#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:19,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {57695#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57696#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:19,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {57696#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57696#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:19,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {57696#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57697#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:19,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {57697#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57697#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:19,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {57697#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57698#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:19,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {57698#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57698#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:19,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {57698#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57699#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:19,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {57699#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57699#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:19,725 INFO L290 TraceCheckUtils]: 41: Hoare triple {57699#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57700#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:19,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {57700#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57700#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:19,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {57700#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57701#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:19,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {57701#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57701#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:19,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {57701#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57702#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:19,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {57702#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57702#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:19,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {57702#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57703#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:19,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {57703#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57703#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:19,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {57703#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57704#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:19,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {57704#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57704#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:19,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {57704#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57705#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:19,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {57705#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57705#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:19,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {57705#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57706#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:19,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {57706#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57706#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:19,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {57706#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57707#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:19,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {57707#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57707#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:19,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {57707#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57708#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:19,730 INFO L290 TraceCheckUtils]: 58: Hoare triple {57708#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57708#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:19,730 INFO L290 TraceCheckUtils]: 59: Hoare triple {57708#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57709#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:19,730 INFO L290 TraceCheckUtils]: 60: Hoare triple {57709#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57709#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:19,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {57709#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57710#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:19,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {57710#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57710#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:19,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {57710#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57711#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:19,731 INFO L290 TraceCheckUtils]: 64: Hoare triple {57711#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57711#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:19,732 INFO L290 TraceCheckUtils]: 65: Hoare triple {57711#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57712#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:19,732 INFO L290 TraceCheckUtils]: 66: Hoare triple {57712#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57712#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:19,732 INFO L290 TraceCheckUtils]: 67: Hoare triple {57712#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57713#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:19,732 INFO L290 TraceCheckUtils]: 68: Hoare triple {57713#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57713#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:19,733 INFO L290 TraceCheckUtils]: 69: Hoare triple {57713#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57714#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:19,733 INFO L290 TraceCheckUtils]: 70: Hoare triple {57714#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57714#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:19,733 INFO L290 TraceCheckUtils]: 71: Hoare triple {57714#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57715#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:19,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {57715#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57715#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:19,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {57715#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57716#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:19,734 INFO L290 TraceCheckUtils]: 74: Hoare triple {57716#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57716#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:19,734 INFO L290 TraceCheckUtils]: 75: Hoare triple {57716#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57717#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:19,735 INFO L290 TraceCheckUtils]: 76: Hoare triple {57717#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57717#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:19,735 INFO L290 TraceCheckUtils]: 77: Hoare triple {57717#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57718#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:19,735 INFO L290 TraceCheckUtils]: 78: Hoare triple {57718#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57718#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:19,736 INFO L290 TraceCheckUtils]: 79: Hoare triple {57718#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57719#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:19,736 INFO L290 TraceCheckUtils]: 80: Hoare triple {57719#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57719#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:19,736 INFO L290 TraceCheckUtils]: 81: Hoare triple {57719#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57720#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:19,736 INFO L290 TraceCheckUtils]: 82: Hoare triple {57720#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57720#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:19,737 INFO L290 TraceCheckUtils]: 83: Hoare triple {57720#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57721#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:19,737 INFO L290 TraceCheckUtils]: 84: Hoare triple {57721#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57721#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:19,737 INFO L290 TraceCheckUtils]: 85: Hoare triple {57721#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57722#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:19,737 INFO L290 TraceCheckUtils]: 86: Hoare triple {57722#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57722#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:19,738 INFO L290 TraceCheckUtils]: 87: Hoare triple {57722#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57723#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:19,738 INFO L290 TraceCheckUtils]: 88: Hoare triple {57723#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57723#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:19,738 INFO L290 TraceCheckUtils]: 89: Hoare triple {57723#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57724#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:19,739 INFO L290 TraceCheckUtils]: 90: Hoare triple {57724#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57724#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:19,739 INFO L290 TraceCheckUtils]: 91: Hoare triple {57724#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57725#(<= main_~i~0 43)} is VALID [2022-04-15 12:19:19,739 INFO L290 TraceCheckUtils]: 92: Hoare triple {57725#(<= main_~i~0 43)} assume !(~i~0 < 1024); {57678#false} is VALID [2022-04-15 12:19:19,739 INFO L290 TraceCheckUtils]: 93: Hoare triple {57678#false} ~i~0 := 0; {57678#false} is VALID [2022-04-15 12:19:19,739 INFO L290 TraceCheckUtils]: 94: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 12:19:19,739 INFO L290 TraceCheckUtils]: 95: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 12:19:19,739 INFO L290 TraceCheckUtils]: 96: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 12:19:19,739 INFO L290 TraceCheckUtils]: 97: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-15 12:19:19,740 INFO L290 TraceCheckUtils]: 98: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 12:19:19,740 INFO L290 TraceCheckUtils]: 99: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 12:19:19,740 INFO L290 TraceCheckUtils]: 100: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 12:19:19,740 INFO L290 TraceCheckUtils]: 101: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-15 12:19:19,740 INFO L290 TraceCheckUtils]: 102: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 12:19:19,740 INFO L290 TraceCheckUtils]: 103: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 12:19:19,740 INFO L290 TraceCheckUtils]: 104: Hoare triple {57678#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 12:19:19,740 INFO L272 TraceCheckUtils]: 105: Hoare triple {57678#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {57678#false} is VALID [2022-04-15 12:19:19,740 INFO L290 TraceCheckUtils]: 106: Hoare triple {57678#false} ~cond := #in~cond; {57678#false} is VALID [2022-04-15 12:19:19,740 INFO L290 TraceCheckUtils]: 107: Hoare triple {57678#false} assume 0 == ~cond; {57678#false} is VALID [2022-04-15 12:19:19,740 INFO L290 TraceCheckUtils]: 108: Hoare triple {57678#false} assume !false; {57678#false} is VALID [2022-04-15 12:19:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:19:19,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:21,852 INFO L290 TraceCheckUtils]: 108: Hoare triple {57678#false} assume !false; {57678#false} is VALID [2022-04-15 12:19:21,852 INFO L290 TraceCheckUtils]: 107: Hoare triple {57678#false} assume 0 == ~cond; {57678#false} is VALID [2022-04-15 12:19:21,852 INFO L290 TraceCheckUtils]: 106: Hoare triple {57678#false} ~cond := #in~cond; {57678#false} is VALID [2022-04-15 12:19:21,852 INFO L272 TraceCheckUtils]: 105: Hoare triple {57678#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {57678#false} is VALID [2022-04-15 12:19:21,852 INFO L290 TraceCheckUtils]: 104: Hoare triple {57678#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 12:19:21,852 INFO L290 TraceCheckUtils]: 103: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 12:19:21,852 INFO L290 TraceCheckUtils]: 102: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 12:19:21,852 INFO L290 TraceCheckUtils]: 101: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-15 12:19:21,852 INFO L290 TraceCheckUtils]: 100: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 12:19:21,852 INFO L290 TraceCheckUtils]: 99: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 12:19:21,852 INFO L290 TraceCheckUtils]: 98: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 12:19:21,852 INFO L290 TraceCheckUtils]: 97: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-15 12:19:21,852 INFO L290 TraceCheckUtils]: 96: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 12:19:21,853 INFO L290 TraceCheckUtils]: 95: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 12:19:21,853 INFO L290 TraceCheckUtils]: 94: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 12:19:21,853 INFO L290 TraceCheckUtils]: 93: Hoare triple {57678#false} ~i~0 := 0; {57678#false} is VALID [2022-04-15 12:19:21,853 INFO L290 TraceCheckUtils]: 92: Hoare triple {58103#(< main_~i~0 1024)} assume !(~i~0 < 1024); {57678#false} is VALID [2022-04-15 12:19:21,853 INFO L290 TraceCheckUtils]: 91: Hoare triple {58107#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58103#(< main_~i~0 1024)} is VALID [2022-04-15 12:19:21,854 INFO L290 TraceCheckUtils]: 90: Hoare triple {58107#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58107#(< main_~i~0 1023)} is VALID [2022-04-15 12:19:21,854 INFO L290 TraceCheckUtils]: 89: Hoare triple {58114#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58107#(< main_~i~0 1023)} is VALID [2022-04-15 12:19:21,854 INFO L290 TraceCheckUtils]: 88: Hoare triple {58114#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58114#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:21,854 INFO L290 TraceCheckUtils]: 87: Hoare triple {58121#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58114#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:21,855 INFO L290 TraceCheckUtils]: 86: Hoare triple {58121#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58121#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:21,855 INFO L290 TraceCheckUtils]: 85: Hoare triple {58128#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58121#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:21,855 INFO L290 TraceCheckUtils]: 84: Hoare triple {58128#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58128#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:21,856 INFO L290 TraceCheckUtils]: 83: Hoare triple {58135#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58128#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:21,856 INFO L290 TraceCheckUtils]: 82: Hoare triple {58135#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58135#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:21,856 INFO L290 TraceCheckUtils]: 81: Hoare triple {58142#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58135#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:21,856 INFO L290 TraceCheckUtils]: 80: Hoare triple {58142#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58142#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:21,857 INFO L290 TraceCheckUtils]: 79: Hoare triple {58149#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58142#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:21,857 INFO L290 TraceCheckUtils]: 78: Hoare triple {58149#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58149#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:21,857 INFO L290 TraceCheckUtils]: 77: Hoare triple {58156#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58149#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:21,857 INFO L290 TraceCheckUtils]: 76: Hoare triple {58156#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58156#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:21,858 INFO L290 TraceCheckUtils]: 75: Hoare triple {58163#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58156#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:21,858 INFO L290 TraceCheckUtils]: 74: Hoare triple {58163#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58163#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:21,858 INFO L290 TraceCheckUtils]: 73: Hoare triple {58170#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58163#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:21,859 INFO L290 TraceCheckUtils]: 72: Hoare triple {58170#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58170#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:21,859 INFO L290 TraceCheckUtils]: 71: Hoare triple {58177#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58170#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:21,859 INFO L290 TraceCheckUtils]: 70: Hoare triple {58177#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58177#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:21,859 INFO L290 TraceCheckUtils]: 69: Hoare triple {58184#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58177#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:21,860 INFO L290 TraceCheckUtils]: 68: Hoare triple {58184#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58184#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:21,860 INFO L290 TraceCheckUtils]: 67: Hoare triple {58191#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58184#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:21,860 INFO L290 TraceCheckUtils]: 66: Hoare triple {58191#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58191#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:21,861 INFO L290 TraceCheckUtils]: 65: Hoare triple {58198#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58191#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:21,861 INFO L290 TraceCheckUtils]: 64: Hoare triple {58198#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58198#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:21,861 INFO L290 TraceCheckUtils]: 63: Hoare triple {58205#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58198#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:21,861 INFO L290 TraceCheckUtils]: 62: Hoare triple {58205#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58205#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:21,862 INFO L290 TraceCheckUtils]: 61: Hoare triple {58212#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58205#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:21,862 INFO L290 TraceCheckUtils]: 60: Hoare triple {58212#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58212#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:21,862 INFO L290 TraceCheckUtils]: 59: Hoare triple {58219#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58212#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:21,862 INFO L290 TraceCheckUtils]: 58: Hoare triple {58219#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58219#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:21,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {58226#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58219#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:21,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {58226#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58226#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:21,863 INFO L290 TraceCheckUtils]: 55: Hoare triple {58233#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58226#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:21,864 INFO L290 TraceCheckUtils]: 54: Hoare triple {58233#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58233#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:21,864 INFO L290 TraceCheckUtils]: 53: Hoare triple {58240#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58233#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:21,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {58240#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58240#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:21,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {58247#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58240#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:21,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {58247#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58247#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:21,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {58254#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58247#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:21,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {58254#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58254#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:21,866 INFO L290 TraceCheckUtils]: 47: Hoare triple {58261#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58254#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:21,866 INFO L290 TraceCheckUtils]: 46: Hoare triple {58261#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58261#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:21,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {58268#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58261#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:21,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {58268#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58268#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:21,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {58275#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58268#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:21,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {58275#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58275#(< main_~i~0 999)} is VALID [2022-04-15 12:19:21,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {58282#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58275#(< main_~i~0 999)} is VALID [2022-04-15 12:19:21,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {58282#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58282#(< main_~i~0 998)} is VALID [2022-04-15 12:19:21,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {58289#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58282#(< main_~i~0 998)} is VALID [2022-04-15 12:19:21,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {58289#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58289#(< main_~i~0 997)} is VALID [2022-04-15 12:19:21,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {58296#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58289#(< main_~i~0 997)} is VALID [2022-04-15 12:19:21,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {58296#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58296#(< main_~i~0 996)} is VALID [2022-04-15 12:19:21,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {58303#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58296#(< main_~i~0 996)} is VALID [2022-04-15 12:19:21,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {58303#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58303#(< main_~i~0 995)} is VALID [2022-04-15 12:19:21,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {58310#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58303#(< main_~i~0 995)} is VALID [2022-04-15 12:19:21,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {58310#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58310#(< main_~i~0 994)} is VALID [2022-04-15 12:19:21,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {58317#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58310#(< main_~i~0 994)} is VALID [2022-04-15 12:19:21,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {58317#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58317#(< main_~i~0 993)} is VALID [2022-04-15 12:19:21,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {58324#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58317#(< main_~i~0 993)} is VALID [2022-04-15 12:19:21,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {58324#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58324#(< main_~i~0 992)} is VALID [2022-04-15 12:19:21,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {58331#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58324#(< main_~i~0 992)} is VALID [2022-04-15 12:19:21,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {58331#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58331#(< main_~i~0 991)} is VALID [2022-04-15 12:19:21,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {58338#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58331#(< main_~i~0 991)} is VALID [2022-04-15 12:19:21,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {58338#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58338#(< main_~i~0 990)} is VALID [2022-04-15 12:19:21,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {58345#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58338#(< main_~i~0 990)} is VALID [2022-04-15 12:19:21,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {58345#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58345#(< main_~i~0 989)} is VALID [2022-04-15 12:19:21,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {58352#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58345#(< main_~i~0 989)} is VALID [2022-04-15 12:19:21,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {58352#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58352#(< main_~i~0 988)} is VALID [2022-04-15 12:19:21,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {58359#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58352#(< main_~i~0 988)} is VALID [2022-04-15 12:19:21,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {58359#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58359#(< main_~i~0 987)} is VALID [2022-04-15 12:19:21,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {58366#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58359#(< main_~i~0 987)} is VALID [2022-04-15 12:19:21,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {58366#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58366#(< main_~i~0 986)} is VALID [2022-04-15 12:19:21,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {58373#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58366#(< main_~i~0 986)} is VALID [2022-04-15 12:19:21,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {58373#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58373#(< main_~i~0 985)} is VALID [2022-04-15 12:19:21,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {58380#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58373#(< main_~i~0 985)} is VALID [2022-04-15 12:19:21,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {58380#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58380#(< main_~i~0 984)} is VALID [2022-04-15 12:19:21,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {58387#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58380#(< main_~i~0 984)} is VALID [2022-04-15 12:19:21,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {58387#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58387#(< main_~i~0 983)} is VALID [2022-04-15 12:19:21,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {58394#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58387#(< main_~i~0 983)} is VALID [2022-04-15 12:19:21,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {58394#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58394#(< main_~i~0 982)} is VALID [2022-04-15 12:19:21,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {58401#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58394#(< main_~i~0 982)} is VALID [2022-04-15 12:19:21,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {58401#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58401#(< main_~i~0 981)} is VALID [2022-04-15 12:19:21,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {57677#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {58401#(< main_~i~0 981)} is VALID [2022-04-15 12:19:21,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {57677#true} call #t~ret6 := main(); {57677#true} is VALID [2022-04-15 12:19:21,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57677#true} {57677#true} #64#return; {57677#true} is VALID [2022-04-15 12:19:21,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {57677#true} assume true; {57677#true} is VALID [2022-04-15 12:19:21,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {57677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {57677#true} is VALID [2022-04-15 12:19:21,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {57677#true} call ULTIMATE.init(); {57677#true} is VALID [2022-04-15 12:19:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:19:21,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441280459] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:21,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:21,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-15 12:19:21,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:21,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046723873] [2022-04-15 12:19:21,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046723873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:21,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:21,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 12:19:21,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478089129] [2022-04-15 12:19:21,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:21,879 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-04-15 12:19:21,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:21,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:21,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:21,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 12:19:21,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:21,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 12:19:21,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2022-04-15 12:19:21,941 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:29,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:29,261 INFO L93 Difference]: Finished difference Result 341 states and 433 transitions. [2022-04-15 12:19:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 12:19:29,261 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-04-15 12:19:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:29,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 424 transitions. [2022-04-15 12:19:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 424 transitions. [2022-04-15 12:19:29,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 424 transitions. [2022-04-15 12:19:29,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 424 edges. 424 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:29,550 INFO L225 Difference]: With dead ends: 341 [2022-04-15 12:19:29,551 INFO L226 Difference]: Without dead ends: 324 [2022-04-15 12:19:29,552 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=8102, Invalid=10258, Unknown=0, NotChecked=0, Total=18360 [2022-04-15 12:19:29,552 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1156 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:29,552 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1156 Valid, 32 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:19:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-04-15 12:19:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 112. [2022-04-15 12:19:30,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:30,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 324 states. Second operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:30,078 INFO L74 IsIncluded]: Start isIncluded. First operand 324 states. Second operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:30,078 INFO L87 Difference]: Start difference. First operand 324 states. Second operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:30,082 INFO L93 Difference]: Finished difference Result 324 states and 412 transitions. [2022-04-15 12:19:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 412 transitions. [2022-04-15 12:19:30,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:30,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:30,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 324 states. [2022-04-15 12:19:30,083 INFO L87 Difference]: Start difference. First operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 324 states. [2022-04-15 12:19:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:30,087 INFO L93 Difference]: Finished difference Result 324 states and 412 transitions. [2022-04-15 12:19:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 412 transitions. [2022-04-15 12:19:30,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:30,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:30,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:30,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2022-04-15 12:19:30,088 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 109 [2022-04-15 12:19:30,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:30,088 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2022-04-15 12:19:30,088 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:30,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 116 transitions. [2022-04-15 12:19:30,325 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:19:30,325 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2022-04-15 12:19:30,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 12:19:30,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:30,326 INFO L499 BasicCegarLoop]: trace histogram [44, 44, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:30,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-04-15 12:19:30,526 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:19:30,526 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:30,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1293149541, now seen corresponding path program 89 times [2022-04-15 12:19:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:30,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1913587139] [2022-04-15 12:19:30,531 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:30,531 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:30,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1293149541, now seen corresponding path program 90 times [2022-04-15 12:19:30,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:30,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534814242] [2022-04-15 12:19:30,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:30,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:31,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:31,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {60117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {60067#true} is VALID [2022-04-15 12:19:31,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {60067#true} assume true; {60067#true} is VALID [2022-04-15 12:19:31,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60067#true} {60067#true} #64#return; {60067#true} is VALID [2022-04-15 12:19:31,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {60067#true} call ULTIMATE.init(); {60117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:31,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {60117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {60067#true} is VALID [2022-04-15 12:19:31,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {60067#true} assume true; {60067#true} is VALID [2022-04-15 12:19:31,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60067#true} {60067#true} #64#return; {60067#true} is VALID [2022-04-15 12:19:31,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {60067#true} call #t~ret6 := main(); {60067#true} is VALID [2022-04-15 12:19:31,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {60067#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {60072#(= main_~i~0 0)} is VALID [2022-04-15 12:19:31,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {60072#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60072#(= main_~i~0 0)} is VALID [2022-04-15 12:19:31,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {60072#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60073#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:31,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {60073#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60073#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:31,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {60073#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60074#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:31,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {60074#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60074#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:31,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {60074#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60075#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:31,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {60075#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60075#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:31,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {60075#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60076#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:31,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {60076#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60076#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:31,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {60076#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60077#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:31,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {60077#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60077#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:31,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {60077#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60078#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:31,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {60078#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60078#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:31,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {60078#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60079#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:31,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {60079#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60079#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:31,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {60079#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60080#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:31,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {60080#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60080#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:31,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {60080#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60081#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:31,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {60081#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60081#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:31,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {60081#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60082#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:31,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {60082#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60082#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:31,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {60082#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60083#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:31,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {60083#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60083#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:31,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {60083#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60084#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:31,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {60084#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60084#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:31,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {60084#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60085#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:31,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {60085#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60085#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:31,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {60085#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60086#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:31,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {60086#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60086#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:31,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {60086#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60087#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:31,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {60087#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60087#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:31,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {60087#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60088#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:31,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {60088#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60088#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:31,243 INFO L290 TraceCheckUtils]: 39: Hoare triple {60088#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60089#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:31,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {60089#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60089#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:31,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {60089#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60090#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:31,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {60090#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60090#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:31,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {60090#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60091#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:31,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {60091#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60091#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:31,245 INFO L290 TraceCheckUtils]: 45: Hoare triple {60091#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60092#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:31,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {60092#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60092#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:31,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {60092#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60093#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:31,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {60093#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60093#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:31,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {60093#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60094#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:31,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {60094#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60094#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:31,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {60094#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60095#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:31,247 INFO L290 TraceCheckUtils]: 52: Hoare triple {60095#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60095#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:31,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {60095#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60096#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:31,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {60096#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60096#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:31,248 INFO L290 TraceCheckUtils]: 55: Hoare triple {60096#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60097#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:31,248 INFO L290 TraceCheckUtils]: 56: Hoare triple {60097#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60097#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:31,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {60097#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60098#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:31,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {60098#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60098#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:31,249 INFO L290 TraceCheckUtils]: 59: Hoare triple {60098#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60099#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:31,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {60099#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60099#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:31,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {60099#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60100#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:31,249 INFO L290 TraceCheckUtils]: 62: Hoare triple {60100#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60100#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:31,250 INFO L290 TraceCheckUtils]: 63: Hoare triple {60100#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60101#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:31,250 INFO L290 TraceCheckUtils]: 64: Hoare triple {60101#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60101#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:31,250 INFO L290 TraceCheckUtils]: 65: Hoare triple {60101#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60102#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:31,250 INFO L290 TraceCheckUtils]: 66: Hoare triple {60102#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60102#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:31,251 INFO L290 TraceCheckUtils]: 67: Hoare triple {60102#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60103#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:31,251 INFO L290 TraceCheckUtils]: 68: Hoare triple {60103#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60103#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:31,251 INFO L290 TraceCheckUtils]: 69: Hoare triple {60103#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60104#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:31,252 INFO L290 TraceCheckUtils]: 70: Hoare triple {60104#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60104#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:31,252 INFO L290 TraceCheckUtils]: 71: Hoare triple {60104#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60105#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:31,252 INFO L290 TraceCheckUtils]: 72: Hoare triple {60105#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60105#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:31,252 INFO L290 TraceCheckUtils]: 73: Hoare triple {60105#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60106#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:31,253 INFO L290 TraceCheckUtils]: 74: Hoare triple {60106#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60106#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:31,253 INFO L290 TraceCheckUtils]: 75: Hoare triple {60106#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60107#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:31,253 INFO L290 TraceCheckUtils]: 76: Hoare triple {60107#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60107#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:31,254 INFO L290 TraceCheckUtils]: 77: Hoare triple {60107#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60108#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:31,254 INFO L290 TraceCheckUtils]: 78: Hoare triple {60108#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60108#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:31,254 INFO L290 TraceCheckUtils]: 79: Hoare triple {60108#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60109#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:31,254 INFO L290 TraceCheckUtils]: 80: Hoare triple {60109#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60109#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:31,255 INFO L290 TraceCheckUtils]: 81: Hoare triple {60109#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60110#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:31,255 INFO L290 TraceCheckUtils]: 82: Hoare triple {60110#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60110#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:31,255 INFO L290 TraceCheckUtils]: 83: Hoare triple {60110#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60111#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:31,255 INFO L290 TraceCheckUtils]: 84: Hoare triple {60111#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60111#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:31,256 INFO L290 TraceCheckUtils]: 85: Hoare triple {60111#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60112#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:31,256 INFO L290 TraceCheckUtils]: 86: Hoare triple {60112#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60112#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:31,256 INFO L290 TraceCheckUtils]: 87: Hoare triple {60112#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60113#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:31,257 INFO L290 TraceCheckUtils]: 88: Hoare triple {60113#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60113#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:31,257 INFO L290 TraceCheckUtils]: 89: Hoare triple {60113#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60114#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:31,257 INFO L290 TraceCheckUtils]: 90: Hoare triple {60114#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60114#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:31,257 INFO L290 TraceCheckUtils]: 91: Hoare triple {60114#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60115#(<= main_~i~0 43)} is VALID [2022-04-15 12:19:31,258 INFO L290 TraceCheckUtils]: 92: Hoare triple {60115#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60115#(<= main_~i~0 43)} is VALID [2022-04-15 12:19:31,258 INFO L290 TraceCheckUtils]: 93: Hoare triple {60115#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60116#(<= main_~i~0 44)} is VALID [2022-04-15 12:19:31,258 INFO L290 TraceCheckUtils]: 94: Hoare triple {60116#(<= main_~i~0 44)} assume !(~i~0 < 1024); {60068#false} is VALID [2022-04-15 12:19:31,258 INFO L290 TraceCheckUtils]: 95: Hoare triple {60068#false} ~i~0 := 0; {60068#false} is VALID [2022-04-15 12:19:31,258 INFO L290 TraceCheckUtils]: 96: Hoare triple {60068#false} #t~short5 := ~i~0 < 1024; {60068#false} is VALID [2022-04-15 12:19:31,258 INFO L290 TraceCheckUtils]: 97: Hoare triple {60068#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60068#false} is VALID [2022-04-15 12:19:31,258 INFO L290 TraceCheckUtils]: 98: Hoare triple {60068#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60068#false} is VALID [2022-04-15 12:19:31,259 INFO L290 TraceCheckUtils]: 99: Hoare triple {60068#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60068#false} is VALID [2022-04-15 12:19:31,259 INFO L290 TraceCheckUtils]: 100: Hoare triple {60068#false} #t~short5 := ~i~0 < 1024; {60068#false} is VALID [2022-04-15 12:19:31,259 INFO L290 TraceCheckUtils]: 101: Hoare triple {60068#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60068#false} is VALID [2022-04-15 12:19:31,259 INFO L290 TraceCheckUtils]: 102: Hoare triple {60068#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60068#false} is VALID [2022-04-15 12:19:31,259 INFO L290 TraceCheckUtils]: 103: Hoare triple {60068#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60068#false} is VALID [2022-04-15 12:19:31,259 INFO L290 TraceCheckUtils]: 104: Hoare triple {60068#false} #t~short5 := ~i~0 < 1024; {60068#false} is VALID [2022-04-15 12:19:31,259 INFO L290 TraceCheckUtils]: 105: Hoare triple {60068#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60068#false} is VALID [2022-04-15 12:19:31,259 INFO L290 TraceCheckUtils]: 106: Hoare triple {60068#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {60068#false} is VALID [2022-04-15 12:19:31,259 INFO L272 TraceCheckUtils]: 107: Hoare triple {60068#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {60068#false} is VALID [2022-04-15 12:19:31,259 INFO L290 TraceCheckUtils]: 108: Hoare triple {60068#false} ~cond := #in~cond; {60068#false} is VALID [2022-04-15 12:19:31,259 INFO L290 TraceCheckUtils]: 109: Hoare triple {60068#false} assume 0 == ~cond; {60068#false} is VALID [2022-04-15 12:19:31,259 INFO L290 TraceCheckUtils]: 110: Hoare triple {60068#false} assume !false; {60068#false} is VALID [2022-04-15 12:19:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:19:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:31,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534814242] [2022-04-15 12:19:31,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534814242] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:31,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208208676] [2022-04-15 12:19:31,260 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:19:31,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:31,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:31,261 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:19:31,262 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:19:31,472 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:19:31,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:31,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:19:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:31,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:31,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {60067#true} call ULTIMATE.init(); {60067#true} is VALID [2022-04-15 12:19:31,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {60067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {60067#true} is VALID [2022-04-15 12:19:31,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {60067#true} assume true; {60067#true} is VALID [2022-04-15 12:19:31,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60067#true} {60067#true} #64#return; {60067#true} is VALID [2022-04-15 12:19:31,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {60067#true} call #t~ret6 := main(); {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {60067#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 41: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 44: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 51: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 52: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 54: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 55: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 58: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 59: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 60: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 61: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,733 INFO L290 TraceCheckUtils]: 63: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 64: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 65: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 66: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 67: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 74: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 75: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 76: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 77: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 78: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 79: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 80: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 81: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 82: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,734 INFO L290 TraceCheckUtils]: 83: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,735 INFO L290 TraceCheckUtils]: 84: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,735 INFO L290 TraceCheckUtils]: 85: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,735 INFO L290 TraceCheckUtils]: 86: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,735 INFO L290 TraceCheckUtils]: 87: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,735 INFO L290 TraceCheckUtils]: 88: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,735 INFO L290 TraceCheckUtils]: 89: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,735 INFO L290 TraceCheckUtils]: 90: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,735 INFO L290 TraceCheckUtils]: 91: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,735 INFO L290 TraceCheckUtils]: 92: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:31,735 INFO L290 TraceCheckUtils]: 93: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:31,735 INFO L290 TraceCheckUtils]: 94: Hoare triple {60067#true} assume !(~i~0 < 1024); {60067#true} is VALID [2022-04-15 12:19:31,735 INFO L290 TraceCheckUtils]: 95: Hoare triple {60067#true} ~i~0 := 0; {60406#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:31,736 INFO L290 TraceCheckUtils]: 96: Hoare triple {60406#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {60406#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:31,736 INFO L290 TraceCheckUtils]: 97: Hoare triple {60406#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60406#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:31,736 INFO L290 TraceCheckUtils]: 98: Hoare triple {60406#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60406#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:31,736 INFO L290 TraceCheckUtils]: 99: Hoare triple {60406#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60073#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:31,737 INFO L290 TraceCheckUtils]: 100: Hoare triple {60073#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {60073#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:31,737 INFO L290 TraceCheckUtils]: 101: Hoare triple {60073#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60073#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:31,737 INFO L290 TraceCheckUtils]: 102: Hoare triple {60073#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60073#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:31,737 INFO L290 TraceCheckUtils]: 103: Hoare triple {60073#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60074#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:31,738 INFO L290 TraceCheckUtils]: 104: Hoare triple {60074#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {60074#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:31,738 INFO L290 TraceCheckUtils]: 105: Hoare triple {60074#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60074#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:31,738 INFO L290 TraceCheckUtils]: 106: Hoare triple {60074#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {60074#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:31,739 INFO L272 TraceCheckUtils]: 107: Hoare triple {60074#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {60443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:31,739 INFO L290 TraceCheckUtils]: 108: Hoare triple {60443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {60447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:31,739 INFO L290 TraceCheckUtils]: 109: Hoare triple {60447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {60068#false} is VALID [2022-04-15 12:19:31,739 INFO L290 TraceCheckUtils]: 110: Hoare triple {60068#false} assume !false; {60068#false} is VALID [2022-04-15 12:19:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-04-15 12:19:31,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:32,006 INFO L290 TraceCheckUtils]: 110: Hoare triple {60068#false} assume !false; {60068#false} is VALID [2022-04-15 12:19:32,007 INFO L290 TraceCheckUtils]: 109: Hoare triple {60447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {60068#false} is VALID [2022-04-15 12:19:32,007 INFO L290 TraceCheckUtils]: 108: Hoare triple {60443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {60447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:32,007 INFO L272 TraceCheckUtils]: 107: Hoare triple {60463#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {60443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:32,008 INFO L290 TraceCheckUtils]: 106: Hoare triple {60463#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {60463#(<= main_~i~0 512)} is VALID [2022-04-15 12:19:32,008 INFO L290 TraceCheckUtils]: 105: Hoare triple {60463#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60463#(<= main_~i~0 512)} is VALID [2022-04-15 12:19:32,008 INFO L290 TraceCheckUtils]: 104: Hoare triple {60463#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {60463#(<= main_~i~0 512)} is VALID [2022-04-15 12:19:32,009 INFO L290 TraceCheckUtils]: 103: Hoare triple {60476#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60463#(<= main_~i~0 512)} is VALID [2022-04-15 12:19:32,009 INFO L290 TraceCheckUtils]: 102: Hoare triple {60476#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60476#(<= main_~i~0 511)} is VALID [2022-04-15 12:19:32,009 INFO L290 TraceCheckUtils]: 101: Hoare triple {60476#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60476#(<= main_~i~0 511)} is VALID [2022-04-15 12:19:32,009 INFO L290 TraceCheckUtils]: 100: Hoare triple {60476#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {60476#(<= main_~i~0 511)} is VALID [2022-04-15 12:19:32,010 INFO L290 TraceCheckUtils]: 99: Hoare triple {60489#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60476#(<= main_~i~0 511)} is VALID [2022-04-15 12:19:32,010 INFO L290 TraceCheckUtils]: 98: Hoare triple {60489#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60489#(<= main_~i~0 510)} is VALID [2022-04-15 12:19:32,010 INFO L290 TraceCheckUtils]: 97: Hoare triple {60489#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60489#(<= main_~i~0 510)} is VALID [2022-04-15 12:19:32,010 INFO L290 TraceCheckUtils]: 96: Hoare triple {60489#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {60489#(<= main_~i~0 510)} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 95: Hoare triple {60067#true} ~i~0 := 0; {60489#(<= main_~i~0 510)} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 94: Hoare triple {60067#true} assume !(~i~0 < 1024); {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 93: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 92: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 91: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 90: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 89: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 88: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 87: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 86: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 85: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 84: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 83: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 82: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 81: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 80: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 79: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 78: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,011 INFO L290 TraceCheckUtils]: 77: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 76: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 75: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 74: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 73: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 72: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 71: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 70: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 69: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 68: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 67: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 66: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 65: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 64: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 63: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 62: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 61: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 60: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,012 INFO L290 TraceCheckUtils]: 59: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 58: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 57: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 56: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 55: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 54: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 53: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 52: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 50: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 47: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 46: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,013 INFO L290 TraceCheckUtils]: 40: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 36: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {60067#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {60067#true} call #t~ret6 := main(); {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60067#true} {60067#true} #64#return; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {60067#true} assume true; {60067#true} is VALID [2022-04-15 12:19:32,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {60067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {60067#true} is VALID [2022-04-15 12:19:32,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {60067#true} call ULTIMATE.init(); {60067#true} is VALID [2022-04-15 12:19:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-04-15 12:19:32,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208208676] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:32,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:32,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 7, 7] total 54 [2022-04-15 12:19:32,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:32,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1913587139] [2022-04-15 12:19:32,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1913587139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:32,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:32,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 12:19:32,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267152422] [2022-04-15 12:19:32,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:32,017 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2022-04-15 12:19:32,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:32,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:32,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:32,077 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 12:19:32,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:32,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 12:19:32,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1281, Invalid=1581, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:19:32,078 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:39,371 INFO L93 Difference]: Finished difference Result 348 states and 442 transitions. [2022-04-15 12:19:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 12:19:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2022-04-15 12:19:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 433 transitions. [2022-04-15 12:19:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 433 transitions. [2022-04-15 12:19:39,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 433 transitions. [2022-04-15 12:19:39,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:39,662 INFO L225 Difference]: With dead ends: 348 [2022-04-15 12:19:39,662 INFO L226 Difference]: Without dead ends: 331 [2022-04-15 12:19:39,663 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3577, Invalid=6125, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 12:19:39,663 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1151 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:39,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1151 Valid, 42 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:19:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-15 12:19:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 114. [2022-04-15 12:19:40,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:40,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:40,175 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:40,175 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:40,179 INFO L93 Difference]: Finished difference Result 331 states and 421 transitions. [2022-04-15 12:19:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 421 transitions. [2022-04-15 12:19:40,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:40,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:40,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-15 12:19:40,179 INFO L87 Difference]: Start difference. First operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-15 12:19:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:40,183 INFO L93 Difference]: Finished difference Result 331 states and 421 transitions. [2022-04-15 12:19:40,183 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 421 transitions. [2022-04-15 12:19:40,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:40,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:40,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:40,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2022-04-15 12:19:40,185 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 111 [2022-04-15 12:19:40,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:40,185 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2022-04-15 12:19:40,185 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:40,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 118 transitions. [2022-04-15 12:19:40,425 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:19:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2022-04-15 12:19:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 12:19:40,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:40,426 INFO L499 BasicCegarLoop]: trace histogram [45, 45, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:40,444 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:19:40,637 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:19:40,638 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:40,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:40,638 INFO L85 PathProgramCache]: Analyzing trace with hash 856209283, now seen corresponding path program 91 times [2022-04-15 12:19:40,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:40,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [284566382] [2022-04-15 12:19:40,645 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:40,645 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:40,645 INFO L85 PathProgramCache]: Analyzing trace with hash 856209283, now seen corresponding path program 92 times [2022-04-15 12:19:40,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:40,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670614652] [2022-04-15 12:19:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:40,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:41,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:41,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {62516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {62465#true} is VALID [2022-04-15 12:19:41,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {62465#true} assume true; {62465#true} is VALID [2022-04-15 12:19:41,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62465#true} {62465#true} #64#return; {62465#true} is VALID [2022-04-15 12:19:41,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {62465#true} call ULTIMATE.init(); {62516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:41,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {62516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {62465#true} is VALID [2022-04-15 12:19:41,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {62465#true} assume true; {62465#true} is VALID [2022-04-15 12:19:41,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62465#true} {62465#true} #64#return; {62465#true} is VALID [2022-04-15 12:19:41,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {62465#true} call #t~ret6 := main(); {62465#true} is VALID [2022-04-15 12:19:41,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {62465#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {62470#(= main_~i~0 0)} is VALID [2022-04-15 12:19:41,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {62470#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62470#(= main_~i~0 0)} is VALID [2022-04-15 12:19:41,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {62470#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62471#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:41,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {62471#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62471#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:41,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {62471#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62472#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:41,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {62472#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62472#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:41,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {62472#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62473#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:41,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {62473#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62473#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:41,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {62473#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62474#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:41,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {62474#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62474#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:41,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {62474#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62475#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:41,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {62475#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62475#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:41,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {62475#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62476#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:41,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {62476#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62476#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:41,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {62476#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62477#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:41,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {62477#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62477#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:41,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {62477#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62478#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:41,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {62478#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62478#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:41,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {62478#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62479#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:41,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {62479#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62479#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:41,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {62479#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62480#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:41,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {62480#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62480#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:41,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {62480#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62481#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:41,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {62481#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62481#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:41,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {62481#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62482#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:41,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {62482#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62482#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:41,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {62482#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62483#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:41,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {62483#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62483#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:41,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {62483#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62484#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:41,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {62484#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62484#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:41,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {62484#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62485#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:41,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {62485#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62485#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:41,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {62485#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62486#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:41,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {62486#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62486#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:41,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {62486#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62487#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:41,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {62487#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62487#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:41,378 INFO L290 TraceCheckUtils]: 41: Hoare triple {62487#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62488#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:41,379 INFO L290 TraceCheckUtils]: 42: Hoare triple {62488#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62488#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:41,379 INFO L290 TraceCheckUtils]: 43: Hoare triple {62488#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62489#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:41,379 INFO L290 TraceCheckUtils]: 44: Hoare triple {62489#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62489#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:41,380 INFO L290 TraceCheckUtils]: 45: Hoare triple {62489#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62490#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:41,380 INFO L290 TraceCheckUtils]: 46: Hoare triple {62490#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62490#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:41,380 INFO L290 TraceCheckUtils]: 47: Hoare triple {62490#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62491#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:41,380 INFO L290 TraceCheckUtils]: 48: Hoare triple {62491#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62491#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:41,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {62491#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62492#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:41,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {62492#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62492#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:41,381 INFO L290 TraceCheckUtils]: 51: Hoare triple {62492#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62493#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:41,381 INFO L290 TraceCheckUtils]: 52: Hoare triple {62493#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62493#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:41,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {62493#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62494#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:41,382 INFO L290 TraceCheckUtils]: 54: Hoare triple {62494#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62494#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:41,382 INFO L290 TraceCheckUtils]: 55: Hoare triple {62494#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62495#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:41,382 INFO L290 TraceCheckUtils]: 56: Hoare triple {62495#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62495#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:41,383 INFO L290 TraceCheckUtils]: 57: Hoare triple {62495#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62496#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:41,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {62496#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62496#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:41,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {62496#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62497#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:41,384 INFO L290 TraceCheckUtils]: 60: Hoare triple {62497#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62497#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:41,384 INFO L290 TraceCheckUtils]: 61: Hoare triple {62497#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62498#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:41,384 INFO L290 TraceCheckUtils]: 62: Hoare triple {62498#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62498#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:41,384 INFO L290 TraceCheckUtils]: 63: Hoare triple {62498#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62499#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:41,385 INFO L290 TraceCheckUtils]: 64: Hoare triple {62499#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62499#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:41,385 INFO L290 TraceCheckUtils]: 65: Hoare triple {62499#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62500#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:41,385 INFO L290 TraceCheckUtils]: 66: Hoare triple {62500#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62500#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:41,386 INFO L290 TraceCheckUtils]: 67: Hoare triple {62500#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62501#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:41,386 INFO L290 TraceCheckUtils]: 68: Hoare triple {62501#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62501#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:41,386 INFO L290 TraceCheckUtils]: 69: Hoare triple {62501#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62502#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:41,386 INFO L290 TraceCheckUtils]: 70: Hoare triple {62502#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62502#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:41,387 INFO L290 TraceCheckUtils]: 71: Hoare triple {62502#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62503#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:41,387 INFO L290 TraceCheckUtils]: 72: Hoare triple {62503#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62503#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:41,387 INFO L290 TraceCheckUtils]: 73: Hoare triple {62503#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62504#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:41,387 INFO L290 TraceCheckUtils]: 74: Hoare triple {62504#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62504#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:41,388 INFO L290 TraceCheckUtils]: 75: Hoare triple {62504#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62505#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:41,388 INFO L290 TraceCheckUtils]: 76: Hoare triple {62505#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62505#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:41,388 INFO L290 TraceCheckUtils]: 77: Hoare triple {62505#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62506#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:41,389 INFO L290 TraceCheckUtils]: 78: Hoare triple {62506#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62506#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:41,389 INFO L290 TraceCheckUtils]: 79: Hoare triple {62506#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62507#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:41,389 INFO L290 TraceCheckUtils]: 80: Hoare triple {62507#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62507#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:41,389 INFO L290 TraceCheckUtils]: 81: Hoare triple {62507#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62508#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:41,390 INFO L290 TraceCheckUtils]: 82: Hoare triple {62508#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62508#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:41,390 INFO L290 TraceCheckUtils]: 83: Hoare triple {62508#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62509#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:41,390 INFO L290 TraceCheckUtils]: 84: Hoare triple {62509#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62509#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:41,391 INFO L290 TraceCheckUtils]: 85: Hoare triple {62509#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62510#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:41,391 INFO L290 TraceCheckUtils]: 86: Hoare triple {62510#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62510#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:41,391 INFO L290 TraceCheckUtils]: 87: Hoare triple {62510#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62511#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:41,391 INFO L290 TraceCheckUtils]: 88: Hoare triple {62511#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62511#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:41,392 INFO L290 TraceCheckUtils]: 89: Hoare triple {62511#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62512#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:41,392 INFO L290 TraceCheckUtils]: 90: Hoare triple {62512#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62512#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:41,392 INFO L290 TraceCheckUtils]: 91: Hoare triple {62512#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62513#(<= main_~i~0 43)} is VALID [2022-04-15 12:19:41,392 INFO L290 TraceCheckUtils]: 92: Hoare triple {62513#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62513#(<= main_~i~0 43)} is VALID [2022-04-15 12:19:41,393 INFO L290 TraceCheckUtils]: 93: Hoare triple {62513#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62514#(<= main_~i~0 44)} is VALID [2022-04-15 12:19:41,393 INFO L290 TraceCheckUtils]: 94: Hoare triple {62514#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62514#(<= main_~i~0 44)} is VALID [2022-04-15 12:19:41,393 INFO L290 TraceCheckUtils]: 95: Hoare triple {62514#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62515#(<= main_~i~0 45)} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 96: Hoare triple {62515#(<= main_~i~0 45)} assume !(~i~0 < 1024); {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 97: Hoare triple {62466#false} ~i~0 := 0; {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 98: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 99: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 100: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 101: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 102: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 103: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 104: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 105: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 106: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 107: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 108: Hoare triple {62466#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L272 TraceCheckUtils]: 109: Hoare triple {62466#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 110: Hoare triple {62466#false} ~cond := #in~cond; {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 111: Hoare triple {62466#false} assume 0 == ~cond; {62466#false} is VALID [2022-04-15 12:19:41,394 INFO L290 TraceCheckUtils]: 112: Hoare triple {62466#false} assume !false; {62466#false} is VALID [2022-04-15 12:19:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:19:41,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:41,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670614652] [2022-04-15 12:19:41,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670614652] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:41,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434487079] [2022-04-15 12:19:41,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:19:41,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:41,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:41,396 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:19:41,397 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:19:41,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:19:41,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:41,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 12:19:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:41,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:42,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {62465#true} call ULTIMATE.init(); {62465#true} is VALID [2022-04-15 12:19:42,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {62465#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {62465#true} is VALID [2022-04-15 12:19:42,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {62465#true} assume true; {62465#true} is VALID [2022-04-15 12:19:42,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62465#true} {62465#true} #64#return; {62465#true} is VALID [2022-04-15 12:19:42,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {62465#true} call #t~ret6 := main(); {62465#true} is VALID [2022-04-15 12:19:42,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {62465#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {62535#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:42,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {62535#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62535#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:42,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {62535#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62471#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:42,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {62471#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62471#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:42,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {62471#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62472#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:42,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {62472#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62472#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:42,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {62472#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62473#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:42,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {62473#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62473#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:42,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {62473#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62474#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:42,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {62474#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62474#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:42,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {62474#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62475#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:42,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {62475#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62475#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:42,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {62475#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62476#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:42,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {62476#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62476#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:42,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {62476#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62477#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:42,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {62477#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62477#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:42,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {62477#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62478#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:42,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {62478#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62478#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:42,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {62478#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62479#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:42,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {62479#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62479#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:42,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {62479#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62480#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:42,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {62480#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62480#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:42,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {62480#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62481#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:42,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {62481#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62481#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:42,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {62481#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62482#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:42,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {62482#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62482#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:42,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {62482#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62483#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:42,192 INFO L290 TraceCheckUtils]: 32: Hoare triple {62483#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62483#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:42,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {62483#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62484#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:42,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {62484#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62484#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:42,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {62484#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62485#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:42,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {62485#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62485#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:42,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {62485#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62486#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:42,193 INFO L290 TraceCheckUtils]: 38: Hoare triple {62486#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62486#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:42,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {62486#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62487#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:42,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {62487#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62487#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:42,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {62487#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62488#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:42,195 INFO L290 TraceCheckUtils]: 42: Hoare triple {62488#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62488#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:42,195 INFO L290 TraceCheckUtils]: 43: Hoare triple {62488#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62489#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:42,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {62489#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62489#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:42,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {62489#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62490#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:42,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {62490#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62490#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:42,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {62490#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62491#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:42,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {62491#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62491#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:42,197 INFO L290 TraceCheckUtils]: 49: Hoare triple {62491#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62492#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:42,197 INFO L290 TraceCheckUtils]: 50: Hoare triple {62492#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62492#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:42,197 INFO L290 TraceCheckUtils]: 51: Hoare triple {62492#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62493#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:42,197 INFO L290 TraceCheckUtils]: 52: Hoare triple {62493#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62493#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:42,198 INFO L290 TraceCheckUtils]: 53: Hoare triple {62493#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62494#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:42,198 INFO L290 TraceCheckUtils]: 54: Hoare triple {62494#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62494#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:42,198 INFO L290 TraceCheckUtils]: 55: Hoare triple {62494#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62495#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:42,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {62495#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62495#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:42,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {62495#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62496#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:42,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {62496#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62496#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:42,199 INFO L290 TraceCheckUtils]: 59: Hoare triple {62496#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62497#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:42,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {62497#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62497#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:42,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {62497#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62498#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:42,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {62498#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62498#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:42,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {62498#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62499#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:42,201 INFO L290 TraceCheckUtils]: 64: Hoare triple {62499#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62499#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:42,201 INFO L290 TraceCheckUtils]: 65: Hoare triple {62499#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62500#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:42,201 INFO L290 TraceCheckUtils]: 66: Hoare triple {62500#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62500#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:42,202 INFO L290 TraceCheckUtils]: 67: Hoare triple {62500#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62501#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:42,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {62501#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62501#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:42,202 INFO L290 TraceCheckUtils]: 69: Hoare triple {62501#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62502#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:42,202 INFO L290 TraceCheckUtils]: 70: Hoare triple {62502#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62502#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:42,203 INFO L290 TraceCheckUtils]: 71: Hoare triple {62502#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62503#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:42,203 INFO L290 TraceCheckUtils]: 72: Hoare triple {62503#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62503#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:42,203 INFO L290 TraceCheckUtils]: 73: Hoare triple {62503#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62504#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:42,203 INFO L290 TraceCheckUtils]: 74: Hoare triple {62504#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62504#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:42,204 INFO L290 TraceCheckUtils]: 75: Hoare triple {62504#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62505#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:42,204 INFO L290 TraceCheckUtils]: 76: Hoare triple {62505#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62505#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:42,204 INFO L290 TraceCheckUtils]: 77: Hoare triple {62505#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62506#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:42,205 INFO L290 TraceCheckUtils]: 78: Hoare triple {62506#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62506#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:42,205 INFO L290 TraceCheckUtils]: 79: Hoare triple {62506#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62507#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:42,205 INFO L290 TraceCheckUtils]: 80: Hoare triple {62507#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62507#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:42,206 INFO L290 TraceCheckUtils]: 81: Hoare triple {62507#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62508#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:42,206 INFO L290 TraceCheckUtils]: 82: Hoare triple {62508#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62508#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:42,206 INFO L290 TraceCheckUtils]: 83: Hoare triple {62508#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62509#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:42,206 INFO L290 TraceCheckUtils]: 84: Hoare triple {62509#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62509#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:42,207 INFO L290 TraceCheckUtils]: 85: Hoare triple {62509#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62510#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:42,207 INFO L290 TraceCheckUtils]: 86: Hoare triple {62510#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62510#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:42,207 INFO L290 TraceCheckUtils]: 87: Hoare triple {62510#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62511#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:42,207 INFO L290 TraceCheckUtils]: 88: Hoare triple {62511#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62511#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:42,208 INFO L290 TraceCheckUtils]: 89: Hoare triple {62511#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62512#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:42,208 INFO L290 TraceCheckUtils]: 90: Hoare triple {62512#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62512#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:42,208 INFO L290 TraceCheckUtils]: 91: Hoare triple {62512#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62513#(<= main_~i~0 43)} is VALID [2022-04-15 12:19:42,209 INFO L290 TraceCheckUtils]: 92: Hoare triple {62513#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62513#(<= main_~i~0 43)} is VALID [2022-04-15 12:19:42,209 INFO L290 TraceCheckUtils]: 93: Hoare triple {62513#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62514#(<= main_~i~0 44)} is VALID [2022-04-15 12:19:42,209 INFO L290 TraceCheckUtils]: 94: Hoare triple {62514#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62514#(<= main_~i~0 44)} is VALID [2022-04-15 12:19:42,209 INFO L290 TraceCheckUtils]: 95: Hoare triple {62514#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62515#(<= main_~i~0 45)} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 96: Hoare triple {62515#(<= main_~i~0 45)} assume !(~i~0 < 1024); {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 97: Hoare triple {62466#false} ~i~0 := 0; {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 98: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 99: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 100: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 101: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 102: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 103: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 104: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 105: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 106: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 107: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 108: Hoare triple {62466#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L272 TraceCheckUtils]: 109: Hoare triple {62466#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 110: Hoare triple {62466#false} ~cond := #in~cond; {62466#false} is VALID [2022-04-15 12:19:42,210 INFO L290 TraceCheckUtils]: 111: Hoare triple {62466#false} assume 0 == ~cond; {62466#false} is VALID [2022-04-15 12:19:42,211 INFO L290 TraceCheckUtils]: 112: Hoare triple {62466#false} assume !false; {62466#false} is VALID [2022-04-15 12:19:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:19:42,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:44,486 INFO L290 TraceCheckUtils]: 112: Hoare triple {62466#false} assume !false; {62466#false} is VALID [2022-04-15 12:19:44,486 INFO L290 TraceCheckUtils]: 111: Hoare triple {62466#false} assume 0 == ~cond; {62466#false} is VALID [2022-04-15 12:19:44,486 INFO L290 TraceCheckUtils]: 110: Hoare triple {62466#false} ~cond := #in~cond; {62466#false} is VALID [2022-04-15 12:19:44,486 INFO L272 TraceCheckUtils]: 109: Hoare triple {62466#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {62466#false} is VALID [2022-04-15 12:19:44,486 INFO L290 TraceCheckUtils]: 108: Hoare triple {62466#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 12:19:44,486 INFO L290 TraceCheckUtils]: 107: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 12:19:44,486 INFO L290 TraceCheckUtils]: 106: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 12:19:44,486 INFO L290 TraceCheckUtils]: 105: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-15 12:19:44,487 INFO L290 TraceCheckUtils]: 104: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 12:19:44,487 INFO L290 TraceCheckUtils]: 103: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 12:19:44,487 INFO L290 TraceCheckUtils]: 102: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 12:19:44,487 INFO L290 TraceCheckUtils]: 101: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-15 12:19:44,487 INFO L290 TraceCheckUtils]: 100: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 12:19:44,487 INFO L290 TraceCheckUtils]: 99: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 12:19:44,487 INFO L290 TraceCheckUtils]: 98: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 12:19:44,487 INFO L290 TraceCheckUtils]: 97: Hoare triple {62466#false} ~i~0 := 0; {62466#false} is VALID [2022-04-15 12:19:44,487 INFO L290 TraceCheckUtils]: 96: Hoare triple {62905#(< main_~i~0 1024)} assume !(~i~0 < 1024); {62466#false} is VALID [2022-04-15 12:19:44,488 INFO L290 TraceCheckUtils]: 95: Hoare triple {62909#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62905#(< main_~i~0 1024)} is VALID [2022-04-15 12:19:44,488 INFO L290 TraceCheckUtils]: 94: Hoare triple {62909#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62909#(< main_~i~0 1023)} is VALID [2022-04-15 12:19:44,488 INFO L290 TraceCheckUtils]: 93: Hoare triple {62916#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62909#(< main_~i~0 1023)} is VALID [2022-04-15 12:19:44,488 INFO L290 TraceCheckUtils]: 92: Hoare triple {62916#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62916#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:44,489 INFO L290 TraceCheckUtils]: 91: Hoare triple {62923#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62916#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:44,489 INFO L290 TraceCheckUtils]: 90: Hoare triple {62923#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62923#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:44,489 INFO L290 TraceCheckUtils]: 89: Hoare triple {62930#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62923#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:44,490 INFO L290 TraceCheckUtils]: 88: Hoare triple {62930#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62930#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:44,490 INFO L290 TraceCheckUtils]: 87: Hoare triple {62937#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62930#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:44,490 INFO L290 TraceCheckUtils]: 86: Hoare triple {62937#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62937#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:44,490 INFO L290 TraceCheckUtils]: 85: Hoare triple {62944#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62937#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:44,491 INFO L290 TraceCheckUtils]: 84: Hoare triple {62944#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62944#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:44,491 INFO L290 TraceCheckUtils]: 83: Hoare triple {62951#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62944#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:44,491 INFO L290 TraceCheckUtils]: 82: Hoare triple {62951#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62951#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:44,492 INFO L290 TraceCheckUtils]: 81: Hoare triple {62958#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62951#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:44,492 INFO L290 TraceCheckUtils]: 80: Hoare triple {62958#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62958#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:44,492 INFO L290 TraceCheckUtils]: 79: Hoare triple {62965#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62958#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:44,492 INFO L290 TraceCheckUtils]: 78: Hoare triple {62965#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62965#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:44,493 INFO L290 TraceCheckUtils]: 77: Hoare triple {62972#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62965#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:44,493 INFO L290 TraceCheckUtils]: 76: Hoare triple {62972#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62972#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:44,493 INFO L290 TraceCheckUtils]: 75: Hoare triple {62979#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62972#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:44,493 INFO L290 TraceCheckUtils]: 74: Hoare triple {62979#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62979#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:44,494 INFO L290 TraceCheckUtils]: 73: Hoare triple {62986#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62979#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:44,494 INFO L290 TraceCheckUtils]: 72: Hoare triple {62986#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62986#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:44,494 INFO L290 TraceCheckUtils]: 71: Hoare triple {62993#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62986#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:44,495 INFO L290 TraceCheckUtils]: 70: Hoare triple {62993#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62993#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:44,495 INFO L290 TraceCheckUtils]: 69: Hoare triple {63000#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62993#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:44,495 INFO L290 TraceCheckUtils]: 68: Hoare triple {63000#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63000#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:44,495 INFO L290 TraceCheckUtils]: 67: Hoare triple {63007#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63000#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:44,496 INFO L290 TraceCheckUtils]: 66: Hoare triple {63007#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63007#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:44,496 INFO L290 TraceCheckUtils]: 65: Hoare triple {63014#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63007#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:44,496 INFO L290 TraceCheckUtils]: 64: Hoare triple {63014#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63014#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:44,497 INFO L290 TraceCheckUtils]: 63: Hoare triple {63021#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63014#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:44,497 INFO L290 TraceCheckUtils]: 62: Hoare triple {63021#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63021#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:44,497 INFO L290 TraceCheckUtils]: 61: Hoare triple {63028#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63021#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:44,497 INFO L290 TraceCheckUtils]: 60: Hoare triple {63028#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63028#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:44,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {63035#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63028#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:44,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {63035#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63035#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:44,498 INFO L290 TraceCheckUtils]: 57: Hoare triple {63042#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63035#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:44,499 INFO L290 TraceCheckUtils]: 56: Hoare triple {63042#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63042#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:44,499 INFO L290 TraceCheckUtils]: 55: Hoare triple {63049#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63042#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:44,499 INFO L290 TraceCheckUtils]: 54: Hoare triple {63049#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63049#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:44,500 INFO L290 TraceCheckUtils]: 53: Hoare triple {63056#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63049#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:44,500 INFO L290 TraceCheckUtils]: 52: Hoare triple {63056#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63056#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:44,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {63063#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63056#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:44,500 INFO L290 TraceCheckUtils]: 50: Hoare triple {63063#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63063#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:44,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {63070#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63063#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:44,501 INFO L290 TraceCheckUtils]: 48: Hoare triple {63070#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63070#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:44,501 INFO L290 TraceCheckUtils]: 47: Hoare triple {63077#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63070#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:44,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {63077#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63077#(< main_~i~0 999)} is VALID [2022-04-15 12:19:44,502 INFO L290 TraceCheckUtils]: 45: Hoare triple {63084#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63077#(< main_~i~0 999)} is VALID [2022-04-15 12:19:44,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {63084#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63084#(< main_~i~0 998)} is VALID [2022-04-15 12:19:44,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {63091#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63084#(< main_~i~0 998)} is VALID [2022-04-15 12:19:44,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {63091#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63091#(< main_~i~0 997)} is VALID [2022-04-15 12:19:44,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {63098#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63091#(< main_~i~0 997)} is VALID [2022-04-15 12:19:44,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {63098#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63098#(< main_~i~0 996)} is VALID [2022-04-15 12:19:44,504 INFO L290 TraceCheckUtils]: 39: Hoare triple {63105#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63098#(< main_~i~0 996)} is VALID [2022-04-15 12:19:44,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {63105#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63105#(< main_~i~0 995)} is VALID [2022-04-15 12:19:44,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {63112#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63105#(< main_~i~0 995)} is VALID [2022-04-15 12:19:44,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {63112#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63112#(< main_~i~0 994)} is VALID [2022-04-15 12:19:44,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {63119#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63112#(< main_~i~0 994)} is VALID [2022-04-15 12:19:44,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {63119#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63119#(< main_~i~0 993)} is VALID [2022-04-15 12:19:44,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {63126#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63119#(< main_~i~0 993)} is VALID [2022-04-15 12:19:44,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {63126#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63126#(< main_~i~0 992)} is VALID [2022-04-15 12:19:44,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {63133#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63126#(< main_~i~0 992)} is VALID [2022-04-15 12:19:44,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {63133#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63133#(< main_~i~0 991)} is VALID [2022-04-15 12:19:44,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {63140#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63133#(< main_~i~0 991)} is VALID [2022-04-15 12:19:44,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {63140#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63140#(< main_~i~0 990)} is VALID [2022-04-15 12:19:44,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {63147#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63140#(< main_~i~0 990)} is VALID [2022-04-15 12:19:44,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {63147#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63147#(< main_~i~0 989)} is VALID [2022-04-15 12:19:44,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {63154#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63147#(< main_~i~0 989)} is VALID [2022-04-15 12:19:44,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {63154#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63154#(< main_~i~0 988)} is VALID [2022-04-15 12:19:44,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {63161#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63154#(< main_~i~0 988)} is VALID [2022-04-15 12:19:44,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {63161#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63161#(< main_~i~0 987)} is VALID [2022-04-15 12:19:44,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {63168#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63161#(< main_~i~0 987)} is VALID [2022-04-15 12:19:44,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {63168#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63168#(< main_~i~0 986)} is VALID [2022-04-15 12:19:44,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {63175#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63168#(< main_~i~0 986)} is VALID [2022-04-15 12:19:44,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {63175#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63175#(< main_~i~0 985)} is VALID [2022-04-15 12:19:44,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {63182#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63175#(< main_~i~0 985)} is VALID [2022-04-15 12:19:44,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {63182#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63182#(< main_~i~0 984)} is VALID [2022-04-15 12:19:44,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {63189#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63182#(< main_~i~0 984)} is VALID [2022-04-15 12:19:44,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {63189#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63189#(< main_~i~0 983)} is VALID [2022-04-15 12:19:44,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {63196#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63189#(< main_~i~0 983)} is VALID [2022-04-15 12:19:44,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {63196#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63196#(< main_~i~0 982)} is VALID [2022-04-15 12:19:44,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {63203#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63196#(< main_~i~0 982)} is VALID [2022-04-15 12:19:44,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {63203#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63203#(< main_~i~0 981)} is VALID [2022-04-15 12:19:44,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {63210#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63203#(< main_~i~0 981)} is VALID [2022-04-15 12:19:44,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {63210#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63210#(< main_~i~0 980)} is VALID [2022-04-15 12:19:44,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {63217#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63210#(< main_~i~0 980)} is VALID [2022-04-15 12:19:44,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {63217#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63217#(< main_~i~0 979)} is VALID [2022-04-15 12:19:44,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {62465#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {63217#(< main_~i~0 979)} is VALID [2022-04-15 12:19:44,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {62465#true} call #t~ret6 := main(); {62465#true} is VALID [2022-04-15 12:19:44,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62465#true} {62465#true} #64#return; {62465#true} is VALID [2022-04-15 12:19:44,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {62465#true} assume true; {62465#true} is VALID [2022-04-15 12:19:44,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {62465#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {62465#true} is VALID [2022-04-15 12:19:44,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {62465#true} call ULTIMATE.init(); {62465#true} is VALID [2022-04-15 12:19:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:19:44,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434487079] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:44,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:44,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 96 [2022-04-15 12:19:44,515 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:44,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [284566382] [2022-04-15 12:19:44,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [284566382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:44,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:44,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 12:19:44,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429403992] [2022-04-15 12:19:44,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:44,516 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-15 12:19:44,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:44,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:44,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:44,578 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 12:19:44,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:44,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 12:19:44,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 12:19:44,580 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:52,453 INFO L93 Difference]: Finished difference Result 355 states and 451 transitions. [2022-04-15 12:19:52,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 12:19:52,453 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-15 12:19:52,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 442 transitions. [2022-04-15 12:19:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 442 transitions. [2022-04-15 12:19:52,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 442 transitions. [2022-04-15 12:19:52,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:52,745 INFO L225 Difference]: With dead ends: 355 [2022-04-15 12:19:52,745 INFO L226 Difference]: Without dead ends: 338 [2022-04-15 12:19:52,746 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=8838, Invalid=11184, Unknown=0, NotChecked=0, Total=20022 [2022-04-15 12:19:52,747 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1008 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:52,747 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1008 Valid, 42 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:19:52,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-15 12:19:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 116. [2022-04-15 12:19:53,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:53,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:53,340 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:53,340 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:53,344 INFO L93 Difference]: Finished difference Result 338 states and 430 transitions. [2022-04-15 12:19:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 430 transitions. [2022-04-15 12:19:53,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:53,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:53,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 338 states. [2022-04-15 12:19:53,345 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 338 states. [2022-04-15 12:19:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:53,349 INFO L93 Difference]: Finished difference Result 338 states and 430 transitions. [2022-04-15 12:19:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 430 transitions. [2022-04-15 12:19:53,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:53,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:53,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:53,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2022-04-15 12:19:53,351 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 113 [2022-04-15 12:19:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:53,351 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2022-04-15 12:19:53,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:53,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 120 transitions. [2022-04-15 12:19:53,588 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:19:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2022-04-15 12:19:53,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 12:19:53,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:53,589 INFO L499 BasicCegarLoop]: trace histogram [46, 46, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:53,607 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:19:53,789 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:19:53,790 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:53,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:53,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1863416353, now seen corresponding path program 93 times [2022-04-15 12:19:53,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:53,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [583846084] [2022-04-15 12:19:53,794 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:53,794 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:53,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1863416353, now seen corresponding path program 94 times [2022-04-15 12:19:53,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:53,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030430010] [2022-04-15 12:19:53,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:53,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:54,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:54,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {65003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {64951#true} is VALID [2022-04-15 12:19:54,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {64951#true} assume true; {64951#true} is VALID [2022-04-15 12:19:54,573 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64951#true} {64951#true} #64#return; {64951#true} is VALID [2022-04-15 12:19:54,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {64951#true} call ULTIMATE.init(); {65003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:54,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {65003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {64951#true} is VALID [2022-04-15 12:19:54,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {64951#true} assume true; {64951#true} is VALID [2022-04-15 12:19:54,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64951#true} {64951#true} #64#return; {64951#true} is VALID [2022-04-15 12:19:54,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {64951#true} call #t~ret6 := main(); {64951#true} is VALID [2022-04-15 12:19:54,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {64951#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {64956#(= main_~i~0 0)} is VALID [2022-04-15 12:19:54,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {64956#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64956#(= main_~i~0 0)} is VALID [2022-04-15 12:19:54,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {64956#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64957#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:54,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {64957#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64957#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:54,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {64957#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64958#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:54,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {64958#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64958#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:54,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {64958#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64959#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:54,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {64959#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64959#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:54,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {64959#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64960#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:54,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {64960#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64960#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:54,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {64960#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64961#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:54,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {64961#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64961#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:54,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {64961#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64962#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:54,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {64962#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64962#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:54,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {64962#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64963#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:54,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {64963#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64963#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:54,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {64963#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64964#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:54,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {64964#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64964#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:54,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {64964#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64965#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:54,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {64965#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64965#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:54,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {64965#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64966#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:54,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {64966#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64966#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:54,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {64966#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64967#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:54,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {64967#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64967#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:54,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {64967#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64968#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:54,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {64968#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64968#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:54,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {64968#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64969#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:54,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {64969#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64969#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:54,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {64969#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64970#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:54,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {64970#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64970#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:54,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {64970#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64971#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:54,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {64971#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64971#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:54,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {64971#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64972#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:54,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {64972#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64972#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:54,583 INFO L290 TraceCheckUtils]: 39: Hoare triple {64972#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64973#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:54,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {64973#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64973#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:54,584 INFO L290 TraceCheckUtils]: 41: Hoare triple {64973#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64974#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:54,584 INFO L290 TraceCheckUtils]: 42: Hoare triple {64974#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64974#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:54,584 INFO L290 TraceCheckUtils]: 43: Hoare triple {64974#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64975#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:54,584 INFO L290 TraceCheckUtils]: 44: Hoare triple {64975#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64975#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:54,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {64975#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64976#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:54,585 INFO L290 TraceCheckUtils]: 46: Hoare triple {64976#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64976#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:54,585 INFO L290 TraceCheckUtils]: 47: Hoare triple {64976#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64977#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:54,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {64977#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64977#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:54,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {64977#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64978#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:54,586 INFO L290 TraceCheckUtils]: 50: Hoare triple {64978#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64978#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:54,586 INFO L290 TraceCheckUtils]: 51: Hoare triple {64978#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64979#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:54,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {64979#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64979#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:54,587 INFO L290 TraceCheckUtils]: 53: Hoare triple {64979#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64980#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:54,587 INFO L290 TraceCheckUtils]: 54: Hoare triple {64980#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64980#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:54,588 INFO L290 TraceCheckUtils]: 55: Hoare triple {64980#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64981#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:54,588 INFO L290 TraceCheckUtils]: 56: Hoare triple {64981#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64981#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:54,588 INFO L290 TraceCheckUtils]: 57: Hoare triple {64981#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64982#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:54,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {64982#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64982#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:54,589 INFO L290 TraceCheckUtils]: 59: Hoare triple {64982#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64983#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:54,589 INFO L290 TraceCheckUtils]: 60: Hoare triple {64983#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64983#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:54,589 INFO L290 TraceCheckUtils]: 61: Hoare triple {64983#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64984#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:54,589 INFO L290 TraceCheckUtils]: 62: Hoare triple {64984#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64984#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:54,590 INFO L290 TraceCheckUtils]: 63: Hoare triple {64984#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64985#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:54,590 INFO L290 TraceCheckUtils]: 64: Hoare triple {64985#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64985#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:54,590 INFO L290 TraceCheckUtils]: 65: Hoare triple {64985#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64986#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:54,591 INFO L290 TraceCheckUtils]: 66: Hoare triple {64986#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64986#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:54,591 INFO L290 TraceCheckUtils]: 67: Hoare triple {64986#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64987#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:54,591 INFO L290 TraceCheckUtils]: 68: Hoare triple {64987#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64987#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:54,591 INFO L290 TraceCheckUtils]: 69: Hoare triple {64987#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64988#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:54,592 INFO L290 TraceCheckUtils]: 70: Hoare triple {64988#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64988#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:54,592 INFO L290 TraceCheckUtils]: 71: Hoare triple {64988#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64989#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:54,592 INFO L290 TraceCheckUtils]: 72: Hoare triple {64989#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64989#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:54,592 INFO L290 TraceCheckUtils]: 73: Hoare triple {64989#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64990#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:54,593 INFO L290 TraceCheckUtils]: 74: Hoare triple {64990#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64990#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:54,593 INFO L290 TraceCheckUtils]: 75: Hoare triple {64990#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64991#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:54,593 INFO L290 TraceCheckUtils]: 76: Hoare triple {64991#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64991#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:54,594 INFO L290 TraceCheckUtils]: 77: Hoare triple {64991#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64992#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:54,594 INFO L290 TraceCheckUtils]: 78: Hoare triple {64992#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64992#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:54,594 INFO L290 TraceCheckUtils]: 79: Hoare triple {64992#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64993#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:54,594 INFO L290 TraceCheckUtils]: 80: Hoare triple {64993#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64993#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:54,595 INFO L290 TraceCheckUtils]: 81: Hoare triple {64993#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64994#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:54,595 INFO L290 TraceCheckUtils]: 82: Hoare triple {64994#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64994#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:54,595 INFO L290 TraceCheckUtils]: 83: Hoare triple {64994#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64995#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:54,595 INFO L290 TraceCheckUtils]: 84: Hoare triple {64995#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64995#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:54,596 INFO L290 TraceCheckUtils]: 85: Hoare triple {64995#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64996#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:54,596 INFO L290 TraceCheckUtils]: 86: Hoare triple {64996#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64996#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:54,596 INFO L290 TraceCheckUtils]: 87: Hoare triple {64996#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64997#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:54,597 INFO L290 TraceCheckUtils]: 88: Hoare triple {64997#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64997#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:54,597 INFO L290 TraceCheckUtils]: 89: Hoare triple {64997#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64998#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:54,597 INFO L290 TraceCheckUtils]: 90: Hoare triple {64998#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64998#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:54,597 INFO L290 TraceCheckUtils]: 91: Hoare triple {64998#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64999#(<= main_~i~0 43)} is VALID [2022-04-15 12:19:54,598 INFO L290 TraceCheckUtils]: 92: Hoare triple {64999#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64999#(<= main_~i~0 43)} is VALID [2022-04-15 12:19:54,598 INFO L290 TraceCheckUtils]: 93: Hoare triple {64999#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65000#(<= main_~i~0 44)} is VALID [2022-04-15 12:19:54,598 INFO L290 TraceCheckUtils]: 94: Hoare triple {65000#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65000#(<= main_~i~0 44)} is VALID [2022-04-15 12:19:54,598 INFO L290 TraceCheckUtils]: 95: Hoare triple {65000#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65001#(<= main_~i~0 45)} is VALID [2022-04-15 12:19:54,599 INFO L290 TraceCheckUtils]: 96: Hoare triple {65001#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65001#(<= main_~i~0 45)} is VALID [2022-04-15 12:19:54,599 INFO L290 TraceCheckUtils]: 97: Hoare triple {65001#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65002#(<= main_~i~0 46)} is VALID [2022-04-15 12:19:54,599 INFO L290 TraceCheckUtils]: 98: Hoare triple {65002#(<= main_~i~0 46)} assume !(~i~0 < 1024); {64952#false} is VALID [2022-04-15 12:19:54,599 INFO L290 TraceCheckUtils]: 99: Hoare triple {64952#false} ~i~0 := 0; {64952#false} is VALID [2022-04-15 12:19:54,599 INFO L290 TraceCheckUtils]: 100: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 12:19:54,599 INFO L290 TraceCheckUtils]: 101: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 12:19:54,600 INFO L290 TraceCheckUtils]: 102: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 12:19:54,600 INFO L290 TraceCheckUtils]: 103: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-15 12:19:54,600 INFO L290 TraceCheckUtils]: 104: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 12:19:54,600 INFO L290 TraceCheckUtils]: 105: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 12:19:54,600 INFO L290 TraceCheckUtils]: 106: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 12:19:54,600 INFO L290 TraceCheckUtils]: 107: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-15 12:19:54,600 INFO L290 TraceCheckUtils]: 108: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 12:19:54,600 INFO L290 TraceCheckUtils]: 109: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 12:19:54,600 INFO L290 TraceCheckUtils]: 110: Hoare triple {64952#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 12:19:54,600 INFO L272 TraceCheckUtils]: 111: Hoare triple {64952#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {64952#false} is VALID [2022-04-15 12:19:54,600 INFO L290 TraceCheckUtils]: 112: Hoare triple {64952#false} ~cond := #in~cond; {64952#false} is VALID [2022-04-15 12:19:54,600 INFO L290 TraceCheckUtils]: 113: Hoare triple {64952#false} assume 0 == ~cond; {64952#false} is VALID [2022-04-15 12:19:54,600 INFO L290 TraceCheckUtils]: 114: Hoare triple {64952#false} assume !false; {64952#false} is VALID [2022-04-15 12:19:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:19:54,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:54,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030430010] [2022-04-15 12:19:54,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030430010] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:54,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522512527] [2022-04-15 12:19:54,601 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:19:54,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:54,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:54,602 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:19:54,602 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:19:54,852 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:19:54,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:54,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 12:19:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:54,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:55,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {64951#true} call ULTIMATE.init(); {64951#true} is VALID [2022-04-15 12:19:55,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {64951#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {64951#true} is VALID [2022-04-15 12:19:55,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {64951#true} assume true; {64951#true} is VALID [2022-04-15 12:19:55,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64951#true} {64951#true} #64#return; {64951#true} is VALID [2022-04-15 12:19:55,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {64951#true} call #t~ret6 := main(); {64951#true} is VALID [2022-04-15 12:19:55,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {64951#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {65022#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:55,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {65022#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65022#(<= main_~i~0 0)} is VALID [2022-04-15 12:19:55,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {65022#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64957#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:55,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {64957#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64957#(<= main_~i~0 1)} is VALID [2022-04-15 12:19:55,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {64957#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64958#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:55,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {64958#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64958#(<= main_~i~0 2)} is VALID [2022-04-15 12:19:55,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {64958#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64959#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:55,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {64959#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64959#(<= main_~i~0 3)} is VALID [2022-04-15 12:19:55,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {64959#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64960#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:55,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {64960#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64960#(<= main_~i~0 4)} is VALID [2022-04-15 12:19:55,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {64960#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64961#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:55,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {64961#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64961#(<= main_~i~0 5)} is VALID [2022-04-15 12:19:55,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {64961#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64962#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:55,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {64962#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64962#(<= main_~i~0 6)} is VALID [2022-04-15 12:19:55,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {64962#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64963#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:55,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {64963#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64963#(<= main_~i~0 7)} is VALID [2022-04-15 12:19:55,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {64963#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64964#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:55,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {64964#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64964#(<= main_~i~0 8)} is VALID [2022-04-15 12:19:55,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {64964#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64965#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:55,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {64965#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64965#(<= main_~i~0 9)} is VALID [2022-04-15 12:19:55,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {64965#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64966#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:55,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {64966#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64966#(<= main_~i~0 10)} is VALID [2022-04-15 12:19:55,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {64966#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64967#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:55,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {64967#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64967#(<= main_~i~0 11)} is VALID [2022-04-15 12:19:55,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {64967#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64968#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:55,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {64968#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64968#(<= main_~i~0 12)} is VALID [2022-04-15 12:19:55,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {64968#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64969#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:55,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {64969#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64969#(<= main_~i~0 13)} is VALID [2022-04-15 12:19:55,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {64969#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64970#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:55,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {64970#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64970#(<= main_~i~0 14)} is VALID [2022-04-15 12:19:55,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {64970#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64971#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:55,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {64971#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64971#(<= main_~i~0 15)} is VALID [2022-04-15 12:19:55,403 INFO L290 TraceCheckUtils]: 37: Hoare triple {64971#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64972#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:55,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {64972#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64972#(<= main_~i~0 16)} is VALID [2022-04-15 12:19:55,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {64972#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64973#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:55,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {64973#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64973#(<= main_~i~0 17)} is VALID [2022-04-15 12:19:55,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {64973#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64974#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:55,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {64974#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64974#(<= main_~i~0 18)} is VALID [2022-04-15 12:19:55,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {64974#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64975#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:55,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {64975#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64975#(<= main_~i~0 19)} is VALID [2022-04-15 12:19:55,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {64975#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64976#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:55,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {64976#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64976#(<= main_~i~0 20)} is VALID [2022-04-15 12:19:55,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {64976#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64977#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:55,406 INFO L290 TraceCheckUtils]: 48: Hoare triple {64977#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64977#(<= main_~i~0 21)} is VALID [2022-04-15 12:19:55,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {64977#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64978#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:55,406 INFO L290 TraceCheckUtils]: 50: Hoare triple {64978#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64978#(<= main_~i~0 22)} is VALID [2022-04-15 12:19:55,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {64978#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64979#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:55,407 INFO L290 TraceCheckUtils]: 52: Hoare triple {64979#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64979#(<= main_~i~0 23)} is VALID [2022-04-15 12:19:55,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {64979#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64980#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:55,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {64980#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64980#(<= main_~i~0 24)} is VALID [2022-04-15 12:19:55,408 INFO L290 TraceCheckUtils]: 55: Hoare triple {64980#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64981#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:55,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {64981#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64981#(<= main_~i~0 25)} is VALID [2022-04-15 12:19:55,408 INFO L290 TraceCheckUtils]: 57: Hoare triple {64981#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64982#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:55,408 INFO L290 TraceCheckUtils]: 58: Hoare triple {64982#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64982#(<= main_~i~0 26)} is VALID [2022-04-15 12:19:55,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {64982#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64983#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:55,409 INFO L290 TraceCheckUtils]: 60: Hoare triple {64983#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64983#(<= main_~i~0 27)} is VALID [2022-04-15 12:19:55,409 INFO L290 TraceCheckUtils]: 61: Hoare triple {64983#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64984#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:55,409 INFO L290 TraceCheckUtils]: 62: Hoare triple {64984#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64984#(<= main_~i~0 28)} is VALID [2022-04-15 12:19:55,410 INFO L290 TraceCheckUtils]: 63: Hoare triple {64984#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64985#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:55,410 INFO L290 TraceCheckUtils]: 64: Hoare triple {64985#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64985#(<= main_~i~0 29)} is VALID [2022-04-15 12:19:55,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {64985#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64986#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:55,411 INFO L290 TraceCheckUtils]: 66: Hoare triple {64986#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64986#(<= main_~i~0 30)} is VALID [2022-04-15 12:19:55,411 INFO L290 TraceCheckUtils]: 67: Hoare triple {64986#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64987#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:55,411 INFO L290 TraceCheckUtils]: 68: Hoare triple {64987#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64987#(<= main_~i~0 31)} is VALID [2022-04-15 12:19:55,411 INFO L290 TraceCheckUtils]: 69: Hoare triple {64987#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64988#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:55,412 INFO L290 TraceCheckUtils]: 70: Hoare triple {64988#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64988#(<= main_~i~0 32)} is VALID [2022-04-15 12:19:55,412 INFO L290 TraceCheckUtils]: 71: Hoare triple {64988#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64989#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:55,412 INFO L290 TraceCheckUtils]: 72: Hoare triple {64989#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64989#(<= main_~i~0 33)} is VALID [2022-04-15 12:19:55,413 INFO L290 TraceCheckUtils]: 73: Hoare triple {64989#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64990#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:55,413 INFO L290 TraceCheckUtils]: 74: Hoare triple {64990#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64990#(<= main_~i~0 34)} is VALID [2022-04-15 12:19:55,413 INFO L290 TraceCheckUtils]: 75: Hoare triple {64990#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64991#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:55,413 INFO L290 TraceCheckUtils]: 76: Hoare triple {64991#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64991#(<= main_~i~0 35)} is VALID [2022-04-15 12:19:55,414 INFO L290 TraceCheckUtils]: 77: Hoare triple {64991#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64992#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:55,414 INFO L290 TraceCheckUtils]: 78: Hoare triple {64992#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64992#(<= main_~i~0 36)} is VALID [2022-04-15 12:19:55,414 INFO L290 TraceCheckUtils]: 79: Hoare triple {64992#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64993#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:55,415 INFO L290 TraceCheckUtils]: 80: Hoare triple {64993#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64993#(<= main_~i~0 37)} is VALID [2022-04-15 12:19:55,415 INFO L290 TraceCheckUtils]: 81: Hoare triple {64993#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64994#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:55,415 INFO L290 TraceCheckUtils]: 82: Hoare triple {64994#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64994#(<= main_~i~0 38)} is VALID [2022-04-15 12:19:55,415 INFO L290 TraceCheckUtils]: 83: Hoare triple {64994#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64995#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:55,416 INFO L290 TraceCheckUtils]: 84: Hoare triple {64995#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64995#(<= main_~i~0 39)} is VALID [2022-04-15 12:19:55,416 INFO L290 TraceCheckUtils]: 85: Hoare triple {64995#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64996#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:55,416 INFO L290 TraceCheckUtils]: 86: Hoare triple {64996#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64996#(<= main_~i~0 40)} is VALID [2022-04-15 12:19:55,417 INFO L290 TraceCheckUtils]: 87: Hoare triple {64996#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64997#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:55,417 INFO L290 TraceCheckUtils]: 88: Hoare triple {64997#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64997#(<= main_~i~0 41)} is VALID [2022-04-15 12:19:55,417 INFO L290 TraceCheckUtils]: 89: Hoare triple {64997#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64998#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:55,417 INFO L290 TraceCheckUtils]: 90: Hoare triple {64998#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64998#(<= main_~i~0 42)} is VALID [2022-04-15 12:19:55,418 INFO L290 TraceCheckUtils]: 91: Hoare triple {64998#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64999#(<= main_~i~0 43)} is VALID [2022-04-15 12:19:55,418 INFO L290 TraceCheckUtils]: 92: Hoare triple {64999#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64999#(<= main_~i~0 43)} is VALID [2022-04-15 12:19:55,418 INFO L290 TraceCheckUtils]: 93: Hoare triple {64999#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65000#(<= main_~i~0 44)} is VALID [2022-04-15 12:19:55,418 INFO L290 TraceCheckUtils]: 94: Hoare triple {65000#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65000#(<= main_~i~0 44)} is VALID [2022-04-15 12:19:55,419 INFO L290 TraceCheckUtils]: 95: Hoare triple {65000#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65001#(<= main_~i~0 45)} is VALID [2022-04-15 12:19:55,419 INFO L290 TraceCheckUtils]: 96: Hoare triple {65001#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65001#(<= main_~i~0 45)} is VALID [2022-04-15 12:19:55,419 INFO L290 TraceCheckUtils]: 97: Hoare triple {65001#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65002#(<= main_~i~0 46)} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 98: Hoare triple {65002#(<= main_~i~0 46)} assume !(~i~0 < 1024); {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 99: Hoare triple {64952#false} ~i~0 := 0; {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 100: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 101: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 102: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 103: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 104: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 105: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 106: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 107: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 108: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 109: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 110: Hoare triple {64952#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L272 TraceCheckUtils]: 111: Hoare triple {64952#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 112: Hoare triple {64952#false} ~cond := #in~cond; {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 113: Hoare triple {64952#false} assume 0 == ~cond; {64952#false} is VALID [2022-04-15 12:19:55,420 INFO L290 TraceCheckUtils]: 114: Hoare triple {64952#false} assume !false; {64952#false} is VALID [2022-04-15 12:19:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:19:55,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:57,774 INFO L290 TraceCheckUtils]: 114: Hoare triple {64952#false} assume !false; {64952#false} is VALID [2022-04-15 12:19:57,774 INFO L290 TraceCheckUtils]: 113: Hoare triple {64952#false} assume 0 == ~cond; {64952#false} is VALID [2022-04-15 12:19:57,774 INFO L290 TraceCheckUtils]: 112: Hoare triple {64952#false} ~cond := #in~cond; {64952#false} is VALID [2022-04-15 12:19:57,774 INFO L272 TraceCheckUtils]: 111: Hoare triple {64952#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {64952#false} is VALID [2022-04-15 12:19:57,774 INFO L290 TraceCheckUtils]: 110: Hoare triple {64952#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 12:19:57,774 INFO L290 TraceCheckUtils]: 109: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 12:19:57,774 INFO L290 TraceCheckUtils]: 108: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 12:19:57,774 INFO L290 TraceCheckUtils]: 107: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-15 12:19:57,774 INFO L290 TraceCheckUtils]: 106: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 12:19:57,774 INFO L290 TraceCheckUtils]: 105: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 12:19:57,774 INFO L290 TraceCheckUtils]: 104: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 12:19:57,774 INFO L290 TraceCheckUtils]: 103: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-15 12:19:57,774 INFO L290 TraceCheckUtils]: 102: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 12:19:57,774 INFO L290 TraceCheckUtils]: 101: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 12:19:57,774 INFO L290 TraceCheckUtils]: 100: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 12:19:57,775 INFO L290 TraceCheckUtils]: 99: Hoare triple {64952#false} ~i~0 := 0; {64952#false} is VALID [2022-04-15 12:19:57,775 INFO L290 TraceCheckUtils]: 98: Hoare triple {65398#(< main_~i~0 1024)} assume !(~i~0 < 1024); {64952#false} is VALID [2022-04-15 12:19:57,775 INFO L290 TraceCheckUtils]: 97: Hoare triple {65402#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65398#(< main_~i~0 1024)} is VALID [2022-04-15 12:19:57,775 INFO L290 TraceCheckUtils]: 96: Hoare triple {65402#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65402#(< main_~i~0 1023)} is VALID [2022-04-15 12:19:57,776 INFO L290 TraceCheckUtils]: 95: Hoare triple {65409#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65402#(< main_~i~0 1023)} is VALID [2022-04-15 12:19:57,776 INFO L290 TraceCheckUtils]: 94: Hoare triple {65409#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65409#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:57,776 INFO L290 TraceCheckUtils]: 93: Hoare triple {65416#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65409#(< main_~i~0 1022)} is VALID [2022-04-15 12:19:57,777 INFO L290 TraceCheckUtils]: 92: Hoare triple {65416#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65416#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:57,777 INFO L290 TraceCheckUtils]: 91: Hoare triple {65423#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65416#(< main_~i~0 1021)} is VALID [2022-04-15 12:19:57,777 INFO L290 TraceCheckUtils]: 90: Hoare triple {65423#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65423#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:57,777 INFO L290 TraceCheckUtils]: 89: Hoare triple {65430#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65423#(< main_~i~0 1020)} is VALID [2022-04-15 12:19:57,778 INFO L290 TraceCheckUtils]: 88: Hoare triple {65430#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65430#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:57,778 INFO L290 TraceCheckUtils]: 87: Hoare triple {65437#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65430#(< main_~i~0 1019)} is VALID [2022-04-15 12:19:57,778 INFO L290 TraceCheckUtils]: 86: Hoare triple {65437#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65437#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:57,778 INFO L290 TraceCheckUtils]: 85: Hoare triple {65444#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65437#(< main_~i~0 1018)} is VALID [2022-04-15 12:19:57,779 INFO L290 TraceCheckUtils]: 84: Hoare triple {65444#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65444#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:57,779 INFO L290 TraceCheckUtils]: 83: Hoare triple {65451#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65444#(< main_~i~0 1017)} is VALID [2022-04-15 12:19:57,779 INFO L290 TraceCheckUtils]: 82: Hoare triple {65451#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65451#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:57,780 INFO L290 TraceCheckUtils]: 81: Hoare triple {65458#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65451#(< main_~i~0 1016)} is VALID [2022-04-15 12:19:57,780 INFO L290 TraceCheckUtils]: 80: Hoare triple {65458#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65458#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:57,780 INFO L290 TraceCheckUtils]: 79: Hoare triple {65465#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65458#(< main_~i~0 1015)} is VALID [2022-04-15 12:19:57,780 INFO L290 TraceCheckUtils]: 78: Hoare triple {65465#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65465#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:57,781 INFO L290 TraceCheckUtils]: 77: Hoare triple {65472#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65465#(< main_~i~0 1014)} is VALID [2022-04-15 12:19:57,781 INFO L290 TraceCheckUtils]: 76: Hoare triple {65472#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65472#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:57,781 INFO L290 TraceCheckUtils]: 75: Hoare triple {65479#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65472#(< main_~i~0 1013)} is VALID [2022-04-15 12:19:57,781 INFO L290 TraceCheckUtils]: 74: Hoare triple {65479#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65479#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:57,782 INFO L290 TraceCheckUtils]: 73: Hoare triple {65486#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65479#(< main_~i~0 1012)} is VALID [2022-04-15 12:19:57,782 INFO L290 TraceCheckUtils]: 72: Hoare triple {65486#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65486#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:57,782 INFO L290 TraceCheckUtils]: 71: Hoare triple {65493#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65486#(< main_~i~0 1011)} is VALID [2022-04-15 12:19:57,783 INFO L290 TraceCheckUtils]: 70: Hoare triple {65493#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65493#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:57,783 INFO L290 TraceCheckUtils]: 69: Hoare triple {65500#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65493#(< main_~i~0 1010)} is VALID [2022-04-15 12:19:57,783 INFO L290 TraceCheckUtils]: 68: Hoare triple {65500#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65500#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:57,783 INFO L290 TraceCheckUtils]: 67: Hoare triple {65507#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65500#(< main_~i~0 1009)} is VALID [2022-04-15 12:19:57,784 INFO L290 TraceCheckUtils]: 66: Hoare triple {65507#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65507#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:57,784 INFO L290 TraceCheckUtils]: 65: Hoare triple {65514#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65507#(< main_~i~0 1008)} is VALID [2022-04-15 12:19:57,784 INFO L290 TraceCheckUtils]: 64: Hoare triple {65514#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65514#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:57,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {65521#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65514#(< main_~i~0 1007)} is VALID [2022-04-15 12:19:57,785 INFO L290 TraceCheckUtils]: 62: Hoare triple {65521#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65521#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:57,785 INFO L290 TraceCheckUtils]: 61: Hoare triple {65528#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65521#(< main_~i~0 1006)} is VALID [2022-04-15 12:19:57,785 INFO L290 TraceCheckUtils]: 60: Hoare triple {65528#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65528#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:57,786 INFO L290 TraceCheckUtils]: 59: Hoare triple {65535#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65528#(< main_~i~0 1005)} is VALID [2022-04-15 12:19:57,786 INFO L290 TraceCheckUtils]: 58: Hoare triple {65535#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65535#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:57,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {65542#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65535#(< main_~i~0 1004)} is VALID [2022-04-15 12:19:57,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {65542#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65542#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:57,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {65549#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65542#(< main_~i~0 1003)} is VALID [2022-04-15 12:19:57,787 INFO L290 TraceCheckUtils]: 54: Hoare triple {65549#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65549#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:57,787 INFO L290 TraceCheckUtils]: 53: Hoare triple {65556#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65549#(< main_~i~0 1002)} is VALID [2022-04-15 12:19:57,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {65556#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65556#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:57,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {65563#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65556#(< main_~i~0 1001)} is VALID [2022-04-15 12:19:57,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {65563#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65563#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:57,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {65570#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65563#(< main_~i~0 1000)} is VALID [2022-04-15 12:19:57,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {65570#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65570#(< main_~i~0 999)} is VALID [2022-04-15 12:19:57,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {65577#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65570#(< main_~i~0 999)} is VALID [2022-04-15 12:19:57,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {65577#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65577#(< main_~i~0 998)} is VALID [2022-04-15 12:19:57,790 INFO L290 TraceCheckUtils]: 45: Hoare triple {65584#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65577#(< main_~i~0 998)} is VALID [2022-04-15 12:19:57,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {65584#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65584#(< main_~i~0 997)} is VALID [2022-04-15 12:19:57,790 INFO L290 TraceCheckUtils]: 43: Hoare triple {65591#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65584#(< main_~i~0 997)} is VALID [2022-04-15 12:19:57,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {65591#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65591#(< main_~i~0 996)} is VALID [2022-04-15 12:19:57,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {65598#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65591#(< main_~i~0 996)} is VALID [2022-04-15 12:19:57,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {65598#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65598#(< main_~i~0 995)} is VALID [2022-04-15 12:19:57,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {65605#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65598#(< main_~i~0 995)} is VALID [2022-04-15 12:19:57,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {65605#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65605#(< main_~i~0 994)} is VALID [2022-04-15 12:19:57,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {65612#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65605#(< main_~i~0 994)} is VALID [2022-04-15 12:19:57,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {65612#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65612#(< main_~i~0 993)} is VALID [2022-04-15 12:19:57,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {65619#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65612#(< main_~i~0 993)} is VALID [2022-04-15 12:19:57,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {65619#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65619#(< main_~i~0 992)} is VALID [2022-04-15 12:19:57,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {65626#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65619#(< main_~i~0 992)} is VALID [2022-04-15 12:19:57,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {65626#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65626#(< main_~i~0 991)} is VALID [2022-04-15 12:19:57,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {65633#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65626#(< main_~i~0 991)} is VALID [2022-04-15 12:19:57,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {65633#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65633#(< main_~i~0 990)} is VALID [2022-04-15 12:19:57,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {65640#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65633#(< main_~i~0 990)} is VALID [2022-04-15 12:19:57,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {65640#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65640#(< main_~i~0 989)} is VALID [2022-04-15 12:19:57,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {65647#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65640#(< main_~i~0 989)} is VALID [2022-04-15 12:19:57,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {65647#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65647#(< main_~i~0 988)} is VALID [2022-04-15 12:19:57,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {65654#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65647#(< main_~i~0 988)} is VALID [2022-04-15 12:19:57,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {65654#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65654#(< main_~i~0 987)} is VALID [2022-04-15 12:19:57,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {65661#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65654#(< main_~i~0 987)} is VALID [2022-04-15 12:19:57,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {65661#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65661#(< main_~i~0 986)} is VALID [2022-04-15 12:19:57,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {65668#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65661#(< main_~i~0 986)} is VALID [2022-04-15 12:19:57,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {65668#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65668#(< main_~i~0 985)} is VALID [2022-04-15 12:19:57,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {65675#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65668#(< main_~i~0 985)} is VALID [2022-04-15 12:19:57,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {65675#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65675#(< main_~i~0 984)} is VALID [2022-04-15 12:19:57,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {65682#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65675#(< main_~i~0 984)} is VALID [2022-04-15 12:19:57,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {65682#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65682#(< main_~i~0 983)} is VALID [2022-04-15 12:19:57,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {65689#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65682#(< main_~i~0 983)} is VALID [2022-04-15 12:19:57,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {65689#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65689#(< main_~i~0 982)} is VALID [2022-04-15 12:19:57,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {65696#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65689#(< main_~i~0 982)} is VALID [2022-04-15 12:19:57,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {65696#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65696#(< main_~i~0 981)} is VALID [2022-04-15 12:19:57,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {65703#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65696#(< main_~i~0 981)} is VALID [2022-04-15 12:19:57,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {65703#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65703#(< main_~i~0 980)} is VALID [2022-04-15 12:19:57,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {65710#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65703#(< main_~i~0 980)} is VALID [2022-04-15 12:19:57,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {65710#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65710#(< main_~i~0 979)} is VALID [2022-04-15 12:19:57,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {65717#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65710#(< main_~i~0 979)} is VALID [2022-04-15 12:19:57,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {65717#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65717#(< main_~i~0 978)} is VALID [2022-04-15 12:19:57,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {64951#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {65717#(< main_~i~0 978)} is VALID [2022-04-15 12:19:57,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {64951#true} call #t~ret6 := main(); {64951#true} is VALID [2022-04-15 12:19:57,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64951#true} {64951#true} #64#return; {64951#true} is VALID [2022-04-15 12:19:57,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {64951#true} assume true; {64951#true} is VALID [2022-04-15 12:19:57,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {64951#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {64951#true} is VALID [2022-04-15 12:19:57,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {64951#true} call ULTIMATE.init(); {64951#true} is VALID [2022-04-15 12:19:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:19:57,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522512527] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:57,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:57,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-15 12:19:57,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:57,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [583846084] [2022-04-15 12:19:57,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [583846084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:57,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:57,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 12:19:57,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370346494] [2022-04-15 12:19:57,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:57,802 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-15 12:19:57,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:57,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:57,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:57,863 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 12:19:57,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:57,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 12:19:57,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2022-04-15 12:19:57,865 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:06,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:06,161 INFO L93 Difference]: Finished difference Result 362 states and 460 transitions. [2022-04-15 12:20:06,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 12:20:06,161 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-15 12:20:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 451 transitions. [2022-04-15 12:20:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 451 transitions. [2022-04-15 12:20:06,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 451 transitions. [2022-04-15 12:20:06,451 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:20:06,456 INFO L225 Difference]: With dead ends: 362 [2022-04-15 12:20:06,456 INFO L226 Difference]: Without dead ends: 345 [2022-04-15 12:20:06,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=9218, Invalid=11662, Unknown=0, NotChecked=0, Total=20880 [2022-04-15 12:20:06,457 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1313 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:06,458 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1313 Valid, 32 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:20:06,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-15 12:20:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 118. [2022-04-15 12:20:07,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:07,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:07,037 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:07,037 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:07,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:07,041 INFO L93 Difference]: Finished difference Result 345 states and 439 transitions. [2022-04-15 12:20:07,041 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 439 transitions. [2022-04-15 12:20:07,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:07,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:07,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-15 12:20:07,042 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-15 12:20:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:07,046 INFO L93 Difference]: Finished difference Result 345 states and 439 transitions. [2022-04-15 12:20:07,046 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 439 transitions. [2022-04-15 12:20:07,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:07,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:07,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:07,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2022-04-15 12:20:07,047 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 115 [2022-04-15 12:20:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:07,048 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2022-04-15 12:20:07,048 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:07,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 122 transitions. [2022-04-15 12:20:07,296 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:20:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2022-04-15 12:20:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-15 12:20:07,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:07,297 INFO L499 BasicCegarLoop]: trace histogram [47, 47, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:07,315 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:07,497 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:07,498 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:07,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:07,498 INFO L85 PathProgramCache]: Analyzing trace with hash -873198273, now seen corresponding path program 95 times [2022-04-15 12:20:07,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:07,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [168913417] [2022-04-15 12:20:07,502 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:20:07,502 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:20:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash -873198273, now seen corresponding path program 96 times [2022-04-15 12:20:07,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:07,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134779312] [2022-04-15 12:20:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:07,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:08,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:08,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {67538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {67485#true} is VALID [2022-04-15 12:20:08,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {67485#true} assume true; {67485#true} is VALID [2022-04-15 12:20:08,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67485#true} {67485#true} #64#return; {67485#true} is VALID [2022-04-15 12:20:08,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {67485#true} call ULTIMATE.init(); {67538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:08,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {67538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {67485#true} is VALID [2022-04-15 12:20:08,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {67485#true} assume true; {67485#true} is VALID [2022-04-15 12:20:08,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67485#true} {67485#true} #64#return; {67485#true} is VALID [2022-04-15 12:20:08,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {67485#true} call #t~ret6 := main(); {67485#true} is VALID [2022-04-15 12:20:08,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {67485#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {67490#(= main_~i~0 0)} is VALID [2022-04-15 12:20:08,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {67490#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67490#(= main_~i~0 0)} is VALID [2022-04-15 12:20:08,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {67490#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67491#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:08,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {67491#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67491#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:08,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {67491#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67492#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:08,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {67492#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67492#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:08,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {67492#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67493#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:08,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {67493#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67493#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:08,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {67493#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67494#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:08,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {67494#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67494#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:08,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {67494#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67495#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:08,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {67495#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67495#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:08,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {67495#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67496#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:08,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {67496#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67496#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:08,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {67496#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67497#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:08,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {67497#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67497#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:08,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {67497#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67498#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:08,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {67498#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67498#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:08,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {67498#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67499#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:08,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {67499#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67499#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:08,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {67499#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67500#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:08,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {67500#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67500#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:08,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {67500#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67501#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:08,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {67501#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67501#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:08,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {67501#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67502#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:08,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {67502#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67502#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:08,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {67502#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67503#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:08,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {67503#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67503#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:08,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {67503#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67504#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:08,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {67504#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67504#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:08,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {67504#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67505#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:08,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {67505#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67505#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:08,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {67505#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67506#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:08,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {67506#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67506#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:08,321 INFO L290 TraceCheckUtils]: 39: Hoare triple {67506#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67507#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:08,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {67507#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67507#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:08,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {67507#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67508#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:08,322 INFO L290 TraceCheckUtils]: 42: Hoare triple {67508#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67508#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:08,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {67508#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67509#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:08,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {67509#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67509#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:08,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {67509#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67510#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:08,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {67510#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67510#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:08,324 INFO L290 TraceCheckUtils]: 47: Hoare triple {67510#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67511#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:08,324 INFO L290 TraceCheckUtils]: 48: Hoare triple {67511#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67511#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:08,324 INFO L290 TraceCheckUtils]: 49: Hoare triple {67511#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67512#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:08,324 INFO L290 TraceCheckUtils]: 50: Hoare triple {67512#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67512#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:08,325 INFO L290 TraceCheckUtils]: 51: Hoare triple {67512#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67513#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:08,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {67513#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67513#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:08,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {67513#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67514#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:08,326 INFO L290 TraceCheckUtils]: 54: Hoare triple {67514#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67514#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:08,326 INFO L290 TraceCheckUtils]: 55: Hoare triple {67514#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67515#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:08,326 INFO L290 TraceCheckUtils]: 56: Hoare triple {67515#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67515#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:08,326 INFO L290 TraceCheckUtils]: 57: Hoare triple {67515#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67516#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:08,327 INFO L290 TraceCheckUtils]: 58: Hoare triple {67516#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67516#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:08,327 INFO L290 TraceCheckUtils]: 59: Hoare triple {67516#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67517#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:08,327 INFO L290 TraceCheckUtils]: 60: Hoare triple {67517#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67517#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:08,328 INFO L290 TraceCheckUtils]: 61: Hoare triple {67517#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67518#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:08,328 INFO L290 TraceCheckUtils]: 62: Hoare triple {67518#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67518#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:08,328 INFO L290 TraceCheckUtils]: 63: Hoare triple {67518#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67519#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:08,328 INFO L290 TraceCheckUtils]: 64: Hoare triple {67519#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67519#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:08,329 INFO L290 TraceCheckUtils]: 65: Hoare triple {67519#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67520#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:08,329 INFO L290 TraceCheckUtils]: 66: Hoare triple {67520#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67520#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:08,329 INFO L290 TraceCheckUtils]: 67: Hoare triple {67520#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67521#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:08,330 INFO L290 TraceCheckUtils]: 68: Hoare triple {67521#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67521#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:08,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {67521#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67522#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:08,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {67522#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67522#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:08,330 INFO L290 TraceCheckUtils]: 71: Hoare triple {67522#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67523#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:08,340 INFO L290 TraceCheckUtils]: 72: Hoare triple {67523#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67523#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:08,341 INFO L290 TraceCheckUtils]: 73: Hoare triple {67523#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67524#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:08,341 INFO L290 TraceCheckUtils]: 74: Hoare triple {67524#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67524#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:08,341 INFO L290 TraceCheckUtils]: 75: Hoare triple {67524#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67525#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:08,341 INFO L290 TraceCheckUtils]: 76: Hoare triple {67525#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67525#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:08,342 INFO L290 TraceCheckUtils]: 77: Hoare triple {67525#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67526#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:08,342 INFO L290 TraceCheckUtils]: 78: Hoare triple {67526#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67526#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:08,342 INFO L290 TraceCheckUtils]: 79: Hoare triple {67526#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67527#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:08,342 INFO L290 TraceCheckUtils]: 80: Hoare triple {67527#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67527#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:08,343 INFO L290 TraceCheckUtils]: 81: Hoare triple {67527#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67528#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:08,343 INFO L290 TraceCheckUtils]: 82: Hoare triple {67528#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67528#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:08,343 INFO L290 TraceCheckUtils]: 83: Hoare triple {67528#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67529#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:08,344 INFO L290 TraceCheckUtils]: 84: Hoare triple {67529#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67529#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:08,344 INFO L290 TraceCheckUtils]: 85: Hoare triple {67529#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67530#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:08,344 INFO L290 TraceCheckUtils]: 86: Hoare triple {67530#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67530#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:08,344 INFO L290 TraceCheckUtils]: 87: Hoare triple {67530#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67531#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:08,345 INFO L290 TraceCheckUtils]: 88: Hoare triple {67531#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67531#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:08,345 INFO L290 TraceCheckUtils]: 89: Hoare triple {67531#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67532#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:08,345 INFO L290 TraceCheckUtils]: 90: Hoare triple {67532#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67532#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:08,346 INFO L290 TraceCheckUtils]: 91: Hoare triple {67532#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67533#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:08,346 INFO L290 TraceCheckUtils]: 92: Hoare triple {67533#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67533#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:08,346 INFO L290 TraceCheckUtils]: 93: Hoare triple {67533#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67534#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:08,346 INFO L290 TraceCheckUtils]: 94: Hoare triple {67534#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67534#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:08,347 INFO L290 TraceCheckUtils]: 95: Hoare triple {67534#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67535#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:08,347 INFO L290 TraceCheckUtils]: 96: Hoare triple {67535#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67535#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:08,347 INFO L290 TraceCheckUtils]: 97: Hoare triple {67535#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67536#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:08,347 INFO L290 TraceCheckUtils]: 98: Hoare triple {67536#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67536#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:08,348 INFO L290 TraceCheckUtils]: 99: Hoare triple {67536#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67537#(<= main_~i~0 47)} is VALID [2022-04-15 12:20:08,348 INFO L290 TraceCheckUtils]: 100: Hoare triple {67537#(<= main_~i~0 47)} assume !(~i~0 < 1024); {67486#false} is VALID [2022-04-15 12:20:08,348 INFO L290 TraceCheckUtils]: 101: Hoare triple {67486#false} ~i~0 := 0; {67486#false} is VALID [2022-04-15 12:20:08,348 INFO L290 TraceCheckUtils]: 102: Hoare triple {67486#false} #t~short5 := ~i~0 < 1024; {67486#false} is VALID [2022-04-15 12:20:08,348 INFO L290 TraceCheckUtils]: 103: Hoare triple {67486#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67486#false} is VALID [2022-04-15 12:20:08,348 INFO L290 TraceCheckUtils]: 104: Hoare triple {67486#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67486#false} is VALID [2022-04-15 12:20:08,348 INFO L290 TraceCheckUtils]: 105: Hoare triple {67486#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67486#false} is VALID [2022-04-15 12:20:08,348 INFO L290 TraceCheckUtils]: 106: Hoare triple {67486#false} #t~short5 := ~i~0 < 1024; {67486#false} is VALID [2022-04-15 12:20:08,348 INFO L290 TraceCheckUtils]: 107: Hoare triple {67486#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67486#false} is VALID [2022-04-15 12:20:08,349 INFO L290 TraceCheckUtils]: 108: Hoare triple {67486#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67486#false} is VALID [2022-04-15 12:20:08,349 INFO L290 TraceCheckUtils]: 109: Hoare triple {67486#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67486#false} is VALID [2022-04-15 12:20:08,349 INFO L290 TraceCheckUtils]: 110: Hoare triple {67486#false} #t~short5 := ~i~0 < 1024; {67486#false} is VALID [2022-04-15 12:20:08,349 INFO L290 TraceCheckUtils]: 111: Hoare triple {67486#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67486#false} is VALID [2022-04-15 12:20:08,349 INFO L290 TraceCheckUtils]: 112: Hoare triple {67486#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {67486#false} is VALID [2022-04-15 12:20:08,349 INFO L272 TraceCheckUtils]: 113: Hoare triple {67486#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {67486#false} is VALID [2022-04-15 12:20:08,349 INFO L290 TraceCheckUtils]: 114: Hoare triple {67486#false} ~cond := #in~cond; {67486#false} is VALID [2022-04-15 12:20:08,349 INFO L290 TraceCheckUtils]: 115: Hoare triple {67486#false} assume 0 == ~cond; {67486#false} is VALID [2022-04-15 12:20:08,349 INFO L290 TraceCheckUtils]: 116: Hoare triple {67486#false} assume !false; {67486#false} is VALID [2022-04-15 12:20:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2219 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:20:08,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:08,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134779312] [2022-04-15 12:20:08,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134779312] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:08,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497801636] [2022-04-15 12:20:08,350 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:20:08,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:08,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:08,351 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:08,351 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:08,583 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:20:08,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:08,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:20:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:08,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:08,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {67485#true} call ULTIMATE.init(); {67485#true} is VALID [2022-04-15 12:20:08,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {67485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {67485#true} is VALID [2022-04-15 12:20:08,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {67485#true} assume true; {67485#true} is VALID [2022-04-15 12:20:08,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67485#true} {67485#true} #64#return; {67485#true} is VALID [2022-04-15 12:20:08,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {67485#true} call #t~ret6 := main(); {67485#true} is VALID [2022-04-15 12:20:08,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {67485#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {67485#true} is VALID [2022-04-15 12:20:08,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 38: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 39: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 40: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 41: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 42: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 45: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 46: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 47: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,846 INFO L290 TraceCheckUtils]: 48: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 49: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 50: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 51: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 52: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 53: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 55: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 56: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 60: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 61: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 62: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 63: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 64: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 65: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 66: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 67: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,847 INFO L290 TraceCheckUtils]: 68: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 69: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 70: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 71: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 72: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 73: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 74: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 75: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 76: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 77: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 78: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 79: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 80: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 81: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 82: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 83: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 84: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 85: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 86: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 87: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,848 INFO L290 TraceCheckUtils]: 88: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,849 INFO L290 TraceCheckUtils]: 89: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,849 INFO L290 TraceCheckUtils]: 90: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,849 INFO L290 TraceCheckUtils]: 91: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,849 INFO L290 TraceCheckUtils]: 92: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,849 INFO L290 TraceCheckUtils]: 93: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,849 INFO L290 TraceCheckUtils]: 94: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,849 INFO L290 TraceCheckUtils]: 95: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,849 INFO L290 TraceCheckUtils]: 96: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,849 INFO L290 TraceCheckUtils]: 97: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,849 INFO L290 TraceCheckUtils]: 98: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:08,849 INFO L290 TraceCheckUtils]: 99: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:08,849 INFO L290 TraceCheckUtils]: 100: Hoare triple {67485#true} assume !(~i~0 < 1024); {67485#true} is VALID [2022-04-15 12:20:08,849 INFO L290 TraceCheckUtils]: 101: Hoare triple {67485#true} ~i~0 := 0; {67845#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:08,850 INFO L290 TraceCheckUtils]: 102: Hoare triple {67845#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {67845#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:08,850 INFO L290 TraceCheckUtils]: 103: Hoare triple {67845#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67845#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:08,850 INFO L290 TraceCheckUtils]: 104: Hoare triple {67845#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67845#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:08,851 INFO L290 TraceCheckUtils]: 105: Hoare triple {67845#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67491#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:08,851 INFO L290 TraceCheckUtils]: 106: Hoare triple {67491#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {67491#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:08,851 INFO L290 TraceCheckUtils]: 107: Hoare triple {67491#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67491#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:08,851 INFO L290 TraceCheckUtils]: 108: Hoare triple {67491#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67491#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:08,852 INFO L290 TraceCheckUtils]: 109: Hoare triple {67491#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67492#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:08,852 INFO L290 TraceCheckUtils]: 110: Hoare triple {67492#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {67492#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:08,852 INFO L290 TraceCheckUtils]: 111: Hoare triple {67492#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67492#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:08,852 INFO L290 TraceCheckUtils]: 112: Hoare triple {67492#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {67492#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:08,853 INFO L272 TraceCheckUtils]: 113: Hoare triple {67492#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {67882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:20:08,853 INFO L290 TraceCheckUtils]: 114: Hoare triple {67882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {67886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:20:08,853 INFO L290 TraceCheckUtils]: 115: Hoare triple {67886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {67486#false} is VALID [2022-04-15 12:20:08,853 INFO L290 TraceCheckUtils]: 116: Hoare triple {67486#false} assume !false; {67486#false} is VALID [2022-04-15 12:20:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2022-04-15 12:20:08,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:09,137 INFO L290 TraceCheckUtils]: 116: Hoare triple {67486#false} assume !false; {67486#false} is VALID [2022-04-15 12:20:09,138 INFO L290 TraceCheckUtils]: 115: Hoare triple {67886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {67486#false} is VALID [2022-04-15 12:20:09,138 INFO L290 TraceCheckUtils]: 114: Hoare triple {67882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {67886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:20:09,138 INFO L272 TraceCheckUtils]: 113: Hoare triple {67902#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {67882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:20:09,139 INFO L290 TraceCheckUtils]: 112: Hoare triple {67902#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {67902#(<= main_~i~0 512)} is VALID [2022-04-15 12:20:09,139 INFO L290 TraceCheckUtils]: 111: Hoare triple {67902#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67902#(<= main_~i~0 512)} is VALID [2022-04-15 12:20:09,139 INFO L290 TraceCheckUtils]: 110: Hoare triple {67902#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {67902#(<= main_~i~0 512)} is VALID [2022-04-15 12:20:09,140 INFO L290 TraceCheckUtils]: 109: Hoare triple {67915#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67902#(<= main_~i~0 512)} is VALID [2022-04-15 12:20:09,140 INFO L290 TraceCheckUtils]: 108: Hoare triple {67915#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67915#(<= main_~i~0 511)} is VALID [2022-04-15 12:20:09,140 INFO L290 TraceCheckUtils]: 107: Hoare triple {67915#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67915#(<= main_~i~0 511)} is VALID [2022-04-15 12:20:09,140 INFO L290 TraceCheckUtils]: 106: Hoare triple {67915#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {67915#(<= main_~i~0 511)} is VALID [2022-04-15 12:20:09,141 INFO L290 TraceCheckUtils]: 105: Hoare triple {67928#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67915#(<= main_~i~0 511)} is VALID [2022-04-15 12:20:09,141 INFO L290 TraceCheckUtils]: 104: Hoare triple {67928#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67928#(<= main_~i~0 510)} is VALID [2022-04-15 12:20:09,141 INFO L290 TraceCheckUtils]: 103: Hoare triple {67928#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67928#(<= main_~i~0 510)} is VALID [2022-04-15 12:20:09,141 INFO L290 TraceCheckUtils]: 102: Hoare triple {67928#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {67928#(<= main_~i~0 510)} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 101: Hoare triple {67485#true} ~i~0 := 0; {67928#(<= main_~i~0 510)} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 100: Hoare triple {67485#true} assume !(~i~0 < 1024); {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 99: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 98: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 97: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 96: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 95: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 94: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 93: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 92: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 91: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 90: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 89: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 88: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 87: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 86: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 85: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,142 INFO L290 TraceCheckUtils]: 84: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 83: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 82: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 81: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 80: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 79: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 78: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 77: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 76: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 75: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 74: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 73: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 72: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 71: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 70: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 69: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 68: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 67: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 66: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,143 INFO L290 TraceCheckUtils]: 65: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 64: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 63: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 60: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 59: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 58: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 57: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 55: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 54: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 52: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 51: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 50: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 49: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 46: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 12:20:09,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {67485#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {67485#true} is VALID [2022-04-15 12:20:09,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {67485#true} call #t~ret6 := main(); {67485#true} is VALID [2022-04-15 12:20:09,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67485#true} {67485#true} #64#return; {67485#true} is VALID [2022-04-15 12:20:09,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {67485#true} assume true; {67485#true} is VALID [2022-04-15 12:20:09,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {67485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {67485#true} is VALID [2022-04-15 12:20:09,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {67485#true} call ULTIMATE.init(); {67485#true} is VALID [2022-04-15 12:20:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2022-04-15 12:20:09,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497801636] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:09,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:09,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 7, 7] total 57 [2022-04-15 12:20:09,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:09,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [168913417] [2022-04-15 12:20:09,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [168913417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:09,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:09,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-15 12:20:09,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065453011] [2022-04-15 12:20:09,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:09,148 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-15 12:20:09,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:09,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:09,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:09,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-15 12:20:09,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:09,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-15 12:20:09,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1437, Invalid=1755, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:20:09,212 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:17,686 INFO L93 Difference]: Finished difference Result 369 states and 469 transitions. [2022-04-15 12:20:17,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 12:20:17,687 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-15 12:20:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 460 transitions. [2022-04-15 12:20:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 460 transitions. [2022-04-15 12:20:17,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 460 transitions. [2022-04-15 12:20:17,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:17,994 INFO L225 Difference]: With dead ends: 369 [2022-04-15 12:20:17,994 INFO L226 Difference]: Without dead ends: 352 [2022-04-15 12:20:17,995 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4030, Invalid=6890, Unknown=0, NotChecked=0, Total=10920 [2022-04-15 12:20:17,995 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1038 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:17,995 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1038 Valid, 42 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:20:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-15 12:20:18,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 120. [2022-04-15 12:20:18,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:18,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:18,622 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:18,622 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:18,627 INFO L93 Difference]: Finished difference Result 352 states and 448 transitions. [2022-04-15 12:20:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 448 transitions. [2022-04-15 12:20:18,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:18,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:18,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 352 states. [2022-04-15 12:20:18,627 INFO L87 Difference]: Start difference. First operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 352 states. [2022-04-15 12:20:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:18,631 INFO L93 Difference]: Finished difference Result 352 states and 448 transitions. [2022-04-15 12:20:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 448 transitions. [2022-04-15 12:20:18,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:18,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:18,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:18,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2022-04-15 12:20:18,633 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 117 [2022-04-15 12:20:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:18,633 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2022-04-15 12:20:18,633 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:18,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 124 transitions. [2022-04-15 12:20:18,894 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:20:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-04-15 12:20:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 12:20:18,895 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:18,895 INFO L499 BasicCegarLoop]: trace histogram [48, 48, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:18,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-04-15 12:20:19,095 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:20:19,095 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:19,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:19,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2055098589, now seen corresponding path program 97 times [2022-04-15 12:20:19,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:19,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1519869351] [2022-04-15 12:20:19,102 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:20:19,102 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:20:19,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2055098589, now seen corresponding path program 98 times [2022-04-15 12:20:19,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:19,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007660885] [2022-04-15 12:20:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:19,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:19,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:19,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {70078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {70024#true} is VALID [2022-04-15 12:20:19,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {70024#true} assume true; {70024#true} is VALID [2022-04-15 12:20:19,971 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70024#true} {70024#true} #64#return; {70024#true} is VALID [2022-04-15 12:20:19,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {70024#true} call ULTIMATE.init(); {70078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:19,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {70078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {70024#true} is VALID [2022-04-15 12:20:19,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {70024#true} assume true; {70024#true} is VALID [2022-04-15 12:20:19,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70024#true} {70024#true} #64#return; {70024#true} is VALID [2022-04-15 12:20:19,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {70024#true} call #t~ret6 := main(); {70024#true} is VALID [2022-04-15 12:20:19,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {70024#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {70029#(= main_~i~0 0)} is VALID [2022-04-15 12:20:19,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {70029#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70029#(= main_~i~0 0)} is VALID [2022-04-15 12:20:19,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {70029#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70030#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:19,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {70030#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70030#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:19,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {70030#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70031#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:19,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {70031#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70031#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:19,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {70031#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70032#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:19,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {70032#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70032#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:19,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {70032#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70033#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:19,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {70033#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70033#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:19,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {70033#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70034#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:19,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {70034#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70034#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:19,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {70034#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70035#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:19,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {70035#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70035#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:19,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {70035#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70036#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:19,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {70036#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70036#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:19,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {70036#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70037#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:19,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {70037#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70037#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:19,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {70037#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70038#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:19,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {70038#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70038#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:19,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {70038#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70039#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:19,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {70039#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70039#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:19,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {70039#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70040#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:19,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {70040#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70040#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:19,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {70040#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70041#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:19,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {70041#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70041#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:19,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {70041#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70042#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:19,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {70042#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70042#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:19,989 INFO L290 TraceCheckUtils]: 33: Hoare triple {70042#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70043#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:19,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {70043#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70043#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:19,990 INFO L290 TraceCheckUtils]: 35: Hoare triple {70043#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70044#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:19,990 INFO L290 TraceCheckUtils]: 36: Hoare triple {70044#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70044#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:19,991 INFO L290 TraceCheckUtils]: 37: Hoare triple {70044#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70045#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:19,991 INFO L290 TraceCheckUtils]: 38: Hoare triple {70045#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70045#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:19,991 INFO L290 TraceCheckUtils]: 39: Hoare triple {70045#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70046#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:19,991 INFO L290 TraceCheckUtils]: 40: Hoare triple {70046#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70046#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:19,992 INFO L290 TraceCheckUtils]: 41: Hoare triple {70046#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70047#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:19,992 INFO L290 TraceCheckUtils]: 42: Hoare triple {70047#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70047#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:19,992 INFO L290 TraceCheckUtils]: 43: Hoare triple {70047#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70048#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:19,993 INFO L290 TraceCheckUtils]: 44: Hoare triple {70048#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70048#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:19,993 INFO L290 TraceCheckUtils]: 45: Hoare triple {70048#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70049#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:19,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {70049#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70049#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:19,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {70049#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70050#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:19,994 INFO L290 TraceCheckUtils]: 48: Hoare triple {70050#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70050#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:19,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {70050#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70051#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:19,994 INFO L290 TraceCheckUtils]: 50: Hoare triple {70051#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70051#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:19,994 INFO L290 TraceCheckUtils]: 51: Hoare triple {70051#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70052#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:19,995 INFO L290 TraceCheckUtils]: 52: Hoare triple {70052#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70052#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:19,995 INFO L290 TraceCheckUtils]: 53: Hoare triple {70052#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70053#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:19,995 INFO L290 TraceCheckUtils]: 54: Hoare triple {70053#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70053#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:19,996 INFO L290 TraceCheckUtils]: 55: Hoare triple {70053#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70054#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:19,996 INFO L290 TraceCheckUtils]: 56: Hoare triple {70054#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70054#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:19,996 INFO L290 TraceCheckUtils]: 57: Hoare triple {70054#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70055#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:19,996 INFO L290 TraceCheckUtils]: 58: Hoare triple {70055#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70055#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:19,997 INFO L290 TraceCheckUtils]: 59: Hoare triple {70055#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70056#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:19,997 INFO L290 TraceCheckUtils]: 60: Hoare triple {70056#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70056#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:19,997 INFO L290 TraceCheckUtils]: 61: Hoare triple {70056#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70057#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:19,998 INFO L290 TraceCheckUtils]: 62: Hoare triple {70057#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70057#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:19,998 INFO L290 TraceCheckUtils]: 63: Hoare triple {70057#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70058#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:19,998 INFO L290 TraceCheckUtils]: 64: Hoare triple {70058#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70058#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:19,998 INFO L290 TraceCheckUtils]: 65: Hoare triple {70058#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70059#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:19,999 INFO L290 TraceCheckUtils]: 66: Hoare triple {70059#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70059#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:19,999 INFO L290 TraceCheckUtils]: 67: Hoare triple {70059#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70060#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:19,999 INFO L290 TraceCheckUtils]: 68: Hoare triple {70060#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70060#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:20,000 INFO L290 TraceCheckUtils]: 69: Hoare triple {70060#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70061#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:20,000 INFO L290 TraceCheckUtils]: 70: Hoare triple {70061#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70061#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:20,000 INFO L290 TraceCheckUtils]: 71: Hoare triple {70061#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70062#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:20,000 INFO L290 TraceCheckUtils]: 72: Hoare triple {70062#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70062#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:20,001 INFO L290 TraceCheckUtils]: 73: Hoare triple {70062#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70063#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:20,001 INFO L290 TraceCheckUtils]: 74: Hoare triple {70063#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70063#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:20,001 INFO L290 TraceCheckUtils]: 75: Hoare triple {70063#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70064#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:20,001 INFO L290 TraceCheckUtils]: 76: Hoare triple {70064#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70064#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:20,002 INFO L290 TraceCheckUtils]: 77: Hoare triple {70064#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70065#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:20,002 INFO L290 TraceCheckUtils]: 78: Hoare triple {70065#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70065#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:20,002 INFO L290 TraceCheckUtils]: 79: Hoare triple {70065#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70066#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:20,003 INFO L290 TraceCheckUtils]: 80: Hoare triple {70066#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70066#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:20,003 INFO L290 TraceCheckUtils]: 81: Hoare triple {70066#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70067#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:20,003 INFO L290 TraceCheckUtils]: 82: Hoare triple {70067#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70067#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:20,004 INFO L290 TraceCheckUtils]: 83: Hoare triple {70067#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70068#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:20,004 INFO L290 TraceCheckUtils]: 84: Hoare triple {70068#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70068#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:20,004 INFO L290 TraceCheckUtils]: 85: Hoare triple {70068#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70069#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:20,004 INFO L290 TraceCheckUtils]: 86: Hoare triple {70069#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70069#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:20,005 INFO L290 TraceCheckUtils]: 87: Hoare triple {70069#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70070#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:20,005 INFO L290 TraceCheckUtils]: 88: Hoare triple {70070#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70070#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:20,005 INFO L290 TraceCheckUtils]: 89: Hoare triple {70070#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70071#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:20,005 INFO L290 TraceCheckUtils]: 90: Hoare triple {70071#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70071#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:20,006 INFO L290 TraceCheckUtils]: 91: Hoare triple {70071#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70072#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:20,006 INFO L290 TraceCheckUtils]: 92: Hoare triple {70072#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70072#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:20,006 INFO L290 TraceCheckUtils]: 93: Hoare triple {70072#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70073#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:20,007 INFO L290 TraceCheckUtils]: 94: Hoare triple {70073#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70073#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:20,007 INFO L290 TraceCheckUtils]: 95: Hoare triple {70073#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70074#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:20,007 INFO L290 TraceCheckUtils]: 96: Hoare triple {70074#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70074#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:20,007 INFO L290 TraceCheckUtils]: 97: Hoare triple {70074#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70075#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:20,008 INFO L290 TraceCheckUtils]: 98: Hoare triple {70075#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70075#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:20,008 INFO L290 TraceCheckUtils]: 99: Hoare triple {70075#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70076#(<= main_~i~0 47)} is VALID [2022-04-15 12:20:20,008 INFO L290 TraceCheckUtils]: 100: Hoare triple {70076#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70076#(<= main_~i~0 47)} is VALID [2022-04-15 12:20:20,009 INFO L290 TraceCheckUtils]: 101: Hoare triple {70076#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70077#(<= main_~i~0 48)} is VALID [2022-04-15 12:20:20,009 INFO L290 TraceCheckUtils]: 102: Hoare triple {70077#(<= main_~i~0 48)} assume !(~i~0 < 1024); {70025#false} is VALID [2022-04-15 12:20:20,009 INFO L290 TraceCheckUtils]: 103: Hoare triple {70025#false} ~i~0 := 0; {70025#false} is VALID [2022-04-15 12:20:20,009 INFO L290 TraceCheckUtils]: 104: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 12:20:20,009 INFO L290 TraceCheckUtils]: 105: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 12:20:20,009 INFO L290 TraceCheckUtils]: 106: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 12:20:20,009 INFO L290 TraceCheckUtils]: 107: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-15 12:20:20,009 INFO L290 TraceCheckUtils]: 108: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 12:20:20,009 INFO L290 TraceCheckUtils]: 109: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 12:20:20,009 INFO L290 TraceCheckUtils]: 110: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 12:20:20,009 INFO L290 TraceCheckUtils]: 111: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-15 12:20:20,009 INFO L290 TraceCheckUtils]: 112: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 12:20:20,009 INFO L290 TraceCheckUtils]: 113: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 12:20:20,010 INFO L290 TraceCheckUtils]: 114: Hoare triple {70025#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 12:20:20,010 INFO L272 TraceCheckUtils]: 115: Hoare triple {70025#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {70025#false} is VALID [2022-04-15 12:20:20,010 INFO L290 TraceCheckUtils]: 116: Hoare triple {70025#false} ~cond := #in~cond; {70025#false} is VALID [2022-04-15 12:20:20,010 INFO L290 TraceCheckUtils]: 117: Hoare triple {70025#false} assume 0 == ~cond; {70025#false} is VALID [2022-04-15 12:20:20,010 INFO L290 TraceCheckUtils]: 118: Hoare triple {70025#false} assume !false; {70025#false} is VALID [2022-04-15 12:20:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:20:20,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:20,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007660885] [2022-04-15 12:20:20,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007660885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:20,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106604466] [2022-04-15 12:20:20,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:20:20,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:20,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:20,011 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:20:20,012 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:20:20,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:20:20,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:20,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-15 12:20:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:20,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:20,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {70024#true} call ULTIMATE.init(); {70024#true} is VALID [2022-04-15 12:20:20,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {70024#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {70024#true} is VALID [2022-04-15 12:20:20,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {70024#true} assume true; {70024#true} is VALID [2022-04-15 12:20:20,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70024#true} {70024#true} #64#return; {70024#true} is VALID [2022-04-15 12:20:20,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {70024#true} call #t~ret6 := main(); {70024#true} is VALID [2022-04-15 12:20:20,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {70024#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {70097#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:20,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {70097#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70097#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:20,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {70097#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70030#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:20,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {70030#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70030#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:20,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {70030#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70031#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:20,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {70031#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70031#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:20,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {70031#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70032#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:20,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {70032#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70032#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:20,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {70032#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70033#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:20,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {70033#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70033#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:20,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {70033#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70034#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:20,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {70034#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70034#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:20,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {70034#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70035#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:20,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {70035#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70035#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:20,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {70035#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70036#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:20,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {70036#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70036#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:20,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {70036#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70037#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:20,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {70037#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70037#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:20,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {70037#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70038#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:20,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {70038#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70038#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:20,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {70038#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70039#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:20,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {70039#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70039#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:20,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {70039#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70040#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:20,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {70040#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70040#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:20,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {70040#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70041#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:20,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {70041#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70041#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:20,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {70041#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70042#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:20,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {70042#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70042#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:20,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {70042#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70043#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:20,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {70043#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70043#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:20,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {70043#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70044#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:20,866 INFO L290 TraceCheckUtils]: 36: Hoare triple {70044#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70044#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:20,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {70044#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70045#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:20,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {70045#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70045#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:20,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {70045#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70046#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:20,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {70046#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70046#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:20,868 INFO L290 TraceCheckUtils]: 41: Hoare triple {70046#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70047#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:20,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {70047#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70047#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:20,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {70047#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70048#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:20,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {70048#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70048#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:20,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {70048#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70049#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:20,869 INFO L290 TraceCheckUtils]: 46: Hoare triple {70049#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70049#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:20,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {70049#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70050#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:20,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {70050#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70050#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:20,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {70050#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70051#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:20,870 INFO L290 TraceCheckUtils]: 50: Hoare triple {70051#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70051#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:20,871 INFO L290 TraceCheckUtils]: 51: Hoare triple {70051#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70052#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:20,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {70052#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70052#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:20,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {70052#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70053#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:20,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {70053#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70053#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:20,872 INFO L290 TraceCheckUtils]: 55: Hoare triple {70053#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70054#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:20,872 INFO L290 TraceCheckUtils]: 56: Hoare triple {70054#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70054#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:20,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {70054#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70055#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:20,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {70055#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70055#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:20,873 INFO L290 TraceCheckUtils]: 59: Hoare triple {70055#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70056#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:20,873 INFO L290 TraceCheckUtils]: 60: Hoare triple {70056#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70056#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:20,873 INFO L290 TraceCheckUtils]: 61: Hoare triple {70056#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70057#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:20,874 INFO L290 TraceCheckUtils]: 62: Hoare triple {70057#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70057#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:20,874 INFO L290 TraceCheckUtils]: 63: Hoare triple {70057#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70058#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:20,874 INFO L290 TraceCheckUtils]: 64: Hoare triple {70058#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70058#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:20,874 INFO L290 TraceCheckUtils]: 65: Hoare triple {70058#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70059#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:20,875 INFO L290 TraceCheckUtils]: 66: Hoare triple {70059#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70059#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:20,875 INFO L290 TraceCheckUtils]: 67: Hoare triple {70059#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70060#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:20,875 INFO L290 TraceCheckUtils]: 68: Hoare triple {70060#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70060#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:20,876 INFO L290 TraceCheckUtils]: 69: Hoare triple {70060#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70061#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:20,876 INFO L290 TraceCheckUtils]: 70: Hoare triple {70061#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70061#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:20,876 INFO L290 TraceCheckUtils]: 71: Hoare triple {70061#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70062#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:20,876 INFO L290 TraceCheckUtils]: 72: Hoare triple {70062#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70062#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:20,877 INFO L290 TraceCheckUtils]: 73: Hoare triple {70062#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70063#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:20,877 INFO L290 TraceCheckUtils]: 74: Hoare triple {70063#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70063#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:20,877 INFO L290 TraceCheckUtils]: 75: Hoare triple {70063#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70064#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:20,877 INFO L290 TraceCheckUtils]: 76: Hoare triple {70064#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70064#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:20,878 INFO L290 TraceCheckUtils]: 77: Hoare triple {70064#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70065#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:20,878 INFO L290 TraceCheckUtils]: 78: Hoare triple {70065#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70065#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:20,878 INFO L290 TraceCheckUtils]: 79: Hoare triple {70065#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70066#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:20,879 INFO L290 TraceCheckUtils]: 80: Hoare triple {70066#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70066#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:20,879 INFO L290 TraceCheckUtils]: 81: Hoare triple {70066#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70067#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:20,879 INFO L290 TraceCheckUtils]: 82: Hoare triple {70067#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70067#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:20,879 INFO L290 TraceCheckUtils]: 83: Hoare triple {70067#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70068#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:20,880 INFO L290 TraceCheckUtils]: 84: Hoare triple {70068#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70068#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:20,880 INFO L290 TraceCheckUtils]: 85: Hoare triple {70068#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70069#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:20,880 INFO L290 TraceCheckUtils]: 86: Hoare triple {70069#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70069#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:20,881 INFO L290 TraceCheckUtils]: 87: Hoare triple {70069#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70070#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:20,881 INFO L290 TraceCheckUtils]: 88: Hoare triple {70070#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70070#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:20,881 INFO L290 TraceCheckUtils]: 89: Hoare triple {70070#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70071#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:20,881 INFO L290 TraceCheckUtils]: 90: Hoare triple {70071#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70071#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:20,882 INFO L290 TraceCheckUtils]: 91: Hoare triple {70071#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70072#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:20,882 INFO L290 TraceCheckUtils]: 92: Hoare triple {70072#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70072#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:20,882 INFO L290 TraceCheckUtils]: 93: Hoare triple {70072#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70073#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:20,882 INFO L290 TraceCheckUtils]: 94: Hoare triple {70073#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70073#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:20,883 INFO L290 TraceCheckUtils]: 95: Hoare triple {70073#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70074#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:20,883 INFO L290 TraceCheckUtils]: 96: Hoare triple {70074#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70074#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:20,883 INFO L290 TraceCheckUtils]: 97: Hoare triple {70074#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70075#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:20,884 INFO L290 TraceCheckUtils]: 98: Hoare triple {70075#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70075#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:20,884 INFO L290 TraceCheckUtils]: 99: Hoare triple {70075#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70076#(<= main_~i~0 47)} is VALID [2022-04-15 12:20:20,884 INFO L290 TraceCheckUtils]: 100: Hoare triple {70076#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70076#(<= main_~i~0 47)} is VALID [2022-04-15 12:20:20,884 INFO L290 TraceCheckUtils]: 101: Hoare triple {70076#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70077#(<= main_~i~0 48)} is VALID [2022-04-15 12:20:20,885 INFO L290 TraceCheckUtils]: 102: Hoare triple {70077#(<= main_~i~0 48)} assume !(~i~0 < 1024); {70025#false} is VALID [2022-04-15 12:20:20,885 INFO L290 TraceCheckUtils]: 103: Hoare triple {70025#false} ~i~0 := 0; {70025#false} is VALID [2022-04-15 12:20:20,885 INFO L290 TraceCheckUtils]: 104: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 12:20:20,885 INFO L290 TraceCheckUtils]: 105: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 12:20:20,885 INFO L290 TraceCheckUtils]: 106: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 12:20:20,885 INFO L290 TraceCheckUtils]: 107: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-15 12:20:20,885 INFO L290 TraceCheckUtils]: 108: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 12:20:20,885 INFO L290 TraceCheckUtils]: 109: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 12:20:20,885 INFO L290 TraceCheckUtils]: 110: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 12:20:20,885 INFO L290 TraceCheckUtils]: 111: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-15 12:20:20,885 INFO L290 TraceCheckUtils]: 112: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 12:20:20,885 INFO L290 TraceCheckUtils]: 113: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 12:20:20,885 INFO L290 TraceCheckUtils]: 114: Hoare triple {70025#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 12:20:20,886 INFO L272 TraceCheckUtils]: 115: Hoare triple {70025#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {70025#false} is VALID [2022-04-15 12:20:20,886 INFO L290 TraceCheckUtils]: 116: Hoare triple {70025#false} ~cond := #in~cond; {70025#false} is VALID [2022-04-15 12:20:20,886 INFO L290 TraceCheckUtils]: 117: Hoare triple {70025#false} assume 0 == ~cond; {70025#false} is VALID [2022-04-15 12:20:20,886 INFO L290 TraceCheckUtils]: 118: Hoare triple {70025#false} assume !false; {70025#false} is VALID [2022-04-15 12:20:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:20:20,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:23,446 INFO L290 TraceCheckUtils]: 118: Hoare triple {70025#false} assume !false; {70025#false} is VALID [2022-04-15 12:20:23,446 INFO L290 TraceCheckUtils]: 117: Hoare triple {70025#false} assume 0 == ~cond; {70025#false} is VALID [2022-04-15 12:20:23,446 INFO L290 TraceCheckUtils]: 116: Hoare triple {70025#false} ~cond := #in~cond; {70025#false} is VALID [2022-04-15 12:20:23,446 INFO L272 TraceCheckUtils]: 115: Hoare triple {70025#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {70025#false} is VALID [2022-04-15 12:20:23,447 INFO L290 TraceCheckUtils]: 114: Hoare triple {70025#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 12:20:23,447 INFO L290 TraceCheckUtils]: 113: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 12:20:23,447 INFO L290 TraceCheckUtils]: 112: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 12:20:23,447 INFO L290 TraceCheckUtils]: 111: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-15 12:20:23,447 INFO L290 TraceCheckUtils]: 110: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 12:20:23,447 INFO L290 TraceCheckUtils]: 109: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 12:20:23,447 INFO L290 TraceCheckUtils]: 108: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 12:20:23,447 INFO L290 TraceCheckUtils]: 107: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-15 12:20:23,447 INFO L290 TraceCheckUtils]: 106: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 12:20:23,447 INFO L290 TraceCheckUtils]: 105: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 12:20:23,447 INFO L290 TraceCheckUtils]: 104: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 12:20:23,447 INFO L290 TraceCheckUtils]: 103: Hoare triple {70025#false} ~i~0 := 0; {70025#false} is VALID [2022-04-15 12:20:23,447 INFO L290 TraceCheckUtils]: 102: Hoare triple {70485#(< main_~i~0 1024)} assume !(~i~0 < 1024); {70025#false} is VALID [2022-04-15 12:20:23,448 INFO L290 TraceCheckUtils]: 101: Hoare triple {70489#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70485#(< main_~i~0 1024)} is VALID [2022-04-15 12:20:23,448 INFO L290 TraceCheckUtils]: 100: Hoare triple {70489#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70489#(< main_~i~0 1023)} is VALID [2022-04-15 12:20:23,448 INFO L290 TraceCheckUtils]: 99: Hoare triple {70496#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70489#(< main_~i~0 1023)} is VALID [2022-04-15 12:20:23,449 INFO L290 TraceCheckUtils]: 98: Hoare triple {70496#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70496#(< main_~i~0 1022)} is VALID [2022-04-15 12:20:23,449 INFO L290 TraceCheckUtils]: 97: Hoare triple {70503#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70496#(< main_~i~0 1022)} is VALID [2022-04-15 12:20:23,449 INFO L290 TraceCheckUtils]: 96: Hoare triple {70503#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70503#(< main_~i~0 1021)} is VALID [2022-04-15 12:20:23,449 INFO L290 TraceCheckUtils]: 95: Hoare triple {70510#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70503#(< main_~i~0 1021)} is VALID [2022-04-15 12:20:23,450 INFO L290 TraceCheckUtils]: 94: Hoare triple {70510#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70510#(< main_~i~0 1020)} is VALID [2022-04-15 12:20:23,450 INFO L290 TraceCheckUtils]: 93: Hoare triple {70517#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70510#(< main_~i~0 1020)} is VALID [2022-04-15 12:20:23,450 INFO L290 TraceCheckUtils]: 92: Hoare triple {70517#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70517#(< main_~i~0 1019)} is VALID [2022-04-15 12:20:23,451 INFO L290 TraceCheckUtils]: 91: Hoare triple {70524#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70517#(< main_~i~0 1019)} is VALID [2022-04-15 12:20:23,451 INFO L290 TraceCheckUtils]: 90: Hoare triple {70524#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70524#(< main_~i~0 1018)} is VALID [2022-04-15 12:20:23,451 INFO L290 TraceCheckUtils]: 89: Hoare triple {70531#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70524#(< main_~i~0 1018)} is VALID [2022-04-15 12:20:23,451 INFO L290 TraceCheckUtils]: 88: Hoare triple {70531#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70531#(< main_~i~0 1017)} is VALID [2022-04-15 12:20:23,452 INFO L290 TraceCheckUtils]: 87: Hoare triple {70538#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70531#(< main_~i~0 1017)} is VALID [2022-04-15 12:20:23,452 INFO L290 TraceCheckUtils]: 86: Hoare triple {70538#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70538#(< main_~i~0 1016)} is VALID [2022-04-15 12:20:23,452 INFO L290 TraceCheckUtils]: 85: Hoare triple {70545#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70538#(< main_~i~0 1016)} is VALID [2022-04-15 12:20:23,453 INFO L290 TraceCheckUtils]: 84: Hoare triple {70545#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70545#(< main_~i~0 1015)} is VALID [2022-04-15 12:20:23,453 INFO L290 TraceCheckUtils]: 83: Hoare triple {70552#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70545#(< main_~i~0 1015)} is VALID [2022-04-15 12:20:23,453 INFO L290 TraceCheckUtils]: 82: Hoare triple {70552#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70552#(< main_~i~0 1014)} is VALID [2022-04-15 12:20:23,454 INFO L290 TraceCheckUtils]: 81: Hoare triple {70559#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70552#(< main_~i~0 1014)} is VALID [2022-04-15 12:20:23,454 INFO L290 TraceCheckUtils]: 80: Hoare triple {70559#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70559#(< main_~i~0 1013)} is VALID [2022-04-15 12:20:23,454 INFO L290 TraceCheckUtils]: 79: Hoare triple {70566#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70559#(< main_~i~0 1013)} is VALID [2022-04-15 12:20:23,454 INFO L290 TraceCheckUtils]: 78: Hoare triple {70566#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70566#(< main_~i~0 1012)} is VALID [2022-04-15 12:20:23,455 INFO L290 TraceCheckUtils]: 77: Hoare triple {70573#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70566#(< main_~i~0 1012)} is VALID [2022-04-15 12:20:23,455 INFO L290 TraceCheckUtils]: 76: Hoare triple {70573#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70573#(< main_~i~0 1011)} is VALID [2022-04-15 12:20:23,455 INFO L290 TraceCheckUtils]: 75: Hoare triple {70580#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70573#(< main_~i~0 1011)} is VALID [2022-04-15 12:20:23,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {70580#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70580#(< main_~i~0 1010)} is VALID [2022-04-15 12:20:23,456 INFO L290 TraceCheckUtils]: 73: Hoare triple {70587#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70580#(< main_~i~0 1010)} is VALID [2022-04-15 12:20:23,456 INFO L290 TraceCheckUtils]: 72: Hoare triple {70587#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70587#(< main_~i~0 1009)} is VALID [2022-04-15 12:20:23,456 INFO L290 TraceCheckUtils]: 71: Hoare triple {70594#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70587#(< main_~i~0 1009)} is VALID [2022-04-15 12:20:23,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {70594#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70594#(< main_~i~0 1008)} is VALID [2022-04-15 12:20:23,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {70601#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70594#(< main_~i~0 1008)} is VALID [2022-04-15 12:20:23,457 INFO L290 TraceCheckUtils]: 68: Hoare triple {70601#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70601#(< main_~i~0 1007)} is VALID [2022-04-15 12:20:23,458 INFO L290 TraceCheckUtils]: 67: Hoare triple {70608#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70601#(< main_~i~0 1007)} is VALID [2022-04-15 12:20:23,458 INFO L290 TraceCheckUtils]: 66: Hoare triple {70608#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70608#(< main_~i~0 1006)} is VALID [2022-04-15 12:20:23,458 INFO L290 TraceCheckUtils]: 65: Hoare triple {70615#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70608#(< main_~i~0 1006)} is VALID [2022-04-15 12:20:23,458 INFO L290 TraceCheckUtils]: 64: Hoare triple {70615#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70615#(< main_~i~0 1005)} is VALID [2022-04-15 12:20:23,459 INFO L290 TraceCheckUtils]: 63: Hoare triple {70622#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70615#(< main_~i~0 1005)} is VALID [2022-04-15 12:20:23,459 INFO L290 TraceCheckUtils]: 62: Hoare triple {70622#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70622#(< main_~i~0 1004)} is VALID [2022-04-15 12:20:23,459 INFO L290 TraceCheckUtils]: 61: Hoare triple {70629#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70622#(< main_~i~0 1004)} is VALID [2022-04-15 12:20:23,459 INFO L290 TraceCheckUtils]: 60: Hoare triple {70629#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70629#(< main_~i~0 1003)} is VALID [2022-04-15 12:20:23,460 INFO L290 TraceCheckUtils]: 59: Hoare triple {70636#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70629#(< main_~i~0 1003)} is VALID [2022-04-15 12:20:23,460 INFO L290 TraceCheckUtils]: 58: Hoare triple {70636#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70636#(< main_~i~0 1002)} is VALID [2022-04-15 12:20:23,460 INFO L290 TraceCheckUtils]: 57: Hoare triple {70643#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70636#(< main_~i~0 1002)} is VALID [2022-04-15 12:20:23,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {70643#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70643#(< main_~i~0 1001)} is VALID [2022-04-15 12:20:23,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {70650#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70643#(< main_~i~0 1001)} is VALID [2022-04-15 12:20:23,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {70650#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70650#(< main_~i~0 1000)} is VALID [2022-04-15 12:20:23,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {70657#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70650#(< main_~i~0 1000)} is VALID [2022-04-15 12:20:23,462 INFO L290 TraceCheckUtils]: 52: Hoare triple {70657#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70657#(< main_~i~0 999)} is VALID [2022-04-15 12:20:23,462 INFO L290 TraceCheckUtils]: 51: Hoare triple {70664#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70657#(< main_~i~0 999)} is VALID [2022-04-15 12:20:23,462 INFO L290 TraceCheckUtils]: 50: Hoare triple {70664#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70664#(< main_~i~0 998)} is VALID [2022-04-15 12:20:23,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {70671#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70664#(< main_~i~0 998)} is VALID [2022-04-15 12:20:23,463 INFO L290 TraceCheckUtils]: 48: Hoare triple {70671#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70671#(< main_~i~0 997)} is VALID [2022-04-15 12:20:23,463 INFO L290 TraceCheckUtils]: 47: Hoare triple {70678#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70671#(< main_~i~0 997)} is VALID [2022-04-15 12:20:23,463 INFO L290 TraceCheckUtils]: 46: Hoare triple {70678#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70678#(< main_~i~0 996)} is VALID [2022-04-15 12:20:23,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {70685#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70678#(< main_~i~0 996)} is VALID [2022-04-15 12:20:23,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {70685#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70685#(< main_~i~0 995)} is VALID [2022-04-15 12:20:23,464 INFO L290 TraceCheckUtils]: 43: Hoare triple {70692#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70685#(< main_~i~0 995)} is VALID [2022-04-15 12:20:23,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {70692#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70692#(< main_~i~0 994)} is VALID [2022-04-15 12:20:23,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {70699#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70692#(< main_~i~0 994)} is VALID [2022-04-15 12:20:23,465 INFO L290 TraceCheckUtils]: 40: Hoare triple {70699#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70699#(< main_~i~0 993)} is VALID [2022-04-15 12:20:23,465 INFO L290 TraceCheckUtils]: 39: Hoare triple {70706#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70699#(< main_~i~0 993)} is VALID [2022-04-15 12:20:23,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {70706#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70706#(< main_~i~0 992)} is VALID [2022-04-15 12:20:23,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {70713#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70706#(< main_~i~0 992)} is VALID [2022-04-15 12:20:23,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {70713#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70713#(< main_~i~0 991)} is VALID [2022-04-15 12:20:23,467 INFO L290 TraceCheckUtils]: 35: Hoare triple {70720#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70713#(< main_~i~0 991)} is VALID [2022-04-15 12:20:23,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {70720#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70720#(< main_~i~0 990)} is VALID [2022-04-15 12:20:23,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {70727#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70720#(< main_~i~0 990)} is VALID [2022-04-15 12:20:23,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {70727#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70727#(< main_~i~0 989)} is VALID [2022-04-15 12:20:23,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {70734#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70727#(< main_~i~0 989)} is VALID [2022-04-15 12:20:23,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {70734#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70734#(< main_~i~0 988)} is VALID [2022-04-15 12:20:23,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {70741#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70734#(< main_~i~0 988)} is VALID [2022-04-15 12:20:23,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {70741#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70741#(< main_~i~0 987)} is VALID [2022-04-15 12:20:23,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {70748#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70741#(< main_~i~0 987)} is VALID [2022-04-15 12:20:23,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {70748#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70748#(< main_~i~0 986)} is VALID [2022-04-15 12:20:23,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {70755#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70748#(< main_~i~0 986)} is VALID [2022-04-15 12:20:23,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {70755#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70755#(< main_~i~0 985)} is VALID [2022-04-15 12:20:23,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {70762#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70755#(< main_~i~0 985)} is VALID [2022-04-15 12:20:23,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {70762#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70762#(< main_~i~0 984)} is VALID [2022-04-15 12:20:23,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {70769#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70762#(< main_~i~0 984)} is VALID [2022-04-15 12:20:23,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {70769#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70769#(< main_~i~0 983)} is VALID [2022-04-15 12:20:23,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {70776#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70769#(< main_~i~0 983)} is VALID [2022-04-15 12:20:23,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {70776#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70776#(< main_~i~0 982)} is VALID [2022-04-15 12:20:23,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {70783#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70776#(< main_~i~0 982)} is VALID [2022-04-15 12:20:23,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {70783#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70783#(< main_~i~0 981)} is VALID [2022-04-15 12:20:23,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {70790#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70783#(< main_~i~0 981)} is VALID [2022-04-15 12:20:23,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {70790#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70790#(< main_~i~0 980)} is VALID [2022-04-15 12:20:23,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {70797#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70790#(< main_~i~0 980)} is VALID [2022-04-15 12:20:23,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {70797#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70797#(< main_~i~0 979)} is VALID [2022-04-15 12:20:23,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {70804#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70797#(< main_~i~0 979)} is VALID [2022-04-15 12:20:23,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {70804#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70804#(< main_~i~0 978)} is VALID [2022-04-15 12:20:23,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {70811#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70804#(< main_~i~0 978)} is VALID [2022-04-15 12:20:23,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {70811#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70811#(< main_~i~0 977)} is VALID [2022-04-15 12:20:23,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {70818#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70811#(< main_~i~0 977)} is VALID [2022-04-15 12:20:23,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {70818#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70818#(< main_~i~0 976)} is VALID [2022-04-15 12:20:23,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {70024#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {70818#(< main_~i~0 976)} is VALID [2022-04-15 12:20:23,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {70024#true} call #t~ret6 := main(); {70024#true} is VALID [2022-04-15 12:20:23,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70024#true} {70024#true} #64#return; {70024#true} is VALID [2022-04-15 12:20:23,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {70024#true} assume true; {70024#true} is VALID [2022-04-15 12:20:23,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {70024#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {70024#true} is VALID [2022-04-15 12:20:23,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {70024#true} call ULTIMATE.init(); {70024#true} is VALID [2022-04-15 12:20:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:20:23,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106604466] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:23,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:23,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 102 [2022-04-15 12:20:23,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:23,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1519869351] [2022-04-15 12:20:23,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1519869351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:23,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:23,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 12:20:23,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806469253] [2022-04-15 12:20:23,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:23,477 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-15 12:20:23,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:23,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:23,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:23,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 12:20:23,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:23,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 12:20:23,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2022-04-15 12:20:23,544 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:32,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:32,600 INFO L93 Difference]: Finished difference Result 376 states and 478 transitions. [2022-04-15 12:20:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 12:20:32,600 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-15 12:20:32,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 469 transitions. [2022-04-15 12:20:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 469 transitions. [2022-04-15 12:20:32,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 469 transitions. [2022-04-15 12:20:32,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 469 edges. 469 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:32,910 INFO L225 Difference]: With dead ends: 376 [2022-04-15 12:20:32,910 INFO L226 Difference]: Without dead ends: 359 [2022-04-15 12:20:32,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=10002, Invalid=12648, Unknown=0, NotChecked=0, Total=22650 [2022-04-15 12:20:32,911 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1167 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:32,912 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1167 Valid, 37 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:20:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-15 12:20:33,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 122. [2022-04-15 12:20:33,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:33,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:33,538 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:33,538 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:33,542 INFO L93 Difference]: Finished difference Result 359 states and 457 transitions. [2022-04-15 12:20:33,543 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 457 transitions. [2022-04-15 12:20:33,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:33,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:33,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 359 states. [2022-04-15 12:20:33,543 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 359 states. [2022-04-15 12:20:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:33,548 INFO L93 Difference]: Finished difference Result 359 states and 457 transitions. [2022-04-15 12:20:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 457 transitions. [2022-04-15 12:20:33,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:33,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:33,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:33,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2022-04-15 12:20:33,549 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 119 [2022-04-15 12:20:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:33,550 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2022-04-15 12:20:33,550 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:33,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 126 transitions. [2022-04-15 12:20:33,825 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:20:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2022-04-15 12:20:33,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-15 12:20:33,826 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:33,826 INFO L499 BasicCegarLoop]: trace histogram [49, 49, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:33,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-04-15 12:20:34,026 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:20:34,027 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:34,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:34,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1350163205, now seen corresponding path program 99 times [2022-04-15 12:20:34,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:34,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1958069576] [2022-04-15 12:20:34,031 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:20:34,031 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:20:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1350163205, now seen corresponding path program 100 times [2022-04-15 12:20:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:34,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422541019] [2022-04-15 12:20:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:34,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:34,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:34,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {72709#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {72654#true} is VALID [2022-04-15 12:20:34,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {72654#true} assume true; {72654#true} is VALID [2022-04-15 12:20:34,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72654#true} {72654#true} #64#return; {72654#true} is VALID [2022-04-15 12:20:34,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {72654#true} call ULTIMATE.init(); {72709#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:34,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {72709#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {72654#true} is VALID [2022-04-15 12:20:34,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {72654#true} assume true; {72654#true} is VALID [2022-04-15 12:20:34,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72654#true} {72654#true} #64#return; {72654#true} is VALID [2022-04-15 12:20:34,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {72654#true} call #t~ret6 := main(); {72654#true} is VALID [2022-04-15 12:20:34,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {72654#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {72659#(= main_~i~0 0)} is VALID [2022-04-15 12:20:34,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {72659#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72659#(= main_~i~0 0)} is VALID [2022-04-15 12:20:34,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {72659#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72660#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:34,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {72660#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72660#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:34,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {72660#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72661#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:34,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {72661#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72661#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:34,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {72661#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72662#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:34,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {72662#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72662#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:34,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {72662#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72663#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:34,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {72663#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72663#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:34,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {72663#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72664#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:34,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {72664#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72664#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:34,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {72664#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72665#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:34,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {72665#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72665#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:34,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {72665#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72666#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:34,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {72666#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72666#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:34,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {72666#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72667#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:34,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {72667#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72667#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:34,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {72667#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72668#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:34,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {72668#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72668#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:34,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {72668#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72669#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:34,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {72669#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72669#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:34,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {72669#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72670#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:34,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {72670#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72670#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:34,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {72670#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72671#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:34,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {72671#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72671#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:34,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {72671#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72672#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:34,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {72672#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72672#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:34,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {72672#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72673#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:34,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {72673#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72673#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:34,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {72673#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72674#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:34,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {72674#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72674#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:34,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {72674#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72675#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:34,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {72675#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72675#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:34,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {72675#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72676#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:34,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {72676#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72676#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:34,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {72676#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72677#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:34,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {72677#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72677#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:34,934 INFO L290 TraceCheckUtils]: 43: Hoare triple {72677#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72678#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:34,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {72678#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72678#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:34,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {72678#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72679#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:34,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {72679#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72679#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:34,935 INFO L290 TraceCheckUtils]: 47: Hoare triple {72679#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72680#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:34,935 INFO L290 TraceCheckUtils]: 48: Hoare triple {72680#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72680#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:34,935 INFO L290 TraceCheckUtils]: 49: Hoare triple {72680#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72681#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:34,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {72681#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72681#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:34,936 INFO L290 TraceCheckUtils]: 51: Hoare triple {72681#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72682#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:34,936 INFO L290 TraceCheckUtils]: 52: Hoare triple {72682#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72682#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:34,936 INFO L290 TraceCheckUtils]: 53: Hoare triple {72682#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72683#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:34,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {72683#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72683#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:34,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {72683#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72684#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:34,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {72684#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72684#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:34,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {72684#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72685#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:34,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {72685#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72685#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:34,938 INFO L290 TraceCheckUtils]: 59: Hoare triple {72685#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72686#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:34,938 INFO L290 TraceCheckUtils]: 60: Hoare triple {72686#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72686#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:34,939 INFO L290 TraceCheckUtils]: 61: Hoare triple {72686#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72687#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:34,939 INFO L290 TraceCheckUtils]: 62: Hoare triple {72687#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72687#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:34,939 INFO L290 TraceCheckUtils]: 63: Hoare triple {72687#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72688#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:34,939 INFO L290 TraceCheckUtils]: 64: Hoare triple {72688#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72688#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:34,940 INFO L290 TraceCheckUtils]: 65: Hoare triple {72688#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72689#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:34,940 INFO L290 TraceCheckUtils]: 66: Hoare triple {72689#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72689#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:34,940 INFO L290 TraceCheckUtils]: 67: Hoare triple {72689#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72690#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:34,941 INFO L290 TraceCheckUtils]: 68: Hoare triple {72690#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72690#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:34,941 INFO L290 TraceCheckUtils]: 69: Hoare triple {72690#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72691#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:34,941 INFO L290 TraceCheckUtils]: 70: Hoare triple {72691#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72691#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:34,941 INFO L290 TraceCheckUtils]: 71: Hoare triple {72691#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72692#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:34,942 INFO L290 TraceCheckUtils]: 72: Hoare triple {72692#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72692#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:34,942 INFO L290 TraceCheckUtils]: 73: Hoare triple {72692#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72693#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:34,942 INFO L290 TraceCheckUtils]: 74: Hoare triple {72693#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72693#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:34,943 INFO L290 TraceCheckUtils]: 75: Hoare triple {72693#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72694#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:34,943 INFO L290 TraceCheckUtils]: 76: Hoare triple {72694#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72694#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:34,943 INFO L290 TraceCheckUtils]: 77: Hoare triple {72694#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72695#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:34,943 INFO L290 TraceCheckUtils]: 78: Hoare triple {72695#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72695#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:34,944 INFO L290 TraceCheckUtils]: 79: Hoare triple {72695#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72696#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:34,944 INFO L290 TraceCheckUtils]: 80: Hoare triple {72696#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72696#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:34,944 INFO L290 TraceCheckUtils]: 81: Hoare triple {72696#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72697#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:34,944 INFO L290 TraceCheckUtils]: 82: Hoare triple {72697#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72697#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:34,945 INFO L290 TraceCheckUtils]: 83: Hoare triple {72697#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72698#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:34,945 INFO L290 TraceCheckUtils]: 84: Hoare triple {72698#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72698#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:34,945 INFO L290 TraceCheckUtils]: 85: Hoare triple {72698#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72699#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:34,946 INFO L290 TraceCheckUtils]: 86: Hoare triple {72699#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72699#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:34,946 INFO L290 TraceCheckUtils]: 87: Hoare triple {72699#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72700#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:34,946 INFO L290 TraceCheckUtils]: 88: Hoare triple {72700#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72700#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:34,946 INFO L290 TraceCheckUtils]: 89: Hoare triple {72700#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72701#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:34,947 INFO L290 TraceCheckUtils]: 90: Hoare triple {72701#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72701#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:34,947 INFO L290 TraceCheckUtils]: 91: Hoare triple {72701#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72702#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:34,947 INFO L290 TraceCheckUtils]: 92: Hoare triple {72702#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72702#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:34,948 INFO L290 TraceCheckUtils]: 93: Hoare triple {72702#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72703#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:34,948 INFO L290 TraceCheckUtils]: 94: Hoare triple {72703#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72703#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:34,948 INFO L290 TraceCheckUtils]: 95: Hoare triple {72703#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72704#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:34,948 INFO L290 TraceCheckUtils]: 96: Hoare triple {72704#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72704#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:34,949 INFO L290 TraceCheckUtils]: 97: Hoare triple {72704#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72705#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:34,949 INFO L290 TraceCheckUtils]: 98: Hoare triple {72705#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72705#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:34,949 INFO L290 TraceCheckUtils]: 99: Hoare triple {72705#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72706#(<= main_~i~0 47)} is VALID [2022-04-15 12:20:34,949 INFO L290 TraceCheckUtils]: 100: Hoare triple {72706#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72706#(<= main_~i~0 47)} is VALID [2022-04-15 12:20:34,950 INFO L290 TraceCheckUtils]: 101: Hoare triple {72706#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72707#(<= main_~i~0 48)} is VALID [2022-04-15 12:20:34,950 INFO L290 TraceCheckUtils]: 102: Hoare triple {72707#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72707#(<= main_~i~0 48)} is VALID [2022-04-15 12:20:34,950 INFO L290 TraceCheckUtils]: 103: Hoare triple {72707#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72708#(<= main_~i~0 49)} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 104: Hoare triple {72708#(<= main_~i~0 49)} assume !(~i~0 < 1024); {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 105: Hoare triple {72655#false} ~i~0 := 0; {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 106: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 107: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 108: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 109: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 110: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 111: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 112: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 113: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 114: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 115: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 116: Hoare triple {72655#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L272 TraceCheckUtils]: 117: Hoare triple {72655#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 118: Hoare triple {72655#false} ~cond := #in~cond; {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 119: Hoare triple {72655#false} assume 0 == ~cond; {72655#false} is VALID [2022-04-15 12:20:34,951 INFO L290 TraceCheckUtils]: 120: Hoare triple {72655#false} assume !false; {72655#false} is VALID [2022-04-15 12:20:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2411 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:20:34,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:34,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422541019] [2022-04-15 12:20:34,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422541019] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:34,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801181497] [2022-04-15 12:20:34,952 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:20:34,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:34,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:34,953 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:20:34,954 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:20:35,229 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:20:35,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:35,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-15 12:20:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:35,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:35,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {72654#true} call ULTIMATE.init(); {72654#true} is VALID [2022-04-15 12:20:35,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {72654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {72654#true} is VALID [2022-04-15 12:20:35,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {72654#true} assume true; {72654#true} is VALID [2022-04-15 12:20:35,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72654#true} {72654#true} #64#return; {72654#true} is VALID [2022-04-15 12:20:35,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {72654#true} call #t~ret6 := main(); {72654#true} is VALID [2022-04-15 12:20:35,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {72654#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {72728#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:35,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {72728#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72728#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:35,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {72728#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72660#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:35,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {72660#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72660#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:35,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {72660#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72661#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:35,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {72661#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72661#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:35,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {72661#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72662#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:35,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {72662#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72662#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:35,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {72662#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72663#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:35,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {72663#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72663#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:35,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {72663#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72664#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:35,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {72664#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72664#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:35,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {72664#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72665#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:35,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {72665#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72665#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:35,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {72665#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72666#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:35,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {72666#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72666#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:35,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {72666#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72667#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:35,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {72667#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72667#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:35,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {72667#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72668#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:35,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {72668#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72668#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:35,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {72668#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72669#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:35,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {72669#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72669#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:35,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {72669#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72670#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:35,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {72670#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72670#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:35,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {72670#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72671#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:35,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {72671#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72671#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:35,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {72671#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72672#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:35,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {72672#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72672#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:35,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {72672#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72673#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:35,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {72673#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72673#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:35,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {72673#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72674#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:35,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {72674#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72674#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:35,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {72674#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72675#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:35,837 INFO L290 TraceCheckUtils]: 38: Hoare triple {72675#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72675#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:35,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {72675#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72676#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:35,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {72676#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72676#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:35,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {72676#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72677#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:35,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {72677#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72677#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:35,839 INFO L290 TraceCheckUtils]: 43: Hoare triple {72677#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72678#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:35,839 INFO L290 TraceCheckUtils]: 44: Hoare triple {72678#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72678#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:35,839 INFO L290 TraceCheckUtils]: 45: Hoare triple {72678#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72679#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:35,839 INFO L290 TraceCheckUtils]: 46: Hoare triple {72679#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72679#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:35,840 INFO L290 TraceCheckUtils]: 47: Hoare triple {72679#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72680#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:35,840 INFO L290 TraceCheckUtils]: 48: Hoare triple {72680#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72680#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:35,840 INFO L290 TraceCheckUtils]: 49: Hoare triple {72680#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72681#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:35,841 INFO L290 TraceCheckUtils]: 50: Hoare triple {72681#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72681#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:35,841 INFO L290 TraceCheckUtils]: 51: Hoare triple {72681#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72682#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:35,841 INFO L290 TraceCheckUtils]: 52: Hoare triple {72682#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72682#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:35,841 INFO L290 TraceCheckUtils]: 53: Hoare triple {72682#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72683#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:35,842 INFO L290 TraceCheckUtils]: 54: Hoare triple {72683#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72683#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:35,842 INFO L290 TraceCheckUtils]: 55: Hoare triple {72683#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72684#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:35,842 INFO L290 TraceCheckUtils]: 56: Hoare triple {72684#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72684#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:35,843 INFO L290 TraceCheckUtils]: 57: Hoare triple {72684#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72685#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:35,843 INFO L290 TraceCheckUtils]: 58: Hoare triple {72685#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72685#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:35,843 INFO L290 TraceCheckUtils]: 59: Hoare triple {72685#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72686#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:35,843 INFO L290 TraceCheckUtils]: 60: Hoare triple {72686#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72686#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:35,844 INFO L290 TraceCheckUtils]: 61: Hoare triple {72686#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72687#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:35,844 INFO L290 TraceCheckUtils]: 62: Hoare triple {72687#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72687#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:35,844 INFO L290 TraceCheckUtils]: 63: Hoare triple {72687#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72688#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:35,845 INFO L290 TraceCheckUtils]: 64: Hoare triple {72688#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72688#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:35,845 INFO L290 TraceCheckUtils]: 65: Hoare triple {72688#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72689#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:35,845 INFO L290 TraceCheckUtils]: 66: Hoare triple {72689#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72689#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:35,845 INFO L290 TraceCheckUtils]: 67: Hoare triple {72689#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72690#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:35,846 INFO L290 TraceCheckUtils]: 68: Hoare triple {72690#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72690#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:35,846 INFO L290 TraceCheckUtils]: 69: Hoare triple {72690#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72691#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:35,846 INFO L290 TraceCheckUtils]: 70: Hoare triple {72691#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72691#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:35,847 INFO L290 TraceCheckUtils]: 71: Hoare triple {72691#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72692#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:35,847 INFO L290 TraceCheckUtils]: 72: Hoare triple {72692#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72692#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:35,847 INFO L290 TraceCheckUtils]: 73: Hoare triple {72692#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72693#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:35,847 INFO L290 TraceCheckUtils]: 74: Hoare triple {72693#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72693#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:35,848 INFO L290 TraceCheckUtils]: 75: Hoare triple {72693#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72694#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:35,848 INFO L290 TraceCheckUtils]: 76: Hoare triple {72694#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72694#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:35,848 INFO L290 TraceCheckUtils]: 77: Hoare triple {72694#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72695#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:35,849 INFO L290 TraceCheckUtils]: 78: Hoare triple {72695#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72695#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:35,849 INFO L290 TraceCheckUtils]: 79: Hoare triple {72695#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72696#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:35,849 INFO L290 TraceCheckUtils]: 80: Hoare triple {72696#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72696#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:35,850 INFO L290 TraceCheckUtils]: 81: Hoare triple {72696#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72697#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:35,850 INFO L290 TraceCheckUtils]: 82: Hoare triple {72697#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72697#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:35,850 INFO L290 TraceCheckUtils]: 83: Hoare triple {72697#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72698#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:35,850 INFO L290 TraceCheckUtils]: 84: Hoare triple {72698#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72698#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:35,851 INFO L290 TraceCheckUtils]: 85: Hoare triple {72698#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72699#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:35,851 INFO L290 TraceCheckUtils]: 86: Hoare triple {72699#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72699#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:35,851 INFO L290 TraceCheckUtils]: 87: Hoare triple {72699#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72700#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:35,852 INFO L290 TraceCheckUtils]: 88: Hoare triple {72700#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72700#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:35,852 INFO L290 TraceCheckUtils]: 89: Hoare triple {72700#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72701#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:35,852 INFO L290 TraceCheckUtils]: 90: Hoare triple {72701#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72701#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:35,852 INFO L290 TraceCheckUtils]: 91: Hoare triple {72701#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72702#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:35,853 INFO L290 TraceCheckUtils]: 92: Hoare triple {72702#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72702#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:35,853 INFO L290 TraceCheckUtils]: 93: Hoare triple {72702#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72703#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:35,853 INFO L290 TraceCheckUtils]: 94: Hoare triple {72703#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72703#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:35,854 INFO L290 TraceCheckUtils]: 95: Hoare triple {72703#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72704#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:35,854 INFO L290 TraceCheckUtils]: 96: Hoare triple {72704#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72704#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:35,854 INFO L290 TraceCheckUtils]: 97: Hoare triple {72704#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72705#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:35,854 INFO L290 TraceCheckUtils]: 98: Hoare triple {72705#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72705#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:35,855 INFO L290 TraceCheckUtils]: 99: Hoare triple {72705#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72706#(<= main_~i~0 47)} is VALID [2022-04-15 12:20:35,855 INFO L290 TraceCheckUtils]: 100: Hoare triple {72706#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72706#(<= main_~i~0 47)} is VALID [2022-04-15 12:20:35,855 INFO L290 TraceCheckUtils]: 101: Hoare triple {72706#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72707#(<= main_~i~0 48)} is VALID [2022-04-15 12:20:35,856 INFO L290 TraceCheckUtils]: 102: Hoare triple {72707#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72707#(<= main_~i~0 48)} is VALID [2022-04-15 12:20:35,856 INFO L290 TraceCheckUtils]: 103: Hoare triple {72707#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72708#(<= main_~i~0 49)} is VALID [2022-04-15 12:20:35,856 INFO L290 TraceCheckUtils]: 104: Hoare triple {72708#(<= main_~i~0 49)} assume !(~i~0 < 1024); {72655#false} is VALID [2022-04-15 12:20:35,856 INFO L290 TraceCheckUtils]: 105: Hoare triple {72655#false} ~i~0 := 0; {72655#false} is VALID [2022-04-15 12:20:35,856 INFO L290 TraceCheckUtils]: 106: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 12:20:35,856 INFO L290 TraceCheckUtils]: 107: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 12:20:35,856 INFO L290 TraceCheckUtils]: 108: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 12:20:35,856 INFO L290 TraceCheckUtils]: 109: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-15 12:20:35,856 INFO L290 TraceCheckUtils]: 110: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 12:20:35,857 INFO L290 TraceCheckUtils]: 111: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 12:20:35,857 INFO L290 TraceCheckUtils]: 112: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 12:20:35,857 INFO L290 TraceCheckUtils]: 113: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-15 12:20:35,857 INFO L290 TraceCheckUtils]: 114: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 12:20:35,857 INFO L290 TraceCheckUtils]: 115: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 12:20:35,857 INFO L290 TraceCheckUtils]: 116: Hoare triple {72655#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 12:20:35,857 INFO L272 TraceCheckUtils]: 117: Hoare triple {72655#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {72655#false} is VALID [2022-04-15 12:20:35,857 INFO L290 TraceCheckUtils]: 118: Hoare triple {72655#false} ~cond := #in~cond; {72655#false} is VALID [2022-04-15 12:20:35,857 INFO L290 TraceCheckUtils]: 119: Hoare triple {72655#false} assume 0 == ~cond; {72655#false} is VALID [2022-04-15 12:20:35,857 INFO L290 TraceCheckUtils]: 120: Hoare triple {72655#false} assume !false; {72655#false} is VALID [2022-04-15 12:20:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2411 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:20:35,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:38,510 INFO L290 TraceCheckUtils]: 120: Hoare triple {72655#false} assume !false; {72655#false} is VALID [2022-04-15 12:20:38,510 INFO L290 TraceCheckUtils]: 119: Hoare triple {72655#false} assume 0 == ~cond; {72655#false} is VALID [2022-04-15 12:20:38,510 INFO L290 TraceCheckUtils]: 118: Hoare triple {72655#false} ~cond := #in~cond; {72655#false} is VALID [2022-04-15 12:20:38,510 INFO L272 TraceCheckUtils]: 117: Hoare triple {72655#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {72655#false} is VALID [2022-04-15 12:20:38,510 INFO L290 TraceCheckUtils]: 116: Hoare triple {72655#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 12:20:38,510 INFO L290 TraceCheckUtils]: 115: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 12:20:38,510 INFO L290 TraceCheckUtils]: 114: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 12:20:38,511 INFO L290 TraceCheckUtils]: 113: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-15 12:20:38,511 INFO L290 TraceCheckUtils]: 112: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 12:20:38,511 INFO L290 TraceCheckUtils]: 111: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 12:20:38,511 INFO L290 TraceCheckUtils]: 110: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 12:20:38,511 INFO L290 TraceCheckUtils]: 109: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-15 12:20:38,511 INFO L290 TraceCheckUtils]: 108: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 12:20:38,511 INFO L290 TraceCheckUtils]: 107: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 12:20:38,511 INFO L290 TraceCheckUtils]: 106: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 12:20:38,511 INFO L290 TraceCheckUtils]: 105: Hoare triple {72655#false} ~i~0 := 0; {72655#false} is VALID [2022-04-15 12:20:38,511 INFO L290 TraceCheckUtils]: 104: Hoare triple {73122#(< main_~i~0 1024)} assume !(~i~0 < 1024); {72655#false} is VALID [2022-04-15 12:20:38,512 INFO L290 TraceCheckUtils]: 103: Hoare triple {73126#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73122#(< main_~i~0 1024)} is VALID [2022-04-15 12:20:38,512 INFO L290 TraceCheckUtils]: 102: Hoare triple {73126#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73126#(< main_~i~0 1023)} is VALID [2022-04-15 12:20:38,512 INFO L290 TraceCheckUtils]: 101: Hoare triple {73133#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73126#(< main_~i~0 1023)} is VALID [2022-04-15 12:20:38,512 INFO L290 TraceCheckUtils]: 100: Hoare triple {73133#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73133#(< main_~i~0 1022)} is VALID [2022-04-15 12:20:38,513 INFO L290 TraceCheckUtils]: 99: Hoare triple {73140#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73133#(< main_~i~0 1022)} is VALID [2022-04-15 12:20:38,513 INFO L290 TraceCheckUtils]: 98: Hoare triple {73140#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73140#(< main_~i~0 1021)} is VALID [2022-04-15 12:20:38,513 INFO L290 TraceCheckUtils]: 97: Hoare triple {73147#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73140#(< main_~i~0 1021)} is VALID [2022-04-15 12:20:38,513 INFO L290 TraceCheckUtils]: 96: Hoare triple {73147#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73147#(< main_~i~0 1020)} is VALID [2022-04-15 12:20:38,514 INFO L290 TraceCheckUtils]: 95: Hoare triple {73154#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73147#(< main_~i~0 1020)} is VALID [2022-04-15 12:20:38,514 INFO L290 TraceCheckUtils]: 94: Hoare triple {73154#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73154#(< main_~i~0 1019)} is VALID [2022-04-15 12:20:38,514 INFO L290 TraceCheckUtils]: 93: Hoare triple {73161#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73154#(< main_~i~0 1019)} is VALID [2022-04-15 12:20:38,515 INFO L290 TraceCheckUtils]: 92: Hoare triple {73161#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73161#(< main_~i~0 1018)} is VALID [2022-04-15 12:20:38,515 INFO L290 TraceCheckUtils]: 91: Hoare triple {73168#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73161#(< main_~i~0 1018)} is VALID [2022-04-15 12:20:38,515 INFO L290 TraceCheckUtils]: 90: Hoare triple {73168#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73168#(< main_~i~0 1017)} is VALID [2022-04-15 12:20:38,516 INFO L290 TraceCheckUtils]: 89: Hoare triple {73175#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73168#(< main_~i~0 1017)} is VALID [2022-04-15 12:20:38,516 INFO L290 TraceCheckUtils]: 88: Hoare triple {73175#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73175#(< main_~i~0 1016)} is VALID [2022-04-15 12:20:38,516 INFO L290 TraceCheckUtils]: 87: Hoare triple {73182#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73175#(< main_~i~0 1016)} is VALID [2022-04-15 12:20:38,516 INFO L290 TraceCheckUtils]: 86: Hoare triple {73182#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73182#(< main_~i~0 1015)} is VALID [2022-04-15 12:20:38,517 INFO L290 TraceCheckUtils]: 85: Hoare triple {73189#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73182#(< main_~i~0 1015)} is VALID [2022-04-15 12:20:38,517 INFO L290 TraceCheckUtils]: 84: Hoare triple {73189#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73189#(< main_~i~0 1014)} is VALID [2022-04-15 12:20:38,517 INFO L290 TraceCheckUtils]: 83: Hoare triple {73196#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73189#(< main_~i~0 1014)} is VALID [2022-04-15 12:20:38,517 INFO L290 TraceCheckUtils]: 82: Hoare triple {73196#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73196#(< main_~i~0 1013)} is VALID [2022-04-15 12:20:38,518 INFO L290 TraceCheckUtils]: 81: Hoare triple {73203#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73196#(< main_~i~0 1013)} is VALID [2022-04-15 12:20:38,518 INFO L290 TraceCheckUtils]: 80: Hoare triple {73203#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73203#(< main_~i~0 1012)} is VALID [2022-04-15 12:20:38,518 INFO L290 TraceCheckUtils]: 79: Hoare triple {73210#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73203#(< main_~i~0 1012)} is VALID [2022-04-15 12:20:38,519 INFO L290 TraceCheckUtils]: 78: Hoare triple {73210#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73210#(< main_~i~0 1011)} is VALID [2022-04-15 12:20:38,519 INFO L290 TraceCheckUtils]: 77: Hoare triple {73217#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73210#(< main_~i~0 1011)} is VALID [2022-04-15 12:20:38,519 INFO L290 TraceCheckUtils]: 76: Hoare triple {73217#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73217#(< main_~i~0 1010)} is VALID [2022-04-15 12:20:38,519 INFO L290 TraceCheckUtils]: 75: Hoare triple {73224#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73217#(< main_~i~0 1010)} is VALID [2022-04-15 12:20:38,520 INFO L290 TraceCheckUtils]: 74: Hoare triple {73224#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73224#(< main_~i~0 1009)} is VALID [2022-04-15 12:20:38,520 INFO L290 TraceCheckUtils]: 73: Hoare triple {73231#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73224#(< main_~i~0 1009)} is VALID [2022-04-15 12:20:38,520 INFO L290 TraceCheckUtils]: 72: Hoare triple {73231#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73231#(< main_~i~0 1008)} is VALID [2022-04-15 12:20:38,521 INFO L290 TraceCheckUtils]: 71: Hoare triple {73238#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73231#(< main_~i~0 1008)} is VALID [2022-04-15 12:20:38,521 INFO L290 TraceCheckUtils]: 70: Hoare triple {73238#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73238#(< main_~i~0 1007)} is VALID [2022-04-15 12:20:38,521 INFO L290 TraceCheckUtils]: 69: Hoare triple {73245#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73238#(< main_~i~0 1007)} is VALID [2022-04-15 12:20:38,521 INFO L290 TraceCheckUtils]: 68: Hoare triple {73245#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73245#(< main_~i~0 1006)} is VALID [2022-04-15 12:20:38,522 INFO L290 TraceCheckUtils]: 67: Hoare triple {73252#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73245#(< main_~i~0 1006)} is VALID [2022-04-15 12:20:38,522 INFO L290 TraceCheckUtils]: 66: Hoare triple {73252#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73252#(< main_~i~0 1005)} is VALID [2022-04-15 12:20:38,522 INFO L290 TraceCheckUtils]: 65: Hoare triple {73259#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73252#(< main_~i~0 1005)} is VALID [2022-04-15 12:20:38,522 INFO L290 TraceCheckUtils]: 64: Hoare triple {73259#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73259#(< main_~i~0 1004)} is VALID [2022-04-15 12:20:38,523 INFO L290 TraceCheckUtils]: 63: Hoare triple {73266#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73259#(< main_~i~0 1004)} is VALID [2022-04-15 12:20:38,523 INFO L290 TraceCheckUtils]: 62: Hoare triple {73266#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73266#(< main_~i~0 1003)} is VALID [2022-04-15 12:20:38,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {73273#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73266#(< main_~i~0 1003)} is VALID [2022-04-15 12:20:38,524 INFO L290 TraceCheckUtils]: 60: Hoare triple {73273#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73273#(< main_~i~0 1002)} is VALID [2022-04-15 12:20:38,524 INFO L290 TraceCheckUtils]: 59: Hoare triple {73280#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73273#(< main_~i~0 1002)} is VALID [2022-04-15 12:20:38,524 INFO L290 TraceCheckUtils]: 58: Hoare triple {73280#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73280#(< main_~i~0 1001)} is VALID [2022-04-15 12:20:38,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {73287#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73280#(< main_~i~0 1001)} is VALID [2022-04-15 12:20:38,525 INFO L290 TraceCheckUtils]: 56: Hoare triple {73287#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73287#(< main_~i~0 1000)} is VALID [2022-04-15 12:20:38,525 INFO L290 TraceCheckUtils]: 55: Hoare triple {73294#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73287#(< main_~i~0 1000)} is VALID [2022-04-15 12:20:38,525 INFO L290 TraceCheckUtils]: 54: Hoare triple {73294#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73294#(< main_~i~0 999)} is VALID [2022-04-15 12:20:38,526 INFO L290 TraceCheckUtils]: 53: Hoare triple {73301#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73294#(< main_~i~0 999)} is VALID [2022-04-15 12:20:38,526 INFO L290 TraceCheckUtils]: 52: Hoare triple {73301#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73301#(< main_~i~0 998)} is VALID [2022-04-15 12:20:38,526 INFO L290 TraceCheckUtils]: 51: Hoare triple {73308#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73301#(< main_~i~0 998)} is VALID [2022-04-15 12:20:38,526 INFO L290 TraceCheckUtils]: 50: Hoare triple {73308#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73308#(< main_~i~0 997)} is VALID [2022-04-15 12:20:38,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {73315#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73308#(< main_~i~0 997)} is VALID [2022-04-15 12:20:38,527 INFO L290 TraceCheckUtils]: 48: Hoare triple {73315#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73315#(< main_~i~0 996)} is VALID [2022-04-15 12:20:38,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {73322#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73315#(< main_~i~0 996)} is VALID [2022-04-15 12:20:38,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {73322#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73322#(< main_~i~0 995)} is VALID [2022-04-15 12:20:38,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {73329#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73322#(< main_~i~0 995)} is VALID [2022-04-15 12:20:38,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {73329#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73329#(< main_~i~0 994)} is VALID [2022-04-15 12:20:38,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {73336#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73329#(< main_~i~0 994)} is VALID [2022-04-15 12:20:38,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {73336#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73336#(< main_~i~0 993)} is VALID [2022-04-15 12:20:38,529 INFO L290 TraceCheckUtils]: 41: Hoare triple {73343#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73336#(< main_~i~0 993)} is VALID [2022-04-15 12:20:38,529 INFO L290 TraceCheckUtils]: 40: Hoare triple {73343#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73343#(< main_~i~0 992)} is VALID [2022-04-15 12:20:38,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {73350#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73343#(< main_~i~0 992)} is VALID [2022-04-15 12:20:38,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {73350#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73350#(< main_~i~0 991)} is VALID [2022-04-15 12:20:38,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {73357#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73350#(< main_~i~0 991)} is VALID [2022-04-15 12:20:38,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {73357#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73357#(< main_~i~0 990)} is VALID [2022-04-15 12:20:38,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {73364#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73357#(< main_~i~0 990)} is VALID [2022-04-15 12:20:38,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {73364#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73364#(< main_~i~0 989)} is VALID [2022-04-15 12:20:38,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {73371#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73364#(< main_~i~0 989)} is VALID [2022-04-15 12:20:38,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {73371#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73371#(< main_~i~0 988)} is VALID [2022-04-15 12:20:38,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {73378#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73371#(< main_~i~0 988)} is VALID [2022-04-15 12:20:38,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {73378#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73378#(< main_~i~0 987)} is VALID [2022-04-15 12:20:38,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {73385#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73378#(< main_~i~0 987)} is VALID [2022-04-15 12:20:38,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {73385#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73385#(< main_~i~0 986)} is VALID [2022-04-15 12:20:38,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {73392#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73385#(< main_~i~0 986)} is VALID [2022-04-15 12:20:38,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {73392#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73392#(< main_~i~0 985)} is VALID [2022-04-15 12:20:38,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {73399#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73392#(< main_~i~0 985)} is VALID [2022-04-15 12:20:38,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {73399#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73399#(< main_~i~0 984)} is VALID [2022-04-15 12:20:38,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {73406#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73399#(< main_~i~0 984)} is VALID [2022-04-15 12:20:38,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {73406#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73406#(< main_~i~0 983)} is VALID [2022-04-15 12:20:38,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {73413#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73406#(< main_~i~0 983)} is VALID [2022-04-15 12:20:38,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {73413#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73413#(< main_~i~0 982)} is VALID [2022-04-15 12:20:38,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {73420#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73413#(< main_~i~0 982)} is VALID [2022-04-15 12:20:38,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {73420#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73420#(< main_~i~0 981)} is VALID [2022-04-15 12:20:38,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {73427#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73420#(< main_~i~0 981)} is VALID [2022-04-15 12:20:38,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {73427#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73427#(< main_~i~0 980)} is VALID [2022-04-15 12:20:38,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {73434#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73427#(< main_~i~0 980)} is VALID [2022-04-15 12:20:38,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {73434#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73434#(< main_~i~0 979)} is VALID [2022-04-15 12:20:38,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {73441#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73434#(< main_~i~0 979)} is VALID [2022-04-15 12:20:38,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {73441#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73441#(< main_~i~0 978)} is VALID [2022-04-15 12:20:38,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {73448#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73441#(< main_~i~0 978)} is VALID [2022-04-15 12:20:38,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {73448#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73448#(< main_~i~0 977)} is VALID [2022-04-15 12:20:38,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {73455#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73448#(< main_~i~0 977)} is VALID [2022-04-15 12:20:38,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {73455#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73455#(< main_~i~0 976)} is VALID [2022-04-15 12:20:38,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {73462#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73455#(< main_~i~0 976)} is VALID [2022-04-15 12:20:38,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {73462#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73462#(< main_~i~0 975)} is VALID [2022-04-15 12:20:38,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {72654#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {73462#(< main_~i~0 975)} is VALID [2022-04-15 12:20:38,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {72654#true} call #t~ret6 := main(); {72654#true} is VALID [2022-04-15 12:20:38,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72654#true} {72654#true} #64#return; {72654#true} is VALID [2022-04-15 12:20:38,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {72654#true} assume true; {72654#true} is VALID [2022-04-15 12:20:38,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {72654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {72654#true} is VALID [2022-04-15 12:20:38,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {72654#true} call ULTIMATE.init(); {72654#true} is VALID [2022-04-15 12:20:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2411 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:20:38,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801181497] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:38,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:38,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 104 [2022-04-15 12:20:38,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:38,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1958069576] [2022-04-15 12:20:38,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1958069576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:38,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:38,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-15 12:20:38,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310198209] [2022-04-15 12:20:38,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:38,541 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-15 12:20:38,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:38,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:38,606 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:20:38,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-15 12:20:38,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:38,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-15 12:20:38,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2022-04-15 12:20:38,608 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:48,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:48,198 INFO L93 Difference]: Finished difference Result 383 states and 487 transitions. [2022-04-15 12:20:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 12:20:48,198 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-15 12:20:48,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:48,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 478 transitions. [2022-04-15 12:20:48,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 478 transitions. [2022-04-15 12:20:48,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 478 transitions. [2022-04-15 12:20:48,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:48,513 INFO L225 Difference]: With dead ends: 383 [2022-04-15 12:20:48,513 INFO L226 Difference]: Without dead ends: 366 [2022-04-15 12:20:48,515 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=10406, Invalid=13156, Unknown=0, NotChecked=0, Total=23562 [2022-04-15 12:20:48,515 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1295 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:48,515 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1295 Valid, 42 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:20:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-15 12:20:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 124. [2022-04-15 12:20:49,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:49,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:49,154 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:49,154 INFO L87 Difference]: Start difference. First operand 366 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:49,159 INFO L93 Difference]: Finished difference Result 366 states and 466 transitions. [2022-04-15 12:20:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 466 transitions. [2022-04-15 12:20:49,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:49,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:49,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 366 states. [2022-04-15 12:20:49,160 INFO L87 Difference]: Start difference. First operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 366 states. [2022-04-15 12:20:49,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:49,164 INFO L93 Difference]: Finished difference Result 366 states and 466 transitions. [2022-04-15 12:20:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 466 transitions. [2022-04-15 12:20:49,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:49,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:49,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:49,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2022-04-15 12:20:49,166 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 121 [2022-04-15 12:20:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:49,166 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2022-04-15 12:20:49,166 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:49,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 128 transitions. [2022-04-15 12:20:49,445 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:20:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2022-04-15 12:20:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 12:20:49,446 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:49,446 INFO L499 BasicCegarLoop]: trace histogram [50, 50, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:49,466 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:20:49,646 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:20:49,646 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:49,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:49,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1041667687, now seen corresponding path program 101 times [2022-04-15 12:20:49,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:49,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [326851217] [2022-04-15 12:20:49,652 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:20:49,652 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:20:49,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1041667687, now seen corresponding path program 102 times [2022-04-15 12:20:49,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:49,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405341173] [2022-04-15 12:20:49,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:49,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:50,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:50,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {75388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {75332#true} is VALID [2022-04-15 12:20:50,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {75332#true} assume true; {75332#true} is VALID [2022-04-15 12:20:50,531 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75332#true} {75332#true} #64#return; {75332#true} is VALID [2022-04-15 12:20:50,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {75332#true} call ULTIMATE.init(); {75388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:50,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {75388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {75332#true} is VALID [2022-04-15 12:20:50,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {75332#true} assume true; {75332#true} is VALID [2022-04-15 12:20:50,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75332#true} {75332#true} #64#return; {75332#true} is VALID [2022-04-15 12:20:50,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {75332#true} call #t~ret6 := main(); {75332#true} is VALID [2022-04-15 12:20:50,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {75332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {75337#(= main_~i~0 0)} is VALID [2022-04-15 12:20:50,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {75337#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75337#(= main_~i~0 0)} is VALID [2022-04-15 12:20:50,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {75337#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75338#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:50,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {75338#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75338#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:50,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {75338#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75339#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:50,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {75339#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75339#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:50,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {75339#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75340#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:50,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {75340#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75340#(<= main_~i~0 3)} is VALID [2022-04-15 12:20:50,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {75340#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75341#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:50,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {75341#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75341#(<= main_~i~0 4)} is VALID [2022-04-15 12:20:50,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {75341#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75342#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:50,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {75342#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75342#(<= main_~i~0 5)} is VALID [2022-04-15 12:20:50,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {75342#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75343#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:50,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {75343#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75343#(<= main_~i~0 6)} is VALID [2022-04-15 12:20:50,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {75343#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75344#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:50,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {75344#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75344#(<= main_~i~0 7)} is VALID [2022-04-15 12:20:50,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {75344#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75345#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:50,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {75345#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75345#(<= main_~i~0 8)} is VALID [2022-04-15 12:20:50,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {75345#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75346#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:50,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {75346#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75346#(<= main_~i~0 9)} is VALID [2022-04-15 12:20:50,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {75346#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75347#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:50,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {75347#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75347#(<= main_~i~0 10)} is VALID [2022-04-15 12:20:50,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {75347#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75348#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:50,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {75348#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75348#(<= main_~i~0 11)} is VALID [2022-04-15 12:20:50,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {75348#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75349#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:50,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {75349#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75349#(<= main_~i~0 12)} is VALID [2022-04-15 12:20:50,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {75349#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75350#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:50,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {75350#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75350#(<= main_~i~0 13)} is VALID [2022-04-15 12:20:50,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {75350#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75351#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:50,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {75351#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75351#(<= main_~i~0 14)} is VALID [2022-04-15 12:20:50,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {75351#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75352#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:50,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {75352#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75352#(<= main_~i~0 15)} is VALID [2022-04-15 12:20:50,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {75352#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75353#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:50,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {75353#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75353#(<= main_~i~0 16)} is VALID [2022-04-15 12:20:50,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {75353#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75354#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:50,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {75354#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75354#(<= main_~i~0 17)} is VALID [2022-04-15 12:20:50,542 INFO L290 TraceCheckUtils]: 41: Hoare triple {75354#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75355#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:50,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {75355#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75355#(<= main_~i~0 18)} is VALID [2022-04-15 12:20:50,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {75355#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75356#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:50,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {75356#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75356#(<= main_~i~0 19)} is VALID [2022-04-15 12:20:50,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {75356#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75357#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:50,543 INFO L290 TraceCheckUtils]: 46: Hoare triple {75357#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75357#(<= main_~i~0 20)} is VALID [2022-04-15 12:20:50,543 INFO L290 TraceCheckUtils]: 47: Hoare triple {75357#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75358#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:50,544 INFO L290 TraceCheckUtils]: 48: Hoare triple {75358#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75358#(<= main_~i~0 21)} is VALID [2022-04-15 12:20:50,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {75358#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75359#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:50,544 INFO L290 TraceCheckUtils]: 50: Hoare triple {75359#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75359#(<= main_~i~0 22)} is VALID [2022-04-15 12:20:50,544 INFO L290 TraceCheckUtils]: 51: Hoare triple {75359#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75360#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:50,545 INFO L290 TraceCheckUtils]: 52: Hoare triple {75360#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75360#(<= main_~i~0 23)} is VALID [2022-04-15 12:20:50,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {75360#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75361#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:50,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {75361#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75361#(<= main_~i~0 24)} is VALID [2022-04-15 12:20:50,545 INFO L290 TraceCheckUtils]: 55: Hoare triple {75361#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75362#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:50,546 INFO L290 TraceCheckUtils]: 56: Hoare triple {75362#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75362#(<= main_~i~0 25)} is VALID [2022-04-15 12:20:50,546 INFO L290 TraceCheckUtils]: 57: Hoare triple {75362#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75363#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:50,546 INFO L290 TraceCheckUtils]: 58: Hoare triple {75363#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75363#(<= main_~i~0 26)} is VALID [2022-04-15 12:20:50,547 INFO L290 TraceCheckUtils]: 59: Hoare triple {75363#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75364#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:50,547 INFO L290 TraceCheckUtils]: 60: Hoare triple {75364#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75364#(<= main_~i~0 27)} is VALID [2022-04-15 12:20:50,547 INFO L290 TraceCheckUtils]: 61: Hoare triple {75364#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75365#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:50,547 INFO L290 TraceCheckUtils]: 62: Hoare triple {75365#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75365#(<= main_~i~0 28)} is VALID [2022-04-15 12:20:50,548 INFO L290 TraceCheckUtils]: 63: Hoare triple {75365#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75366#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:50,548 INFO L290 TraceCheckUtils]: 64: Hoare triple {75366#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75366#(<= main_~i~0 29)} is VALID [2022-04-15 12:20:50,548 INFO L290 TraceCheckUtils]: 65: Hoare triple {75366#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75367#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:50,548 INFO L290 TraceCheckUtils]: 66: Hoare triple {75367#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75367#(<= main_~i~0 30)} is VALID [2022-04-15 12:20:50,549 INFO L290 TraceCheckUtils]: 67: Hoare triple {75367#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75368#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:50,549 INFO L290 TraceCheckUtils]: 68: Hoare triple {75368#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75368#(<= main_~i~0 31)} is VALID [2022-04-15 12:20:50,549 INFO L290 TraceCheckUtils]: 69: Hoare triple {75368#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75369#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:50,549 INFO L290 TraceCheckUtils]: 70: Hoare triple {75369#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75369#(<= main_~i~0 32)} is VALID [2022-04-15 12:20:50,550 INFO L290 TraceCheckUtils]: 71: Hoare triple {75369#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75370#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:50,550 INFO L290 TraceCheckUtils]: 72: Hoare triple {75370#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75370#(<= main_~i~0 33)} is VALID [2022-04-15 12:20:50,550 INFO L290 TraceCheckUtils]: 73: Hoare triple {75370#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75371#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:50,551 INFO L290 TraceCheckUtils]: 74: Hoare triple {75371#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75371#(<= main_~i~0 34)} is VALID [2022-04-15 12:20:50,551 INFO L290 TraceCheckUtils]: 75: Hoare triple {75371#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75372#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:50,551 INFO L290 TraceCheckUtils]: 76: Hoare triple {75372#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75372#(<= main_~i~0 35)} is VALID [2022-04-15 12:20:50,551 INFO L290 TraceCheckUtils]: 77: Hoare triple {75372#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75373#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:50,552 INFO L290 TraceCheckUtils]: 78: Hoare triple {75373#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75373#(<= main_~i~0 36)} is VALID [2022-04-15 12:20:50,552 INFO L290 TraceCheckUtils]: 79: Hoare triple {75373#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75374#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:50,552 INFO L290 TraceCheckUtils]: 80: Hoare triple {75374#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75374#(<= main_~i~0 37)} is VALID [2022-04-15 12:20:50,553 INFO L290 TraceCheckUtils]: 81: Hoare triple {75374#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75375#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:50,553 INFO L290 TraceCheckUtils]: 82: Hoare triple {75375#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75375#(<= main_~i~0 38)} is VALID [2022-04-15 12:20:50,553 INFO L290 TraceCheckUtils]: 83: Hoare triple {75375#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75376#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:50,553 INFO L290 TraceCheckUtils]: 84: Hoare triple {75376#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75376#(<= main_~i~0 39)} is VALID [2022-04-15 12:20:50,554 INFO L290 TraceCheckUtils]: 85: Hoare triple {75376#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75377#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:50,554 INFO L290 TraceCheckUtils]: 86: Hoare triple {75377#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75377#(<= main_~i~0 40)} is VALID [2022-04-15 12:20:50,554 INFO L290 TraceCheckUtils]: 87: Hoare triple {75377#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75378#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:50,554 INFO L290 TraceCheckUtils]: 88: Hoare triple {75378#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75378#(<= main_~i~0 41)} is VALID [2022-04-15 12:20:50,555 INFO L290 TraceCheckUtils]: 89: Hoare triple {75378#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75379#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:50,555 INFO L290 TraceCheckUtils]: 90: Hoare triple {75379#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75379#(<= main_~i~0 42)} is VALID [2022-04-15 12:20:50,555 INFO L290 TraceCheckUtils]: 91: Hoare triple {75379#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75380#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:50,555 INFO L290 TraceCheckUtils]: 92: Hoare triple {75380#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75380#(<= main_~i~0 43)} is VALID [2022-04-15 12:20:50,556 INFO L290 TraceCheckUtils]: 93: Hoare triple {75380#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75381#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:50,556 INFO L290 TraceCheckUtils]: 94: Hoare triple {75381#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75381#(<= main_~i~0 44)} is VALID [2022-04-15 12:20:50,556 INFO L290 TraceCheckUtils]: 95: Hoare triple {75381#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75382#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:50,557 INFO L290 TraceCheckUtils]: 96: Hoare triple {75382#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75382#(<= main_~i~0 45)} is VALID [2022-04-15 12:20:50,557 INFO L290 TraceCheckUtils]: 97: Hoare triple {75382#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75383#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:50,557 INFO L290 TraceCheckUtils]: 98: Hoare triple {75383#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75383#(<= main_~i~0 46)} is VALID [2022-04-15 12:20:50,557 INFO L290 TraceCheckUtils]: 99: Hoare triple {75383#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75384#(<= main_~i~0 47)} is VALID [2022-04-15 12:20:50,558 INFO L290 TraceCheckUtils]: 100: Hoare triple {75384#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75384#(<= main_~i~0 47)} is VALID [2022-04-15 12:20:50,558 INFO L290 TraceCheckUtils]: 101: Hoare triple {75384#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75385#(<= main_~i~0 48)} is VALID [2022-04-15 12:20:50,558 INFO L290 TraceCheckUtils]: 102: Hoare triple {75385#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75385#(<= main_~i~0 48)} is VALID [2022-04-15 12:20:50,559 INFO L290 TraceCheckUtils]: 103: Hoare triple {75385#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75386#(<= main_~i~0 49)} is VALID [2022-04-15 12:20:50,559 INFO L290 TraceCheckUtils]: 104: Hoare triple {75386#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75386#(<= main_~i~0 49)} is VALID [2022-04-15 12:20:50,559 INFO L290 TraceCheckUtils]: 105: Hoare triple {75386#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75387#(<= main_~i~0 50)} is VALID [2022-04-15 12:20:50,559 INFO L290 TraceCheckUtils]: 106: Hoare triple {75387#(<= main_~i~0 50)} assume !(~i~0 < 1024); {75333#false} is VALID [2022-04-15 12:20:50,559 INFO L290 TraceCheckUtils]: 107: Hoare triple {75333#false} ~i~0 := 0; {75333#false} is VALID [2022-04-15 12:20:50,559 INFO L290 TraceCheckUtils]: 108: Hoare triple {75333#false} #t~short5 := ~i~0 < 1024; {75333#false} is VALID [2022-04-15 12:20:50,560 INFO L290 TraceCheckUtils]: 109: Hoare triple {75333#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75333#false} is VALID [2022-04-15 12:20:50,560 INFO L290 TraceCheckUtils]: 110: Hoare triple {75333#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75333#false} is VALID [2022-04-15 12:20:50,560 INFO L290 TraceCheckUtils]: 111: Hoare triple {75333#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75333#false} is VALID [2022-04-15 12:20:50,560 INFO L290 TraceCheckUtils]: 112: Hoare triple {75333#false} #t~short5 := ~i~0 < 1024; {75333#false} is VALID [2022-04-15 12:20:50,560 INFO L290 TraceCheckUtils]: 113: Hoare triple {75333#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75333#false} is VALID [2022-04-15 12:20:50,560 INFO L290 TraceCheckUtils]: 114: Hoare triple {75333#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75333#false} is VALID [2022-04-15 12:20:50,560 INFO L290 TraceCheckUtils]: 115: Hoare triple {75333#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75333#false} is VALID [2022-04-15 12:20:50,560 INFO L290 TraceCheckUtils]: 116: Hoare triple {75333#false} #t~short5 := ~i~0 < 1024; {75333#false} is VALID [2022-04-15 12:20:50,560 INFO L290 TraceCheckUtils]: 117: Hoare triple {75333#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75333#false} is VALID [2022-04-15 12:20:50,560 INFO L290 TraceCheckUtils]: 118: Hoare triple {75333#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {75333#false} is VALID [2022-04-15 12:20:50,560 INFO L272 TraceCheckUtils]: 119: Hoare triple {75333#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {75333#false} is VALID [2022-04-15 12:20:50,560 INFO L290 TraceCheckUtils]: 120: Hoare triple {75333#false} ~cond := #in~cond; {75333#false} is VALID [2022-04-15 12:20:50,560 INFO L290 TraceCheckUtils]: 121: Hoare triple {75333#false} assume 0 == ~cond; {75333#false} is VALID [2022-04-15 12:20:50,560 INFO L290 TraceCheckUtils]: 122: Hoare triple {75333#false} assume !false; {75333#false} is VALID [2022-04-15 12:20:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:20:50,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:50,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405341173] [2022-04-15 12:20:50,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405341173] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:50,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285908717] [2022-04-15 12:20:50,561 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:20:50,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:50,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:50,562 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:20:50,563 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:20:50,816 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:20:50,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:50,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:20:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:50,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:51,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {75332#true} call ULTIMATE.init(); {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {75332#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {75332#true} assume true; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75332#true} {75332#true} #64#return; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {75332#true} call #t~ret6 := main(); {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {75332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 37: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 39: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 40: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 41: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 46: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 47: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 48: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 49: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 50: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 51: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 52: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 55: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 56: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 57: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 59: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 60: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 62: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 63: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 64: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 65: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 66: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 67: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 68: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 69: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 70: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 71: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 72: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 73: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 74: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 75: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 76: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 77: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,086 INFO L290 TraceCheckUtils]: 78: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 79: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 80: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 81: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 82: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 83: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 84: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 85: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 86: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 87: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 88: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 89: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 90: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 91: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 92: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 93: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 94: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 95: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 96: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 97: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,087 INFO L290 TraceCheckUtils]: 98: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,088 INFO L290 TraceCheckUtils]: 99: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,088 INFO L290 TraceCheckUtils]: 100: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,088 INFO L290 TraceCheckUtils]: 101: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,088 INFO L290 TraceCheckUtils]: 102: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,088 INFO L290 TraceCheckUtils]: 103: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,088 INFO L290 TraceCheckUtils]: 104: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,088 INFO L290 TraceCheckUtils]: 105: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,088 INFO L290 TraceCheckUtils]: 106: Hoare triple {75332#true} assume !(~i~0 < 1024); {75332#true} is VALID [2022-04-15 12:20:51,088 INFO L290 TraceCheckUtils]: 107: Hoare triple {75332#true} ~i~0 := 0; {75713#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:51,088 INFO L290 TraceCheckUtils]: 108: Hoare triple {75713#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {75713#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:51,089 INFO L290 TraceCheckUtils]: 109: Hoare triple {75713#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75713#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:51,089 INFO L290 TraceCheckUtils]: 110: Hoare triple {75713#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75713#(<= main_~i~0 0)} is VALID [2022-04-15 12:20:51,089 INFO L290 TraceCheckUtils]: 111: Hoare triple {75713#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75338#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:51,089 INFO L290 TraceCheckUtils]: 112: Hoare triple {75338#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {75338#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:51,090 INFO L290 TraceCheckUtils]: 113: Hoare triple {75338#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75338#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:51,090 INFO L290 TraceCheckUtils]: 114: Hoare triple {75338#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75338#(<= main_~i~0 1)} is VALID [2022-04-15 12:20:51,090 INFO L290 TraceCheckUtils]: 115: Hoare triple {75338#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75339#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:51,091 INFO L290 TraceCheckUtils]: 116: Hoare triple {75339#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {75339#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:51,091 INFO L290 TraceCheckUtils]: 117: Hoare triple {75339#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75339#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:51,091 INFO L290 TraceCheckUtils]: 118: Hoare triple {75339#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {75339#(<= main_~i~0 2)} is VALID [2022-04-15 12:20:51,091 INFO L272 TraceCheckUtils]: 119: Hoare triple {75339#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {75750#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:20:51,092 INFO L290 TraceCheckUtils]: 120: Hoare triple {75750#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {75754#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:20:51,092 INFO L290 TraceCheckUtils]: 121: Hoare triple {75754#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {75333#false} is VALID [2022-04-15 12:20:51,092 INFO L290 TraceCheckUtils]: 122: Hoare triple {75333#false} assume !false; {75333#false} is VALID [2022-04-15 12:20:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2022-04-15 12:20:51,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:51,383 INFO L290 TraceCheckUtils]: 122: Hoare triple {75333#false} assume !false; {75333#false} is VALID [2022-04-15 12:20:51,383 INFO L290 TraceCheckUtils]: 121: Hoare triple {75754#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {75333#false} is VALID [2022-04-15 12:20:51,384 INFO L290 TraceCheckUtils]: 120: Hoare triple {75750#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {75754#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:20:51,384 INFO L272 TraceCheckUtils]: 119: Hoare triple {75770#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {75750#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:20:51,384 INFO L290 TraceCheckUtils]: 118: Hoare triple {75770#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {75770#(<= main_~i~0 512)} is VALID [2022-04-15 12:20:51,385 INFO L290 TraceCheckUtils]: 117: Hoare triple {75770#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75770#(<= main_~i~0 512)} is VALID [2022-04-15 12:20:51,385 INFO L290 TraceCheckUtils]: 116: Hoare triple {75770#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {75770#(<= main_~i~0 512)} is VALID [2022-04-15 12:20:51,385 INFO L290 TraceCheckUtils]: 115: Hoare triple {75783#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75770#(<= main_~i~0 512)} is VALID [2022-04-15 12:20:51,385 INFO L290 TraceCheckUtils]: 114: Hoare triple {75783#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75783#(<= main_~i~0 511)} is VALID [2022-04-15 12:20:51,386 INFO L290 TraceCheckUtils]: 113: Hoare triple {75783#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75783#(<= main_~i~0 511)} is VALID [2022-04-15 12:20:51,386 INFO L290 TraceCheckUtils]: 112: Hoare triple {75783#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {75783#(<= main_~i~0 511)} is VALID [2022-04-15 12:20:51,386 INFO L290 TraceCheckUtils]: 111: Hoare triple {75796#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75783#(<= main_~i~0 511)} is VALID [2022-04-15 12:20:51,386 INFO L290 TraceCheckUtils]: 110: Hoare triple {75796#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75796#(<= main_~i~0 510)} is VALID [2022-04-15 12:20:51,387 INFO L290 TraceCheckUtils]: 109: Hoare triple {75796#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75796#(<= main_~i~0 510)} is VALID [2022-04-15 12:20:51,387 INFO L290 TraceCheckUtils]: 108: Hoare triple {75796#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {75796#(<= main_~i~0 510)} is VALID [2022-04-15 12:20:51,387 INFO L290 TraceCheckUtils]: 107: Hoare triple {75332#true} ~i~0 := 0; {75796#(<= main_~i~0 510)} is VALID [2022-04-15 12:20:51,387 INFO L290 TraceCheckUtils]: 106: Hoare triple {75332#true} assume !(~i~0 < 1024); {75332#true} is VALID [2022-04-15 12:20:51,387 INFO L290 TraceCheckUtils]: 105: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,387 INFO L290 TraceCheckUtils]: 104: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,387 INFO L290 TraceCheckUtils]: 103: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 102: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 101: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 100: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 99: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 98: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 97: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 96: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 95: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 94: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 93: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 92: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 91: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 90: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 89: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 88: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 87: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 86: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 85: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 84: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 83: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,388 INFO L290 TraceCheckUtils]: 82: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 81: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 80: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 79: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 78: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 77: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 76: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 75: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 74: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 73: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 72: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 71: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 70: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 69: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 68: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 67: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 66: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 65: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 64: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 61: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 60: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 59: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 58: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 57: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 51: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 40: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 39: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {75332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {75332#true} call #t~ret6 := main(); {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75332#true} {75332#true} #64#return; {75332#true} is VALID [2022-04-15 12:20:51,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {75332#true} assume true; {75332#true} is VALID [2022-04-15 12:20:51,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {75332#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {75332#true} is VALID [2022-04-15 12:20:51,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {75332#true} call ULTIMATE.init(); {75332#true} is VALID [2022-04-15 12:20:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2022-04-15 12:20:51,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285908717] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:51,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:51,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 7, 7] total 60 [2022-04-15 12:20:51,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:51,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [326851217] [2022-04-15 12:20:51,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [326851217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:51,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:51,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-15 12:20:51,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086865473] [2022-04-15 12:20:51,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:51,394 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-15 12:20:51,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:51,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:51,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:51,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-15 12:20:51,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:51,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-15 12:20:51,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1602, Invalid=1938, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 12:20:51,461 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:01,127 INFO L93 Difference]: Finished difference Result 390 states and 496 transitions. [2022-04-15 12:21:01,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-15 12:21:01,127 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-15 12:21:01,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 487 transitions. [2022-04-15 12:21:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 487 transitions. [2022-04-15 12:21:01,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 487 transitions. [2022-04-15 12:21:01,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:01,447 INFO L225 Difference]: With dead ends: 390 [2022-04-15 12:21:01,447 INFO L226 Difference]: Without dead ends: 373 [2022-04-15 12:21:01,448 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4510, Invalid=7700, Unknown=0, NotChecked=0, Total=12210 [2022-04-15 12:21:01,448 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1267 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:01,448 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1267 Valid, 37 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:21:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-04-15 12:21:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 126. [2022-04-15 12:21:02,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:02,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 373 states. Second operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:02,110 INFO L74 IsIncluded]: Start isIncluded. First operand 373 states. Second operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:02,110 INFO L87 Difference]: Start difference. First operand 373 states. Second operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:02,115 INFO L93 Difference]: Finished difference Result 373 states and 475 transitions. [2022-04-15 12:21:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 475 transitions. [2022-04-15 12:21:02,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:02,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:02,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 373 states. [2022-04-15 12:21:02,115 INFO L87 Difference]: Start difference. First operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 373 states. [2022-04-15 12:21:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:02,120 INFO L93 Difference]: Finished difference Result 373 states and 475 transitions. [2022-04-15 12:21:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 475 transitions. [2022-04-15 12:21:02,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:02,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:02,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:02,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2022-04-15 12:21:02,122 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 123 [2022-04-15 12:21:02,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:02,122 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2022-04-15 12:21:02,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:02,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 130 transitions. [2022-04-15 12:21:02,413 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:21:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2022-04-15 12:21:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-15 12:21:02,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:02,414 INFO L499 BasicCegarLoop]: trace histogram [51, 51, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:02,434 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:02,614 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:02,615 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:02,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:02,615 INFO L85 PathProgramCache]: Analyzing trace with hash -930218313, now seen corresponding path program 103 times [2022-04-15 12:21:02,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:02,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1472449237] [2022-04-15 12:21:02,619 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:21:02,619 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:21:02,619 INFO L85 PathProgramCache]: Analyzing trace with hash -930218313, now seen corresponding path program 104 times [2022-04-15 12:21:02,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:02,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422312776] [2022-04-15 12:21:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:03,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:03,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {78069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {78012#true} is VALID [2022-04-15 12:21:03,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {78012#true} assume true; {78012#true} is VALID [2022-04-15 12:21:03,572 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78012#true} {78012#true} #64#return; {78012#true} is VALID [2022-04-15 12:21:03,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {78012#true} call ULTIMATE.init(); {78069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:03,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {78069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {78012#true} is VALID [2022-04-15 12:21:03,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {78012#true} assume true; {78012#true} is VALID [2022-04-15 12:21:03,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78012#true} {78012#true} #64#return; {78012#true} is VALID [2022-04-15 12:21:03,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {78012#true} call #t~ret6 := main(); {78012#true} is VALID [2022-04-15 12:21:03,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {78012#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {78017#(= main_~i~0 0)} is VALID [2022-04-15 12:21:03,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {78017#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78017#(= main_~i~0 0)} is VALID [2022-04-15 12:21:03,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {78017#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78018#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:03,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {78018#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78018#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:03,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {78018#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78019#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:03,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {78019#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78019#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:03,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {78019#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78020#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:03,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {78020#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78020#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:03,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {78020#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78021#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:03,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {78021#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78021#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:03,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {78021#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78022#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:03,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {78022#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78022#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:03,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {78022#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78023#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:03,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {78023#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78023#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:03,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {78023#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78024#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:03,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {78024#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78024#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:03,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {78024#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78025#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:03,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {78025#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78025#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:03,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {78025#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78026#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:03,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {78026#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78026#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:03,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {78026#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78027#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:03,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {78027#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78027#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:03,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {78027#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78028#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:03,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {78028#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78028#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:03,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {78028#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78029#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:03,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {78029#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78029#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:03,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {78029#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78030#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:03,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {78030#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78030#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:03,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {78030#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78031#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:03,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {78031#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78031#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:03,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {78031#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78032#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:03,581 INFO L290 TraceCheckUtils]: 36: Hoare triple {78032#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78032#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:03,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {78032#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78033#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:03,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {78033#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78033#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:03,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {78033#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78034#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:03,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {78034#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78034#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:03,583 INFO L290 TraceCheckUtils]: 41: Hoare triple {78034#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78035#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:03,583 INFO L290 TraceCheckUtils]: 42: Hoare triple {78035#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78035#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:03,583 INFO L290 TraceCheckUtils]: 43: Hoare triple {78035#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78036#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:03,584 INFO L290 TraceCheckUtils]: 44: Hoare triple {78036#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78036#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:03,584 INFO L290 TraceCheckUtils]: 45: Hoare triple {78036#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78037#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:03,584 INFO L290 TraceCheckUtils]: 46: Hoare triple {78037#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78037#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:03,584 INFO L290 TraceCheckUtils]: 47: Hoare triple {78037#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78038#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:03,585 INFO L290 TraceCheckUtils]: 48: Hoare triple {78038#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78038#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:03,585 INFO L290 TraceCheckUtils]: 49: Hoare triple {78038#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78039#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:03,585 INFO L290 TraceCheckUtils]: 50: Hoare triple {78039#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78039#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:03,586 INFO L290 TraceCheckUtils]: 51: Hoare triple {78039#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78040#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:03,586 INFO L290 TraceCheckUtils]: 52: Hoare triple {78040#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78040#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:03,586 INFO L290 TraceCheckUtils]: 53: Hoare triple {78040#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78041#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:03,586 INFO L290 TraceCheckUtils]: 54: Hoare triple {78041#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78041#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:03,587 INFO L290 TraceCheckUtils]: 55: Hoare triple {78041#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78042#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:03,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {78042#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78042#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:03,587 INFO L290 TraceCheckUtils]: 57: Hoare triple {78042#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78043#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:03,587 INFO L290 TraceCheckUtils]: 58: Hoare triple {78043#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78043#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:03,588 INFO L290 TraceCheckUtils]: 59: Hoare triple {78043#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78044#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:03,588 INFO L290 TraceCheckUtils]: 60: Hoare triple {78044#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78044#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:03,588 INFO L290 TraceCheckUtils]: 61: Hoare triple {78044#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78045#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:03,589 INFO L290 TraceCheckUtils]: 62: Hoare triple {78045#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78045#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:03,589 INFO L290 TraceCheckUtils]: 63: Hoare triple {78045#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78046#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:03,589 INFO L290 TraceCheckUtils]: 64: Hoare triple {78046#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78046#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:03,589 INFO L290 TraceCheckUtils]: 65: Hoare triple {78046#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78047#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:03,590 INFO L290 TraceCheckUtils]: 66: Hoare triple {78047#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78047#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:03,590 INFO L290 TraceCheckUtils]: 67: Hoare triple {78047#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78048#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:03,590 INFO L290 TraceCheckUtils]: 68: Hoare triple {78048#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78048#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:03,591 INFO L290 TraceCheckUtils]: 69: Hoare triple {78048#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78049#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:03,591 INFO L290 TraceCheckUtils]: 70: Hoare triple {78049#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78049#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:03,591 INFO L290 TraceCheckUtils]: 71: Hoare triple {78049#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78050#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:03,591 INFO L290 TraceCheckUtils]: 72: Hoare triple {78050#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78050#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:03,592 INFO L290 TraceCheckUtils]: 73: Hoare triple {78050#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78051#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:03,592 INFO L290 TraceCheckUtils]: 74: Hoare triple {78051#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78051#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:03,592 INFO L290 TraceCheckUtils]: 75: Hoare triple {78051#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78052#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:03,592 INFO L290 TraceCheckUtils]: 76: Hoare triple {78052#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78052#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:03,593 INFO L290 TraceCheckUtils]: 77: Hoare triple {78052#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78053#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:03,593 INFO L290 TraceCheckUtils]: 78: Hoare triple {78053#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78053#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:03,593 INFO L290 TraceCheckUtils]: 79: Hoare triple {78053#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78054#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:03,594 INFO L290 TraceCheckUtils]: 80: Hoare triple {78054#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78054#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:03,594 INFO L290 TraceCheckUtils]: 81: Hoare triple {78054#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78055#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:03,594 INFO L290 TraceCheckUtils]: 82: Hoare triple {78055#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78055#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:03,594 INFO L290 TraceCheckUtils]: 83: Hoare triple {78055#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78056#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:03,595 INFO L290 TraceCheckUtils]: 84: Hoare triple {78056#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78056#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:03,595 INFO L290 TraceCheckUtils]: 85: Hoare triple {78056#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78057#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:03,595 INFO L290 TraceCheckUtils]: 86: Hoare triple {78057#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78057#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:03,596 INFO L290 TraceCheckUtils]: 87: Hoare triple {78057#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78058#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:03,596 INFO L290 TraceCheckUtils]: 88: Hoare triple {78058#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78058#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:03,596 INFO L290 TraceCheckUtils]: 89: Hoare triple {78058#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78059#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:03,596 INFO L290 TraceCheckUtils]: 90: Hoare triple {78059#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78059#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:03,597 INFO L290 TraceCheckUtils]: 91: Hoare triple {78059#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78060#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:03,597 INFO L290 TraceCheckUtils]: 92: Hoare triple {78060#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78060#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:03,597 INFO L290 TraceCheckUtils]: 93: Hoare triple {78060#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78061#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:03,597 INFO L290 TraceCheckUtils]: 94: Hoare triple {78061#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78061#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:03,598 INFO L290 TraceCheckUtils]: 95: Hoare triple {78061#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78062#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:03,598 INFO L290 TraceCheckUtils]: 96: Hoare triple {78062#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78062#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:03,598 INFO L290 TraceCheckUtils]: 97: Hoare triple {78062#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78063#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:03,599 INFO L290 TraceCheckUtils]: 98: Hoare triple {78063#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78063#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:03,599 INFO L290 TraceCheckUtils]: 99: Hoare triple {78063#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78064#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:03,599 INFO L290 TraceCheckUtils]: 100: Hoare triple {78064#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78064#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:03,599 INFO L290 TraceCheckUtils]: 101: Hoare triple {78064#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78065#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:03,600 INFO L290 TraceCheckUtils]: 102: Hoare triple {78065#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78065#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:03,600 INFO L290 TraceCheckUtils]: 103: Hoare triple {78065#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78066#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:03,600 INFO L290 TraceCheckUtils]: 104: Hoare triple {78066#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78066#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:03,601 INFO L290 TraceCheckUtils]: 105: Hoare triple {78066#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78067#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:03,601 INFO L290 TraceCheckUtils]: 106: Hoare triple {78067#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78067#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:03,601 INFO L290 TraceCheckUtils]: 107: Hoare triple {78067#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78068#(<= main_~i~0 51)} is VALID [2022-04-15 12:21:03,601 INFO L290 TraceCheckUtils]: 108: Hoare triple {78068#(<= main_~i~0 51)} assume !(~i~0 < 1024); {78013#false} is VALID [2022-04-15 12:21:03,601 INFO L290 TraceCheckUtils]: 109: Hoare triple {78013#false} ~i~0 := 0; {78013#false} is VALID [2022-04-15 12:21:03,601 INFO L290 TraceCheckUtils]: 110: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 12:21:03,602 INFO L290 TraceCheckUtils]: 111: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 12:21:03,602 INFO L290 TraceCheckUtils]: 112: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 12:21:03,602 INFO L290 TraceCheckUtils]: 113: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-15 12:21:03,602 INFO L290 TraceCheckUtils]: 114: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 12:21:03,602 INFO L290 TraceCheckUtils]: 115: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 12:21:03,602 INFO L290 TraceCheckUtils]: 116: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 12:21:03,602 INFO L290 TraceCheckUtils]: 117: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-15 12:21:03,602 INFO L290 TraceCheckUtils]: 118: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 12:21:03,602 INFO L290 TraceCheckUtils]: 119: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 12:21:03,602 INFO L290 TraceCheckUtils]: 120: Hoare triple {78013#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 12:21:03,602 INFO L272 TraceCheckUtils]: 121: Hoare triple {78013#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {78013#false} is VALID [2022-04-15 12:21:03,602 INFO L290 TraceCheckUtils]: 122: Hoare triple {78013#false} ~cond := #in~cond; {78013#false} is VALID [2022-04-15 12:21:03,602 INFO L290 TraceCheckUtils]: 123: Hoare triple {78013#false} assume 0 == ~cond; {78013#false} is VALID [2022-04-15 12:21:03,602 INFO L290 TraceCheckUtils]: 124: Hoare triple {78013#false} assume !false; {78013#false} is VALID [2022-04-15 12:21:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2611 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:21:03,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:03,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422312776] [2022-04-15 12:21:03,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422312776] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:03,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491615447] [2022-04-15 12:21:03,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:21:03,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:03,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:03,604 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:03,604 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:03,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:21:03,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:03,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-15 12:21:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:03,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:04,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {78012#true} call ULTIMATE.init(); {78012#true} is VALID [2022-04-15 12:21:04,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {78012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {78012#true} is VALID [2022-04-15 12:21:04,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {78012#true} assume true; {78012#true} is VALID [2022-04-15 12:21:04,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78012#true} {78012#true} #64#return; {78012#true} is VALID [2022-04-15 12:21:04,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {78012#true} call #t~ret6 := main(); {78012#true} is VALID [2022-04-15 12:21:04,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {78012#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {78088#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:04,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {78088#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78088#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:04,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {78088#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78018#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:04,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {78018#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78018#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:04,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {78018#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78019#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:04,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {78019#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78019#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:04,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {78019#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78020#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:04,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {78020#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78020#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:04,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {78020#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78021#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:04,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {78021#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78021#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:04,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {78021#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78022#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:04,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {78022#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78022#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:04,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {78022#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78023#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:04,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {78023#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78023#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:04,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {78023#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78024#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:04,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {78024#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78024#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:04,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {78024#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78025#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:04,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {78025#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78025#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:04,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {78025#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78026#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:04,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {78026#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78026#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:04,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {78026#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78027#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:04,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {78027#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78027#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:04,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {78027#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78028#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:04,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {78028#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78028#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:04,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {78028#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78029#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:04,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {78029#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78029#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:04,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {78029#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78030#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:04,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {78030#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78030#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:04,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {78030#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78031#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:04,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {78031#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78031#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:04,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {78031#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78032#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:04,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {78032#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78032#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:04,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {78032#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78033#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:04,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {78033#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78033#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:04,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {78033#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78034#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:04,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {78034#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78034#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:04,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {78034#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78035#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:04,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {78035#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78035#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:04,506 INFO L290 TraceCheckUtils]: 43: Hoare triple {78035#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78036#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:04,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {78036#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78036#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:04,506 INFO L290 TraceCheckUtils]: 45: Hoare triple {78036#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78037#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:04,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {78037#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78037#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:04,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {78037#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78038#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:04,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {78038#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78038#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:04,508 INFO L290 TraceCheckUtils]: 49: Hoare triple {78038#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78039#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:04,508 INFO L290 TraceCheckUtils]: 50: Hoare triple {78039#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78039#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:04,508 INFO L290 TraceCheckUtils]: 51: Hoare triple {78039#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78040#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:04,508 INFO L290 TraceCheckUtils]: 52: Hoare triple {78040#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78040#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:04,509 INFO L290 TraceCheckUtils]: 53: Hoare triple {78040#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78041#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:04,509 INFO L290 TraceCheckUtils]: 54: Hoare triple {78041#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78041#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:04,509 INFO L290 TraceCheckUtils]: 55: Hoare triple {78041#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78042#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:04,509 INFO L290 TraceCheckUtils]: 56: Hoare triple {78042#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78042#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:04,510 INFO L290 TraceCheckUtils]: 57: Hoare triple {78042#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78043#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:04,510 INFO L290 TraceCheckUtils]: 58: Hoare triple {78043#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78043#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:04,510 INFO L290 TraceCheckUtils]: 59: Hoare triple {78043#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78044#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:04,511 INFO L290 TraceCheckUtils]: 60: Hoare triple {78044#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78044#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:04,511 INFO L290 TraceCheckUtils]: 61: Hoare triple {78044#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78045#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:04,511 INFO L290 TraceCheckUtils]: 62: Hoare triple {78045#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78045#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:04,511 INFO L290 TraceCheckUtils]: 63: Hoare triple {78045#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78046#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:04,512 INFO L290 TraceCheckUtils]: 64: Hoare triple {78046#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78046#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:04,512 INFO L290 TraceCheckUtils]: 65: Hoare triple {78046#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78047#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:04,512 INFO L290 TraceCheckUtils]: 66: Hoare triple {78047#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78047#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:04,513 INFO L290 TraceCheckUtils]: 67: Hoare triple {78047#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78048#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:04,513 INFO L290 TraceCheckUtils]: 68: Hoare triple {78048#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78048#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:04,513 INFO L290 TraceCheckUtils]: 69: Hoare triple {78048#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78049#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:04,513 INFO L290 TraceCheckUtils]: 70: Hoare triple {78049#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78049#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:04,514 INFO L290 TraceCheckUtils]: 71: Hoare triple {78049#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78050#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:04,514 INFO L290 TraceCheckUtils]: 72: Hoare triple {78050#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78050#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:04,514 INFO L290 TraceCheckUtils]: 73: Hoare triple {78050#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78051#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:04,514 INFO L290 TraceCheckUtils]: 74: Hoare triple {78051#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78051#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:04,515 INFO L290 TraceCheckUtils]: 75: Hoare triple {78051#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78052#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:04,515 INFO L290 TraceCheckUtils]: 76: Hoare triple {78052#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78052#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:04,515 INFO L290 TraceCheckUtils]: 77: Hoare triple {78052#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78053#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:04,516 INFO L290 TraceCheckUtils]: 78: Hoare triple {78053#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78053#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:04,516 INFO L290 TraceCheckUtils]: 79: Hoare triple {78053#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78054#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:04,516 INFO L290 TraceCheckUtils]: 80: Hoare triple {78054#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78054#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:04,516 INFO L290 TraceCheckUtils]: 81: Hoare triple {78054#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78055#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:04,517 INFO L290 TraceCheckUtils]: 82: Hoare triple {78055#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78055#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:04,517 INFO L290 TraceCheckUtils]: 83: Hoare triple {78055#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78056#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:04,517 INFO L290 TraceCheckUtils]: 84: Hoare triple {78056#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78056#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:04,518 INFO L290 TraceCheckUtils]: 85: Hoare triple {78056#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78057#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:04,518 INFO L290 TraceCheckUtils]: 86: Hoare triple {78057#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78057#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:04,518 INFO L290 TraceCheckUtils]: 87: Hoare triple {78057#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78058#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:04,518 INFO L290 TraceCheckUtils]: 88: Hoare triple {78058#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78058#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:04,519 INFO L290 TraceCheckUtils]: 89: Hoare triple {78058#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78059#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:04,519 INFO L290 TraceCheckUtils]: 90: Hoare triple {78059#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78059#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:04,519 INFO L290 TraceCheckUtils]: 91: Hoare triple {78059#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78060#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:04,519 INFO L290 TraceCheckUtils]: 92: Hoare triple {78060#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78060#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:04,520 INFO L290 TraceCheckUtils]: 93: Hoare triple {78060#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78061#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:04,520 INFO L290 TraceCheckUtils]: 94: Hoare triple {78061#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78061#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:04,520 INFO L290 TraceCheckUtils]: 95: Hoare triple {78061#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78062#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:04,521 INFO L290 TraceCheckUtils]: 96: Hoare triple {78062#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78062#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:04,521 INFO L290 TraceCheckUtils]: 97: Hoare triple {78062#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78063#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:04,521 INFO L290 TraceCheckUtils]: 98: Hoare triple {78063#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78063#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:04,521 INFO L290 TraceCheckUtils]: 99: Hoare triple {78063#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78064#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:04,522 INFO L290 TraceCheckUtils]: 100: Hoare triple {78064#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78064#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:04,522 INFO L290 TraceCheckUtils]: 101: Hoare triple {78064#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78065#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:04,522 INFO L290 TraceCheckUtils]: 102: Hoare triple {78065#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78065#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:04,522 INFO L290 TraceCheckUtils]: 103: Hoare triple {78065#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78066#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:04,523 INFO L290 TraceCheckUtils]: 104: Hoare triple {78066#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78066#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:04,523 INFO L290 TraceCheckUtils]: 105: Hoare triple {78066#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78067#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:04,523 INFO L290 TraceCheckUtils]: 106: Hoare triple {78067#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78067#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:04,524 INFO L290 TraceCheckUtils]: 107: Hoare triple {78067#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78068#(<= main_~i~0 51)} is VALID [2022-04-15 12:21:04,524 INFO L290 TraceCheckUtils]: 108: Hoare triple {78068#(<= main_~i~0 51)} assume !(~i~0 < 1024); {78013#false} is VALID [2022-04-15 12:21:04,524 INFO L290 TraceCheckUtils]: 109: Hoare triple {78013#false} ~i~0 := 0; {78013#false} is VALID [2022-04-15 12:21:04,524 INFO L290 TraceCheckUtils]: 110: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 12:21:04,524 INFO L290 TraceCheckUtils]: 111: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 12:21:04,524 INFO L290 TraceCheckUtils]: 112: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 12:21:04,524 INFO L290 TraceCheckUtils]: 113: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-15 12:21:04,524 INFO L290 TraceCheckUtils]: 114: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 12:21:04,524 INFO L290 TraceCheckUtils]: 115: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 12:21:04,524 INFO L290 TraceCheckUtils]: 116: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 12:21:04,524 INFO L290 TraceCheckUtils]: 117: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-15 12:21:04,524 INFO L290 TraceCheckUtils]: 118: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 12:21:04,524 INFO L290 TraceCheckUtils]: 119: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 12:21:04,525 INFO L290 TraceCheckUtils]: 120: Hoare triple {78013#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 12:21:04,525 INFO L272 TraceCheckUtils]: 121: Hoare triple {78013#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {78013#false} is VALID [2022-04-15 12:21:04,525 INFO L290 TraceCheckUtils]: 122: Hoare triple {78013#false} ~cond := #in~cond; {78013#false} is VALID [2022-04-15 12:21:04,525 INFO L290 TraceCheckUtils]: 123: Hoare triple {78013#false} assume 0 == ~cond; {78013#false} is VALID [2022-04-15 12:21:04,525 INFO L290 TraceCheckUtils]: 124: Hoare triple {78013#false} assume !false; {78013#false} is VALID [2022-04-15 12:21:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2611 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:21:04,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:21:07,282 INFO L290 TraceCheckUtils]: 124: Hoare triple {78013#false} assume !false; {78013#false} is VALID [2022-04-15 12:21:07,282 INFO L290 TraceCheckUtils]: 123: Hoare triple {78013#false} assume 0 == ~cond; {78013#false} is VALID [2022-04-15 12:21:07,282 INFO L290 TraceCheckUtils]: 122: Hoare triple {78013#false} ~cond := #in~cond; {78013#false} is VALID [2022-04-15 12:21:07,282 INFO L272 TraceCheckUtils]: 121: Hoare triple {78013#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {78013#false} is VALID [2022-04-15 12:21:07,282 INFO L290 TraceCheckUtils]: 120: Hoare triple {78013#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 12:21:07,282 INFO L290 TraceCheckUtils]: 119: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 12:21:07,282 INFO L290 TraceCheckUtils]: 118: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 12:21:07,282 INFO L290 TraceCheckUtils]: 117: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-15 12:21:07,282 INFO L290 TraceCheckUtils]: 116: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 12:21:07,282 INFO L290 TraceCheckUtils]: 115: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 12:21:07,282 INFO L290 TraceCheckUtils]: 114: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 12:21:07,282 INFO L290 TraceCheckUtils]: 113: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-15 12:21:07,282 INFO L290 TraceCheckUtils]: 112: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 12:21:07,283 INFO L290 TraceCheckUtils]: 111: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 12:21:07,283 INFO L290 TraceCheckUtils]: 110: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 12:21:07,283 INFO L290 TraceCheckUtils]: 109: Hoare triple {78013#false} ~i~0 := 0; {78013#false} is VALID [2022-04-15 12:21:07,283 INFO L290 TraceCheckUtils]: 108: Hoare triple {78494#(< main_~i~0 1024)} assume !(~i~0 < 1024); {78013#false} is VALID [2022-04-15 12:21:07,283 INFO L290 TraceCheckUtils]: 107: Hoare triple {78498#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78494#(< main_~i~0 1024)} is VALID [2022-04-15 12:21:07,283 INFO L290 TraceCheckUtils]: 106: Hoare triple {78498#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78498#(< main_~i~0 1023)} is VALID [2022-04-15 12:21:07,284 INFO L290 TraceCheckUtils]: 105: Hoare triple {78505#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78498#(< main_~i~0 1023)} is VALID [2022-04-15 12:21:07,292 INFO L290 TraceCheckUtils]: 104: Hoare triple {78505#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78505#(< main_~i~0 1022)} is VALID [2022-04-15 12:21:07,293 INFO L290 TraceCheckUtils]: 103: Hoare triple {78512#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78505#(< main_~i~0 1022)} is VALID [2022-04-15 12:21:07,293 INFO L290 TraceCheckUtils]: 102: Hoare triple {78512#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78512#(< main_~i~0 1021)} is VALID [2022-04-15 12:21:07,293 INFO L290 TraceCheckUtils]: 101: Hoare triple {78519#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78512#(< main_~i~0 1021)} is VALID [2022-04-15 12:21:07,294 INFO L290 TraceCheckUtils]: 100: Hoare triple {78519#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78519#(< main_~i~0 1020)} is VALID [2022-04-15 12:21:07,294 INFO L290 TraceCheckUtils]: 99: Hoare triple {78526#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78519#(< main_~i~0 1020)} is VALID [2022-04-15 12:21:07,294 INFO L290 TraceCheckUtils]: 98: Hoare triple {78526#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78526#(< main_~i~0 1019)} is VALID [2022-04-15 12:21:07,294 INFO L290 TraceCheckUtils]: 97: Hoare triple {78533#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78526#(< main_~i~0 1019)} is VALID [2022-04-15 12:21:07,295 INFO L290 TraceCheckUtils]: 96: Hoare triple {78533#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78533#(< main_~i~0 1018)} is VALID [2022-04-15 12:21:07,295 INFO L290 TraceCheckUtils]: 95: Hoare triple {78540#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78533#(< main_~i~0 1018)} is VALID [2022-04-15 12:21:07,295 INFO L290 TraceCheckUtils]: 94: Hoare triple {78540#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78540#(< main_~i~0 1017)} is VALID [2022-04-15 12:21:07,296 INFO L290 TraceCheckUtils]: 93: Hoare triple {78547#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78540#(< main_~i~0 1017)} is VALID [2022-04-15 12:21:07,296 INFO L290 TraceCheckUtils]: 92: Hoare triple {78547#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78547#(< main_~i~0 1016)} is VALID [2022-04-15 12:21:07,296 INFO L290 TraceCheckUtils]: 91: Hoare triple {78554#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78547#(< main_~i~0 1016)} is VALID [2022-04-15 12:21:07,296 INFO L290 TraceCheckUtils]: 90: Hoare triple {78554#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78554#(< main_~i~0 1015)} is VALID [2022-04-15 12:21:07,297 INFO L290 TraceCheckUtils]: 89: Hoare triple {78561#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78554#(< main_~i~0 1015)} is VALID [2022-04-15 12:21:07,297 INFO L290 TraceCheckUtils]: 88: Hoare triple {78561#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78561#(< main_~i~0 1014)} is VALID [2022-04-15 12:21:07,297 INFO L290 TraceCheckUtils]: 87: Hoare triple {78568#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78561#(< main_~i~0 1014)} is VALID [2022-04-15 12:21:07,298 INFO L290 TraceCheckUtils]: 86: Hoare triple {78568#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78568#(< main_~i~0 1013)} is VALID [2022-04-15 12:21:07,298 INFO L290 TraceCheckUtils]: 85: Hoare triple {78575#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78568#(< main_~i~0 1013)} is VALID [2022-04-15 12:21:07,298 INFO L290 TraceCheckUtils]: 84: Hoare triple {78575#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78575#(< main_~i~0 1012)} is VALID [2022-04-15 12:21:07,298 INFO L290 TraceCheckUtils]: 83: Hoare triple {78582#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78575#(< main_~i~0 1012)} is VALID [2022-04-15 12:21:07,299 INFO L290 TraceCheckUtils]: 82: Hoare triple {78582#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78582#(< main_~i~0 1011)} is VALID [2022-04-15 12:21:07,299 INFO L290 TraceCheckUtils]: 81: Hoare triple {78589#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78582#(< main_~i~0 1011)} is VALID [2022-04-15 12:21:07,299 INFO L290 TraceCheckUtils]: 80: Hoare triple {78589#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78589#(< main_~i~0 1010)} is VALID [2022-04-15 12:21:07,300 INFO L290 TraceCheckUtils]: 79: Hoare triple {78596#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78589#(< main_~i~0 1010)} is VALID [2022-04-15 12:21:07,300 INFO L290 TraceCheckUtils]: 78: Hoare triple {78596#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78596#(< main_~i~0 1009)} is VALID [2022-04-15 12:21:07,300 INFO L290 TraceCheckUtils]: 77: Hoare triple {78603#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78596#(< main_~i~0 1009)} is VALID [2022-04-15 12:21:07,300 INFO L290 TraceCheckUtils]: 76: Hoare triple {78603#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78603#(< main_~i~0 1008)} is VALID [2022-04-15 12:21:07,301 INFO L290 TraceCheckUtils]: 75: Hoare triple {78610#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78603#(< main_~i~0 1008)} is VALID [2022-04-15 12:21:07,301 INFO L290 TraceCheckUtils]: 74: Hoare triple {78610#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78610#(< main_~i~0 1007)} is VALID [2022-04-15 12:21:07,301 INFO L290 TraceCheckUtils]: 73: Hoare triple {78617#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78610#(< main_~i~0 1007)} is VALID [2022-04-15 12:21:07,301 INFO L290 TraceCheckUtils]: 72: Hoare triple {78617#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78617#(< main_~i~0 1006)} is VALID [2022-04-15 12:21:07,302 INFO L290 TraceCheckUtils]: 71: Hoare triple {78624#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78617#(< main_~i~0 1006)} is VALID [2022-04-15 12:21:07,302 INFO L290 TraceCheckUtils]: 70: Hoare triple {78624#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78624#(< main_~i~0 1005)} is VALID [2022-04-15 12:21:07,302 INFO L290 TraceCheckUtils]: 69: Hoare triple {78631#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78624#(< main_~i~0 1005)} is VALID [2022-04-15 12:21:07,303 INFO L290 TraceCheckUtils]: 68: Hoare triple {78631#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78631#(< main_~i~0 1004)} is VALID [2022-04-15 12:21:07,303 INFO L290 TraceCheckUtils]: 67: Hoare triple {78638#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78631#(< main_~i~0 1004)} is VALID [2022-04-15 12:21:07,303 INFO L290 TraceCheckUtils]: 66: Hoare triple {78638#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78638#(< main_~i~0 1003)} is VALID [2022-04-15 12:21:07,304 INFO L290 TraceCheckUtils]: 65: Hoare triple {78645#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78638#(< main_~i~0 1003)} is VALID [2022-04-15 12:21:07,304 INFO L290 TraceCheckUtils]: 64: Hoare triple {78645#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78645#(< main_~i~0 1002)} is VALID [2022-04-15 12:21:07,304 INFO L290 TraceCheckUtils]: 63: Hoare triple {78652#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78645#(< main_~i~0 1002)} is VALID [2022-04-15 12:21:07,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {78652#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78652#(< main_~i~0 1001)} is VALID [2022-04-15 12:21:07,305 INFO L290 TraceCheckUtils]: 61: Hoare triple {78659#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78652#(< main_~i~0 1001)} is VALID [2022-04-15 12:21:07,305 INFO L290 TraceCheckUtils]: 60: Hoare triple {78659#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78659#(< main_~i~0 1000)} is VALID [2022-04-15 12:21:07,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {78666#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78659#(< main_~i~0 1000)} is VALID [2022-04-15 12:21:07,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {78666#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78666#(< main_~i~0 999)} is VALID [2022-04-15 12:21:07,306 INFO L290 TraceCheckUtils]: 57: Hoare triple {78673#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78666#(< main_~i~0 999)} is VALID [2022-04-15 12:21:07,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {78673#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78673#(< main_~i~0 998)} is VALID [2022-04-15 12:21:07,306 INFO L290 TraceCheckUtils]: 55: Hoare triple {78680#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78673#(< main_~i~0 998)} is VALID [2022-04-15 12:21:07,307 INFO L290 TraceCheckUtils]: 54: Hoare triple {78680#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78680#(< main_~i~0 997)} is VALID [2022-04-15 12:21:07,307 INFO L290 TraceCheckUtils]: 53: Hoare triple {78687#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78680#(< main_~i~0 997)} is VALID [2022-04-15 12:21:07,307 INFO L290 TraceCheckUtils]: 52: Hoare triple {78687#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78687#(< main_~i~0 996)} is VALID [2022-04-15 12:21:07,307 INFO L290 TraceCheckUtils]: 51: Hoare triple {78694#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78687#(< main_~i~0 996)} is VALID [2022-04-15 12:21:07,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {78694#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78694#(< main_~i~0 995)} is VALID [2022-04-15 12:21:07,308 INFO L290 TraceCheckUtils]: 49: Hoare triple {78701#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78694#(< main_~i~0 995)} is VALID [2022-04-15 12:21:07,308 INFO L290 TraceCheckUtils]: 48: Hoare triple {78701#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78701#(< main_~i~0 994)} is VALID [2022-04-15 12:21:07,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {78708#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78701#(< main_~i~0 994)} is VALID [2022-04-15 12:21:07,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {78708#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78708#(< main_~i~0 993)} is VALID [2022-04-15 12:21:07,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {78715#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78708#(< main_~i~0 993)} is VALID [2022-04-15 12:21:07,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {78715#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78715#(< main_~i~0 992)} is VALID [2022-04-15 12:21:07,310 INFO L290 TraceCheckUtils]: 43: Hoare triple {78722#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78715#(< main_~i~0 992)} is VALID [2022-04-15 12:21:07,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {78722#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78722#(< main_~i~0 991)} is VALID [2022-04-15 12:21:07,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {78729#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78722#(< main_~i~0 991)} is VALID [2022-04-15 12:21:07,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {78729#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78729#(< main_~i~0 990)} is VALID [2022-04-15 12:21:07,311 INFO L290 TraceCheckUtils]: 39: Hoare triple {78736#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78729#(< main_~i~0 990)} is VALID [2022-04-15 12:21:07,311 INFO L290 TraceCheckUtils]: 38: Hoare triple {78736#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78736#(< main_~i~0 989)} is VALID [2022-04-15 12:21:07,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {78743#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78736#(< main_~i~0 989)} is VALID [2022-04-15 12:21:07,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {78743#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78743#(< main_~i~0 988)} is VALID [2022-04-15 12:21:07,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {78750#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78743#(< main_~i~0 988)} is VALID [2022-04-15 12:21:07,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {78750#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78750#(< main_~i~0 987)} is VALID [2022-04-15 12:21:07,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {78757#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78750#(< main_~i~0 987)} is VALID [2022-04-15 12:21:07,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {78757#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78757#(< main_~i~0 986)} is VALID [2022-04-15 12:21:07,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {78764#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78757#(< main_~i~0 986)} is VALID [2022-04-15 12:21:07,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {78764#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78764#(< main_~i~0 985)} is VALID [2022-04-15 12:21:07,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {78771#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78764#(< main_~i~0 985)} is VALID [2022-04-15 12:21:07,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {78771#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78771#(< main_~i~0 984)} is VALID [2022-04-15 12:21:07,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {78778#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78771#(< main_~i~0 984)} is VALID [2022-04-15 12:21:07,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {78778#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78778#(< main_~i~0 983)} is VALID [2022-04-15 12:21:07,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {78785#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78778#(< main_~i~0 983)} is VALID [2022-04-15 12:21:07,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {78785#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78785#(< main_~i~0 982)} is VALID [2022-04-15 12:21:07,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {78792#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78785#(< main_~i~0 982)} is VALID [2022-04-15 12:21:07,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {78792#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78792#(< main_~i~0 981)} is VALID [2022-04-15 12:21:07,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {78799#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78792#(< main_~i~0 981)} is VALID [2022-04-15 12:21:07,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {78799#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78799#(< main_~i~0 980)} is VALID [2022-04-15 12:21:07,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {78806#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78799#(< main_~i~0 980)} is VALID [2022-04-15 12:21:07,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {78806#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78806#(< main_~i~0 979)} is VALID [2022-04-15 12:21:07,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {78813#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78806#(< main_~i~0 979)} is VALID [2022-04-15 12:21:07,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {78813#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78813#(< main_~i~0 978)} is VALID [2022-04-15 12:21:07,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {78820#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78813#(< main_~i~0 978)} is VALID [2022-04-15 12:21:07,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {78820#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78820#(< main_~i~0 977)} is VALID [2022-04-15 12:21:07,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {78827#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78820#(< main_~i~0 977)} is VALID [2022-04-15 12:21:07,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {78827#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78827#(< main_~i~0 976)} is VALID [2022-04-15 12:21:07,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {78834#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78827#(< main_~i~0 976)} is VALID [2022-04-15 12:21:07,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {78834#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78834#(< main_~i~0 975)} is VALID [2022-04-15 12:21:07,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {78841#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78834#(< main_~i~0 975)} is VALID [2022-04-15 12:21:07,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {78841#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78841#(< main_~i~0 974)} is VALID [2022-04-15 12:21:07,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {78848#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78841#(< main_~i~0 974)} is VALID [2022-04-15 12:21:07,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {78848#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78848#(< main_~i~0 973)} is VALID [2022-04-15 12:21:07,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {78012#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {78848#(< main_~i~0 973)} is VALID [2022-04-15 12:21:07,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {78012#true} call #t~ret6 := main(); {78012#true} is VALID [2022-04-15 12:21:07,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78012#true} {78012#true} #64#return; {78012#true} is VALID [2022-04-15 12:21:07,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {78012#true} assume true; {78012#true} is VALID [2022-04-15 12:21:07,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {78012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {78012#true} is VALID [2022-04-15 12:21:07,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {78012#true} call ULTIMATE.init(); {78012#true} is VALID [2022-04-15 12:21:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2611 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:21:07,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491615447] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:21:07,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:21:07,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 108 [2022-04-15 12:21:07,321 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:07,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1472449237] [2022-04-15 12:21:07,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1472449237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:07,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:07,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 12:21:07,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220688521] [2022-04-15 12:21:07,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:07,322 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-15 12:21:07,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:07,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:07,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:07,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 12:21:07,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:07,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 12:21:07,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5673, Invalid=5883, Unknown=0, NotChecked=0, Total=11556 [2022-04-15 12:21:07,392 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:17,514 INFO L93 Difference]: Finished difference Result 397 states and 505 transitions. [2022-04-15 12:21:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 12:21:17,515 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-15 12:21:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 496 transitions. [2022-04-15 12:21:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 496 transitions. [2022-04-15 12:21:17,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 496 transitions. [2022-04-15 12:21:17,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 496 edges. 496 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:17,834 INFO L225 Difference]: With dead ends: 397 [2022-04-15 12:21:17,834 INFO L226 Difference]: Without dead ends: 380 [2022-04-15 12:21:17,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=11238, Invalid=14202, Unknown=0, NotChecked=0, Total=25440 [2022-04-15 12:21:17,835 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1243 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:17,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1243 Valid, 52 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:21:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-04-15 12:21:18,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 128. [2022-04-15 12:21:18,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:18,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 380 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:18,506 INFO L74 IsIncluded]: Start isIncluded. First operand 380 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:18,506 INFO L87 Difference]: Start difference. First operand 380 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:18,510 INFO L93 Difference]: Finished difference Result 380 states and 484 transitions. [2022-04-15 12:21:18,510 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 484 transitions. [2022-04-15 12:21:18,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:18,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:18,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 380 states. [2022-04-15 12:21:18,511 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 380 states. [2022-04-15 12:21:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:18,516 INFO L93 Difference]: Finished difference Result 380 states and 484 transitions. [2022-04-15 12:21:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 484 transitions. [2022-04-15 12:21:18,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:18,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:18,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:18,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2022-04-15 12:21:18,517 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 125 [2022-04-15 12:21:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:18,517 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2022-04-15 12:21:18,518 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:18,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 132 transitions. [2022-04-15 12:21:18,805 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:21:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2022-04-15 12:21:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-15 12:21:18,805 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:18,806 INFO L499 BasicCegarLoop]: trace histogram [52, 52, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:18,823 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:21:19,006 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:21:19,006 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:19,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:19,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1201552299, now seen corresponding path program 105 times [2022-04-15 12:21:19,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:19,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [252476663] [2022-04-15 12:21:19,011 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:21:19,011 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:21:19,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1201552299, now seen corresponding path program 106 times [2022-04-15 12:21:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:19,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938897865] [2022-04-15 12:21:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:19,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:19,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {80844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {80786#true} is VALID [2022-04-15 12:21:19,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {80786#true} assume true; {80786#true} is VALID [2022-04-15 12:21:19,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80786#true} {80786#true} #64#return; {80786#true} is VALID [2022-04-15 12:21:19,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {80786#true} call ULTIMATE.init(); {80844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:19,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {80844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {80786#true} is VALID [2022-04-15 12:21:19,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {80786#true} assume true; {80786#true} is VALID [2022-04-15 12:21:19,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80786#true} {80786#true} #64#return; {80786#true} is VALID [2022-04-15 12:21:19,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {80786#true} call #t~ret6 := main(); {80786#true} is VALID [2022-04-15 12:21:19,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {80786#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {80791#(= main_~i~0 0)} is VALID [2022-04-15 12:21:19,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {80791#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80791#(= main_~i~0 0)} is VALID [2022-04-15 12:21:19,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {80791#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80792#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:19,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {80792#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80792#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:19,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {80792#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80793#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:19,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {80793#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80793#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:19,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {80793#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80794#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:19,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {80794#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80794#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:19,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {80794#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80795#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:19,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {80795#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80795#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:19,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {80795#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80796#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:19,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {80796#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80796#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:19,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {80796#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80797#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:19,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {80797#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80797#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:19,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {80797#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80798#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:19,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {80798#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80798#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:19,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {80798#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80799#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:19,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {80799#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80799#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:19,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {80799#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80800#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:19,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {80800#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80800#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:19,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {80800#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80801#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:19,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {80801#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80801#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:19,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {80801#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80802#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:19,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {80802#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80802#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:19,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {80802#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80803#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:19,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {80803#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80803#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:19,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {80803#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80804#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:19,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {80804#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80804#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:19,989 INFO L290 TraceCheckUtils]: 33: Hoare triple {80804#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80805#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:19,989 INFO L290 TraceCheckUtils]: 34: Hoare triple {80805#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80805#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:19,989 INFO L290 TraceCheckUtils]: 35: Hoare triple {80805#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80806#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:19,989 INFO L290 TraceCheckUtils]: 36: Hoare triple {80806#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80806#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:19,990 INFO L290 TraceCheckUtils]: 37: Hoare triple {80806#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80807#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:19,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {80807#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80807#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:19,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {80807#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80808#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:19,991 INFO L290 TraceCheckUtils]: 40: Hoare triple {80808#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80808#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:19,991 INFO L290 TraceCheckUtils]: 41: Hoare triple {80808#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80809#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:19,991 INFO L290 TraceCheckUtils]: 42: Hoare triple {80809#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80809#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:19,991 INFO L290 TraceCheckUtils]: 43: Hoare triple {80809#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80810#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:19,992 INFO L290 TraceCheckUtils]: 44: Hoare triple {80810#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80810#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:19,992 INFO L290 TraceCheckUtils]: 45: Hoare triple {80810#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80811#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:19,992 INFO L290 TraceCheckUtils]: 46: Hoare triple {80811#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80811#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:19,992 INFO L290 TraceCheckUtils]: 47: Hoare triple {80811#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80812#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:19,993 INFO L290 TraceCheckUtils]: 48: Hoare triple {80812#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80812#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:19,993 INFO L290 TraceCheckUtils]: 49: Hoare triple {80812#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80813#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:19,993 INFO L290 TraceCheckUtils]: 50: Hoare triple {80813#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80813#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:19,994 INFO L290 TraceCheckUtils]: 51: Hoare triple {80813#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80814#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:19,994 INFO L290 TraceCheckUtils]: 52: Hoare triple {80814#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80814#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:19,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {80814#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80815#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:19,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {80815#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80815#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:19,995 INFO L290 TraceCheckUtils]: 55: Hoare triple {80815#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80816#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:19,995 INFO L290 TraceCheckUtils]: 56: Hoare triple {80816#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80816#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:19,995 INFO L290 TraceCheckUtils]: 57: Hoare triple {80816#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80817#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:19,995 INFO L290 TraceCheckUtils]: 58: Hoare triple {80817#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80817#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:19,996 INFO L290 TraceCheckUtils]: 59: Hoare triple {80817#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80818#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:19,996 INFO L290 TraceCheckUtils]: 60: Hoare triple {80818#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80818#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:19,996 INFO L290 TraceCheckUtils]: 61: Hoare triple {80818#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80819#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:19,997 INFO L290 TraceCheckUtils]: 62: Hoare triple {80819#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80819#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:19,997 INFO L290 TraceCheckUtils]: 63: Hoare triple {80819#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80820#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:19,997 INFO L290 TraceCheckUtils]: 64: Hoare triple {80820#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80820#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:19,997 INFO L290 TraceCheckUtils]: 65: Hoare triple {80820#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80821#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:19,998 INFO L290 TraceCheckUtils]: 66: Hoare triple {80821#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80821#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:19,998 INFO L290 TraceCheckUtils]: 67: Hoare triple {80821#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80822#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:19,998 INFO L290 TraceCheckUtils]: 68: Hoare triple {80822#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80822#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:19,998 INFO L290 TraceCheckUtils]: 69: Hoare triple {80822#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80823#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:19,999 INFO L290 TraceCheckUtils]: 70: Hoare triple {80823#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80823#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:19,999 INFO L290 TraceCheckUtils]: 71: Hoare triple {80823#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80824#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:19,999 INFO L290 TraceCheckUtils]: 72: Hoare triple {80824#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80824#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:20,000 INFO L290 TraceCheckUtils]: 73: Hoare triple {80824#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80825#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:20,000 INFO L290 TraceCheckUtils]: 74: Hoare triple {80825#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80825#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:20,000 INFO L290 TraceCheckUtils]: 75: Hoare triple {80825#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80826#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:20,000 INFO L290 TraceCheckUtils]: 76: Hoare triple {80826#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80826#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:20,001 INFO L290 TraceCheckUtils]: 77: Hoare triple {80826#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80827#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:20,001 INFO L290 TraceCheckUtils]: 78: Hoare triple {80827#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80827#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:20,001 INFO L290 TraceCheckUtils]: 79: Hoare triple {80827#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80828#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:20,001 INFO L290 TraceCheckUtils]: 80: Hoare triple {80828#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80828#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:20,002 INFO L290 TraceCheckUtils]: 81: Hoare triple {80828#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80829#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:20,002 INFO L290 TraceCheckUtils]: 82: Hoare triple {80829#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80829#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:20,002 INFO L290 TraceCheckUtils]: 83: Hoare triple {80829#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80830#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:20,002 INFO L290 TraceCheckUtils]: 84: Hoare triple {80830#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80830#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:20,003 INFO L290 TraceCheckUtils]: 85: Hoare triple {80830#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80831#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:20,003 INFO L290 TraceCheckUtils]: 86: Hoare triple {80831#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80831#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:20,003 INFO L290 TraceCheckUtils]: 87: Hoare triple {80831#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80832#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:20,004 INFO L290 TraceCheckUtils]: 88: Hoare triple {80832#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80832#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:20,004 INFO L290 TraceCheckUtils]: 89: Hoare triple {80832#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80833#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:20,004 INFO L290 TraceCheckUtils]: 90: Hoare triple {80833#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80833#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:20,004 INFO L290 TraceCheckUtils]: 91: Hoare triple {80833#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80834#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:20,005 INFO L290 TraceCheckUtils]: 92: Hoare triple {80834#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80834#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:20,005 INFO L290 TraceCheckUtils]: 93: Hoare triple {80834#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80835#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:20,005 INFO L290 TraceCheckUtils]: 94: Hoare triple {80835#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80835#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:20,006 INFO L290 TraceCheckUtils]: 95: Hoare triple {80835#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80836#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:20,006 INFO L290 TraceCheckUtils]: 96: Hoare triple {80836#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80836#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:20,006 INFO L290 TraceCheckUtils]: 97: Hoare triple {80836#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80837#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:20,006 INFO L290 TraceCheckUtils]: 98: Hoare triple {80837#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80837#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:20,007 INFO L290 TraceCheckUtils]: 99: Hoare triple {80837#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80838#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:20,007 INFO L290 TraceCheckUtils]: 100: Hoare triple {80838#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80838#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:20,007 INFO L290 TraceCheckUtils]: 101: Hoare triple {80838#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80839#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:20,007 INFO L290 TraceCheckUtils]: 102: Hoare triple {80839#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80839#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:20,008 INFO L290 TraceCheckUtils]: 103: Hoare triple {80839#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80840#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:20,008 INFO L290 TraceCheckUtils]: 104: Hoare triple {80840#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80840#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:20,008 INFO L290 TraceCheckUtils]: 105: Hoare triple {80840#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80841#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:20,008 INFO L290 TraceCheckUtils]: 106: Hoare triple {80841#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80841#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:20,009 INFO L290 TraceCheckUtils]: 107: Hoare triple {80841#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80842#(<= main_~i~0 51)} is VALID [2022-04-15 12:21:20,009 INFO L290 TraceCheckUtils]: 108: Hoare triple {80842#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80842#(<= main_~i~0 51)} is VALID [2022-04-15 12:21:20,009 INFO L290 TraceCheckUtils]: 109: Hoare triple {80842#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80843#(<= main_~i~0 52)} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 110: Hoare triple {80843#(<= main_~i~0 52)} assume !(~i~0 < 1024); {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 111: Hoare triple {80787#false} ~i~0 := 0; {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 112: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 113: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 114: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 115: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 116: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 117: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 118: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 119: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 120: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 121: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 122: Hoare triple {80787#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L272 TraceCheckUtils]: 123: Hoare triple {80787#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 124: Hoare triple {80787#false} ~cond := #in~cond; {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 125: Hoare triple {80787#false} assume 0 == ~cond; {80787#false} is VALID [2022-04-15 12:21:20,010 INFO L290 TraceCheckUtils]: 126: Hoare triple {80787#false} assume !false; {80787#false} is VALID [2022-04-15 12:21:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2714 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:21:20,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:20,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938897865] [2022-04-15 12:21:20,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938897865] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:20,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093995878] [2022-04-15 12:21:20,011 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:21:20,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:20,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:20,012 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:21:20,013 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:21:20,312 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:21:20,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:20,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-15 12:21:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:20,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:20,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {80786#true} call ULTIMATE.init(); {80786#true} is VALID [2022-04-15 12:21:20,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {80786#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {80786#true} is VALID [2022-04-15 12:21:20,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {80786#true} assume true; {80786#true} is VALID [2022-04-15 12:21:20,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80786#true} {80786#true} #64#return; {80786#true} is VALID [2022-04-15 12:21:20,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {80786#true} call #t~ret6 := main(); {80786#true} is VALID [2022-04-15 12:21:20,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {80786#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {80863#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:20,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {80863#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80863#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:20,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {80863#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80792#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:20,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {80792#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80792#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:20,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {80792#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80793#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:20,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {80793#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80793#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:20,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {80793#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80794#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:20,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {80794#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80794#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:20,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {80794#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80795#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:20,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {80795#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80795#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:20,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {80795#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80796#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:20,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {80796#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80796#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:20,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {80796#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80797#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:20,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {80797#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80797#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:20,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {80797#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80798#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:20,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {80798#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80798#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:20,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {80798#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80799#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:20,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {80799#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80799#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:20,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {80799#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80800#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:20,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {80800#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80800#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:20,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {80800#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80801#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:20,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {80801#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80801#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:20,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {80801#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80802#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:20,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {80802#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80802#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:20,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {80802#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80803#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:20,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {80803#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80803#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:20,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {80803#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80804#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:20,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {80804#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80804#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:20,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {80804#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80805#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:20,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {80805#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80805#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:20,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {80805#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80806#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:20,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {80806#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80806#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:20,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {80806#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80807#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:20,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {80807#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80807#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:20,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {80807#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80808#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:20,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {80808#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80808#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:20,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {80808#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80809#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:20,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {80809#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80809#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:20,921 INFO L290 TraceCheckUtils]: 43: Hoare triple {80809#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80810#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:20,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {80810#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80810#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:20,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {80810#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80811#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:20,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {80811#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80811#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:20,923 INFO L290 TraceCheckUtils]: 47: Hoare triple {80811#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80812#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:20,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {80812#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80812#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:20,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {80812#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80813#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:20,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {80813#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80813#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:20,924 INFO L290 TraceCheckUtils]: 51: Hoare triple {80813#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80814#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:20,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {80814#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80814#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:20,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {80814#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80815#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:20,925 INFO L290 TraceCheckUtils]: 54: Hoare triple {80815#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80815#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:20,925 INFO L290 TraceCheckUtils]: 55: Hoare triple {80815#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80816#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:20,925 INFO L290 TraceCheckUtils]: 56: Hoare triple {80816#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80816#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:20,925 INFO L290 TraceCheckUtils]: 57: Hoare triple {80816#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80817#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:20,926 INFO L290 TraceCheckUtils]: 58: Hoare triple {80817#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80817#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:20,926 INFO L290 TraceCheckUtils]: 59: Hoare triple {80817#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80818#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:20,926 INFO L290 TraceCheckUtils]: 60: Hoare triple {80818#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80818#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:20,926 INFO L290 TraceCheckUtils]: 61: Hoare triple {80818#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80819#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:20,927 INFO L290 TraceCheckUtils]: 62: Hoare triple {80819#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80819#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:20,927 INFO L290 TraceCheckUtils]: 63: Hoare triple {80819#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80820#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:20,927 INFO L290 TraceCheckUtils]: 64: Hoare triple {80820#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80820#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:20,928 INFO L290 TraceCheckUtils]: 65: Hoare triple {80820#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80821#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:20,928 INFO L290 TraceCheckUtils]: 66: Hoare triple {80821#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80821#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:20,928 INFO L290 TraceCheckUtils]: 67: Hoare triple {80821#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80822#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:20,928 INFO L290 TraceCheckUtils]: 68: Hoare triple {80822#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80822#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:20,929 INFO L290 TraceCheckUtils]: 69: Hoare triple {80822#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80823#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:20,929 INFO L290 TraceCheckUtils]: 70: Hoare triple {80823#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80823#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:20,929 INFO L290 TraceCheckUtils]: 71: Hoare triple {80823#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80824#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:20,929 INFO L290 TraceCheckUtils]: 72: Hoare triple {80824#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80824#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:20,930 INFO L290 TraceCheckUtils]: 73: Hoare triple {80824#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80825#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:20,930 INFO L290 TraceCheckUtils]: 74: Hoare triple {80825#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80825#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:20,930 INFO L290 TraceCheckUtils]: 75: Hoare triple {80825#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80826#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:20,931 INFO L290 TraceCheckUtils]: 76: Hoare triple {80826#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80826#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:20,931 INFO L290 TraceCheckUtils]: 77: Hoare triple {80826#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80827#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:20,931 INFO L290 TraceCheckUtils]: 78: Hoare triple {80827#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80827#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:20,931 INFO L290 TraceCheckUtils]: 79: Hoare triple {80827#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80828#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:20,932 INFO L290 TraceCheckUtils]: 80: Hoare triple {80828#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80828#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:20,932 INFO L290 TraceCheckUtils]: 81: Hoare triple {80828#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80829#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:20,932 INFO L290 TraceCheckUtils]: 82: Hoare triple {80829#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80829#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:20,932 INFO L290 TraceCheckUtils]: 83: Hoare triple {80829#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80830#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:20,933 INFO L290 TraceCheckUtils]: 84: Hoare triple {80830#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80830#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:20,933 INFO L290 TraceCheckUtils]: 85: Hoare triple {80830#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80831#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:20,933 INFO L290 TraceCheckUtils]: 86: Hoare triple {80831#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80831#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:20,934 INFO L290 TraceCheckUtils]: 87: Hoare triple {80831#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80832#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:20,934 INFO L290 TraceCheckUtils]: 88: Hoare triple {80832#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80832#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:20,934 INFO L290 TraceCheckUtils]: 89: Hoare triple {80832#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80833#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:20,934 INFO L290 TraceCheckUtils]: 90: Hoare triple {80833#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80833#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:20,935 INFO L290 TraceCheckUtils]: 91: Hoare triple {80833#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80834#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:20,935 INFO L290 TraceCheckUtils]: 92: Hoare triple {80834#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80834#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:20,935 INFO L290 TraceCheckUtils]: 93: Hoare triple {80834#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80835#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:20,935 INFO L290 TraceCheckUtils]: 94: Hoare triple {80835#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80835#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:20,936 INFO L290 TraceCheckUtils]: 95: Hoare triple {80835#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80836#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:20,936 INFO L290 TraceCheckUtils]: 96: Hoare triple {80836#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80836#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:20,936 INFO L290 TraceCheckUtils]: 97: Hoare triple {80836#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80837#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:20,937 INFO L290 TraceCheckUtils]: 98: Hoare triple {80837#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80837#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:20,937 INFO L290 TraceCheckUtils]: 99: Hoare triple {80837#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80838#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:20,937 INFO L290 TraceCheckUtils]: 100: Hoare triple {80838#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80838#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:20,937 INFO L290 TraceCheckUtils]: 101: Hoare triple {80838#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80839#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:20,938 INFO L290 TraceCheckUtils]: 102: Hoare triple {80839#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80839#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:20,938 INFO L290 TraceCheckUtils]: 103: Hoare triple {80839#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80840#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:20,938 INFO L290 TraceCheckUtils]: 104: Hoare triple {80840#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80840#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:20,939 INFO L290 TraceCheckUtils]: 105: Hoare triple {80840#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80841#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:20,939 INFO L290 TraceCheckUtils]: 106: Hoare triple {80841#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80841#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:20,939 INFO L290 TraceCheckUtils]: 107: Hoare triple {80841#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80842#(<= main_~i~0 51)} is VALID [2022-04-15 12:21:20,939 INFO L290 TraceCheckUtils]: 108: Hoare triple {80842#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80842#(<= main_~i~0 51)} is VALID [2022-04-15 12:21:20,940 INFO L290 TraceCheckUtils]: 109: Hoare triple {80842#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80843#(<= main_~i~0 52)} is VALID [2022-04-15 12:21:20,940 INFO L290 TraceCheckUtils]: 110: Hoare triple {80843#(<= main_~i~0 52)} assume !(~i~0 < 1024); {80787#false} is VALID [2022-04-15 12:21:20,940 INFO L290 TraceCheckUtils]: 111: Hoare triple {80787#false} ~i~0 := 0; {80787#false} is VALID [2022-04-15 12:21:20,940 INFO L290 TraceCheckUtils]: 112: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 12:21:20,940 INFO L290 TraceCheckUtils]: 113: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 12:21:20,940 INFO L290 TraceCheckUtils]: 114: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 12:21:20,940 INFO L290 TraceCheckUtils]: 115: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-15 12:21:20,940 INFO L290 TraceCheckUtils]: 116: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 12:21:20,940 INFO L290 TraceCheckUtils]: 117: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 12:21:20,940 INFO L290 TraceCheckUtils]: 118: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 12:21:20,940 INFO L290 TraceCheckUtils]: 119: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-15 12:21:20,940 INFO L290 TraceCheckUtils]: 120: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 12:21:20,940 INFO L290 TraceCheckUtils]: 121: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 12:21:20,941 INFO L290 TraceCheckUtils]: 122: Hoare triple {80787#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 12:21:20,941 INFO L272 TraceCheckUtils]: 123: Hoare triple {80787#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {80787#false} is VALID [2022-04-15 12:21:20,941 INFO L290 TraceCheckUtils]: 124: Hoare triple {80787#false} ~cond := #in~cond; {80787#false} is VALID [2022-04-15 12:21:20,941 INFO L290 TraceCheckUtils]: 125: Hoare triple {80787#false} assume 0 == ~cond; {80787#false} is VALID [2022-04-15 12:21:20,941 INFO L290 TraceCheckUtils]: 126: Hoare triple {80787#false} assume !false; {80787#false} is VALID [2022-04-15 12:21:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2714 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:21:20,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:21:23,804 INFO L290 TraceCheckUtils]: 126: Hoare triple {80787#false} assume !false; {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L290 TraceCheckUtils]: 125: Hoare triple {80787#false} assume 0 == ~cond; {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L290 TraceCheckUtils]: 124: Hoare triple {80787#false} ~cond := #in~cond; {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L272 TraceCheckUtils]: 123: Hoare triple {80787#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L290 TraceCheckUtils]: 122: Hoare triple {80787#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L290 TraceCheckUtils]: 121: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L290 TraceCheckUtils]: 120: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L290 TraceCheckUtils]: 119: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L290 TraceCheckUtils]: 118: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L290 TraceCheckUtils]: 117: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L290 TraceCheckUtils]: 116: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L290 TraceCheckUtils]: 115: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L290 TraceCheckUtils]: 114: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L290 TraceCheckUtils]: 113: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L290 TraceCheckUtils]: 112: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 12:21:23,805 INFO L290 TraceCheckUtils]: 111: Hoare triple {80787#false} ~i~0 := 0; {80787#false} is VALID [2022-04-15 12:21:23,806 INFO L290 TraceCheckUtils]: 110: Hoare triple {81275#(< main_~i~0 1024)} assume !(~i~0 < 1024); {80787#false} is VALID [2022-04-15 12:21:23,806 INFO L290 TraceCheckUtils]: 109: Hoare triple {81279#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81275#(< main_~i~0 1024)} is VALID [2022-04-15 12:21:23,806 INFO L290 TraceCheckUtils]: 108: Hoare triple {81279#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81279#(< main_~i~0 1023)} is VALID [2022-04-15 12:21:23,807 INFO L290 TraceCheckUtils]: 107: Hoare triple {81286#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81279#(< main_~i~0 1023)} is VALID [2022-04-15 12:21:23,807 INFO L290 TraceCheckUtils]: 106: Hoare triple {81286#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81286#(< main_~i~0 1022)} is VALID [2022-04-15 12:21:23,807 INFO L290 TraceCheckUtils]: 105: Hoare triple {81293#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81286#(< main_~i~0 1022)} is VALID [2022-04-15 12:21:23,807 INFO L290 TraceCheckUtils]: 104: Hoare triple {81293#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81293#(< main_~i~0 1021)} is VALID [2022-04-15 12:21:23,808 INFO L290 TraceCheckUtils]: 103: Hoare triple {81300#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81293#(< main_~i~0 1021)} is VALID [2022-04-15 12:21:23,808 INFO L290 TraceCheckUtils]: 102: Hoare triple {81300#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81300#(< main_~i~0 1020)} is VALID [2022-04-15 12:21:23,808 INFO L290 TraceCheckUtils]: 101: Hoare triple {81307#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81300#(< main_~i~0 1020)} is VALID [2022-04-15 12:21:23,809 INFO L290 TraceCheckUtils]: 100: Hoare triple {81307#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81307#(< main_~i~0 1019)} is VALID [2022-04-15 12:21:23,809 INFO L290 TraceCheckUtils]: 99: Hoare triple {81314#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81307#(< main_~i~0 1019)} is VALID [2022-04-15 12:21:23,809 INFO L290 TraceCheckUtils]: 98: Hoare triple {81314#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81314#(< main_~i~0 1018)} is VALID [2022-04-15 12:21:23,809 INFO L290 TraceCheckUtils]: 97: Hoare triple {81321#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81314#(< main_~i~0 1018)} is VALID [2022-04-15 12:21:23,810 INFO L290 TraceCheckUtils]: 96: Hoare triple {81321#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81321#(< main_~i~0 1017)} is VALID [2022-04-15 12:21:23,810 INFO L290 TraceCheckUtils]: 95: Hoare triple {81328#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81321#(< main_~i~0 1017)} is VALID [2022-04-15 12:21:23,810 INFO L290 TraceCheckUtils]: 94: Hoare triple {81328#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81328#(< main_~i~0 1016)} is VALID [2022-04-15 12:21:23,811 INFO L290 TraceCheckUtils]: 93: Hoare triple {81335#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81328#(< main_~i~0 1016)} is VALID [2022-04-15 12:21:23,811 INFO L290 TraceCheckUtils]: 92: Hoare triple {81335#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81335#(< main_~i~0 1015)} is VALID [2022-04-15 12:21:23,811 INFO L290 TraceCheckUtils]: 91: Hoare triple {81342#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81335#(< main_~i~0 1015)} is VALID [2022-04-15 12:21:23,811 INFO L290 TraceCheckUtils]: 90: Hoare triple {81342#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81342#(< main_~i~0 1014)} is VALID [2022-04-15 12:21:23,812 INFO L290 TraceCheckUtils]: 89: Hoare triple {81349#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81342#(< main_~i~0 1014)} is VALID [2022-04-15 12:21:23,812 INFO L290 TraceCheckUtils]: 88: Hoare triple {81349#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81349#(< main_~i~0 1013)} is VALID [2022-04-15 12:21:23,812 INFO L290 TraceCheckUtils]: 87: Hoare triple {81356#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81349#(< main_~i~0 1013)} is VALID [2022-04-15 12:21:23,812 INFO L290 TraceCheckUtils]: 86: Hoare triple {81356#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81356#(< main_~i~0 1012)} is VALID [2022-04-15 12:21:23,813 INFO L290 TraceCheckUtils]: 85: Hoare triple {81363#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81356#(< main_~i~0 1012)} is VALID [2022-04-15 12:21:23,813 INFO L290 TraceCheckUtils]: 84: Hoare triple {81363#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81363#(< main_~i~0 1011)} is VALID [2022-04-15 12:21:23,813 INFO L290 TraceCheckUtils]: 83: Hoare triple {81370#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81363#(< main_~i~0 1011)} is VALID [2022-04-15 12:21:23,814 INFO L290 TraceCheckUtils]: 82: Hoare triple {81370#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81370#(< main_~i~0 1010)} is VALID [2022-04-15 12:21:23,814 INFO L290 TraceCheckUtils]: 81: Hoare triple {81377#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81370#(< main_~i~0 1010)} is VALID [2022-04-15 12:21:23,814 INFO L290 TraceCheckUtils]: 80: Hoare triple {81377#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81377#(< main_~i~0 1009)} is VALID [2022-04-15 12:21:23,814 INFO L290 TraceCheckUtils]: 79: Hoare triple {81384#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81377#(< main_~i~0 1009)} is VALID [2022-04-15 12:21:23,815 INFO L290 TraceCheckUtils]: 78: Hoare triple {81384#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81384#(< main_~i~0 1008)} is VALID [2022-04-15 12:21:23,815 INFO L290 TraceCheckUtils]: 77: Hoare triple {81391#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81384#(< main_~i~0 1008)} is VALID [2022-04-15 12:21:23,815 INFO L290 TraceCheckUtils]: 76: Hoare triple {81391#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81391#(< main_~i~0 1007)} is VALID [2022-04-15 12:21:23,816 INFO L290 TraceCheckUtils]: 75: Hoare triple {81398#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81391#(< main_~i~0 1007)} is VALID [2022-04-15 12:21:23,816 INFO L290 TraceCheckUtils]: 74: Hoare triple {81398#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81398#(< main_~i~0 1006)} is VALID [2022-04-15 12:21:23,816 INFO L290 TraceCheckUtils]: 73: Hoare triple {81405#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81398#(< main_~i~0 1006)} is VALID [2022-04-15 12:21:23,816 INFO L290 TraceCheckUtils]: 72: Hoare triple {81405#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81405#(< main_~i~0 1005)} is VALID [2022-04-15 12:21:23,817 INFO L290 TraceCheckUtils]: 71: Hoare triple {81412#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81405#(< main_~i~0 1005)} is VALID [2022-04-15 12:21:23,817 INFO L290 TraceCheckUtils]: 70: Hoare triple {81412#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81412#(< main_~i~0 1004)} is VALID [2022-04-15 12:21:23,817 INFO L290 TraceCheckUtils]: 69: Hoare triple {81419#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81412#(< main_~i~0 1004)} is VALID [2022-04-15 12:21:23,818 INFO L290 TraceCheckUtils]: 68: Hoare triple {81419#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81419#(< main_~i~0 1003)} is VALID [2022-04-15 12:21:23,818 INFO L290 TraceCheckUtils]: 67: Hoare triple {81426#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81419#(< main_~i~0 1003)} is VALID [2022-04-15 12:21:23,818 INFO L290 TraceCheckUtils]: 66: Hoare triple {81426#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81426#(< main_~i~0 1002)} is VALID [2022-04-15 12:21:23,818 INFO L290 TraceCheckUtils]: 65: Hoare triple {81433#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81426#(< main_~i~0 1002)} is VALID [2022-04-15 12:21:23,819 INFO L290 TraceCheckUtils]: 64: Hoare triple {81433#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81433#(< main_~i~0 1001)} is VALID [2022-04-15 12:21:23,819 INFO L290 TraceCheckUtils]: 63: Hoare triple {81440#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81433#(< main_~i~0 1001)} is VALID [2022-04-15 12:21:23,819 INFO L290 TraceCheckUtils]: 62: Hoare triple {81440#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81440#(< main_~i~0 1000)} is VALID [2022-04-15 12:21:23,820 INFO L290 TraceCheckUtils]: 61: Hoare triple {81447#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81440#(< main_~i~0 1000)} is VALID [2022-04-15 12:21:23,820 INFO L290 TraceCheckUtils]: 60: Hoare triple {81447#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81447#(< main_~i~0 999)} is VALID [2022-04-15 12:21:23,820 INFO L290 TraceCheckUtils]: 59: Hoare triple {81454#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81447#(< main_~i~0 999)} is VALID [2022-04-15 12:21:23,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {81454#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81454#(< main_~i~0 998)} is VALID [2022-04-15 12:21:23,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {81461#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81454#(< main_~i~0 998)} is VALID [2022-04-15 12:21:23,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {81461#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81461#(< main_~i~0 997)} is VALID [2022-04-15 12:21:23,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {81468#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81461#(< main_~i~0 997)} is VALID [2022-04-15 12:21:23,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {81468#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81468#(< main_~i~0 996)} is VALID [2022-04-15 12:21:23,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {81475#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81468#(< main_~i~0 996)} is VALID [2022-04-15 12:21:23,822 INFO L290 TraceCheckUtils]: 52: Hoare triple {81475#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81475#(< main_~i~0 995)} is VALID [2022-04-15 12:21:23,822 INFO L290 TraceCheckUtils]: 51: Hoare triple {81482#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81475#(< main_~i~0 995)} is VALID [2022-04-15 12:21:23,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {81482#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81482#(< main_~i~0 994)} is VALID [2022-04-15 12:21:23,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {81489#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81482#(< main_~i~0 994)} is VALID [2022-04-15 12:21:23,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {81489#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81489#(< main_~i~0 993)} is VALID [2022-04-15 12:21:23,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {81496#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81489#(< main_~i~0 993)} is VALID [2022-04-15 12:21:23,824 INFO L290 TraceCheckUtils]: 46: Hoare triple {81496#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81496#(< main_~i~0 992)} is VALID [2022-04-15 12:21:23,824 INFO L290 TraceCheckUtils]: 45: Hoare triple {81503#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81496#(< main_~i~0 992)} is VALID [2022-04-15 12:21:23,824 INFO L290 TraceCheckUtils]: 44: Hoare triple {81503#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81503#(< main_~i~0 991)} is VALID [2022-04-15 12:21:23,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {81510#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81503#(< main_~i~0 991)} is VALID [2022-04-15 12:21:23,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {81510#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81510#(< main_~i~0 990)} is VALID [2022-04-15 12:21:23,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {81517#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81510#(< main_~i~0 990)} is VALID [2022-04-15 12:21:23,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {81517#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81517#(< main_~i~0 989)} is VALID [2022-04-15 12:21:23,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {81524#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81517#(< main_~i~0 989)} is VALID [2022-04-15 12:21:23,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {81524#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81524#(< main_~i~0 988)} is VALID [2022-04-15 12:21:23,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {81531#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81524#(< main_~i~0 988)} is VALID [2022-04-15 12:21:23,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {81531#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81531#(< main_~i~0 987)} is VALID [2022-04-15 12:21:23,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {81538#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81531#(< main_~i~0 987)} is VALID [2022-04-15 12:21:23,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {81538#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81538#(< main_~i~0 986)} is VALID [2022-04-15 12:21:23,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {81545#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81538#(< main_~i~0 986)} is VALID [2022-04-15 12:21:23,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {81545#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81545#(< main_~i~0 985)} is VALID [2022-04-15 12:21:23,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {81552#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81545#(< main_~i~0 985)} is VALID [2022-04-15 12:21:23,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {81552#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81552#(< main_~i~0 984)} is VALID [2022-04-15 12:21:23,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {81559#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81552#(< main_~i~0 984)} is VALID [2022-04-15 12:21:23,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {81559#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81559#(< main_~i~0 983)} is VALID [2022-04-15 12:21:23,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {81566#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81559#(< main_~i~0 983)} is VALID [2022-04-15 12:21:23,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {81566#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81566#(< main_~i~0 982)} is VALID [2022-04-15 12:21:23,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {81573#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81566#(< main_~i~0 982)} is VALID [2022-04-15 12:21:23,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {81573#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81573#(< main_~i~0 981)} is VALID [2022-04-15 12:21:23,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {81580#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81573#(< main_~i~0 981)} is VALID [2022-04-15 12:21:23,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {81580#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81580#(< main_~i~0 980)} is VALID [2022-04-15 12:21:23,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {81587#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81580#(< main_~i~0 980)} is VALID [2022-04-15 12:21:23,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {81587#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81587#(< main_~i~0 979)} is VALID [2022-04-15 12:21:23,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {81594#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81587#(< main_~i~0 979)} is VALID [2022-04-15 12:21:23,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {81594#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81594#(< main_~i~0 978)} is VALID [2022-04-15 12:21:23,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {81601#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81594#(< main_~i~0 978)} is VALID [2022-04-15 12:21:23,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {81601#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81601#(< main_~i~0 977)} is VALID [2022-04-15 12:21:23,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {81608#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81601#(< main_~i~0 977)} is VALID [2022-04-15 12:21:23,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {81608#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81608#(< main_~i~0 976)} is VALID [2022-04-15 12:21:23,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {81615#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81608#(< main_~i~0 976)} is VALID [2022-04-15 12:21:23,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {81615#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81615#(< main_~i~0 975)} is VALID [2022-04-15 12:21:23,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {81622#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81615#(< main_~i~0 975)} is VALID [2022-04-15 12:21:23,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {81622#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81622#(< main_~i~0 974)} is VALID [2022-04-15 12:21:23,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {81629#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81622#(< main_~i~0 974)} is VALID [2022-04-15 12:21:23,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {81629#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81629#(< main_~i~0 973)} is VALID [2022-04-15 12:21:23,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {81636#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81629#(< main_~i~0 973)} is VALID [2022-04-15 12:21:23,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {81636#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81636#(< main_~i~0 972)} is VALID [2022-04-15 12:21:23,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {80786#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {81636#(< main_~i~0 972)} is VALID [2022-04-15 12:21:23,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {80786#true} call #t~ret6 := main(); {80786#true} is VALID [2022-04-15 12:21:23,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80786#true} {80786#true} #64#return; {80786#true} is VALID [2022-04-15 12:21:23,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {80786#true} assume true; {80786#true} is VALID [2022-04-15 12:21:23,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {80786#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {80786#true} is VALID [2022-04-15 12:21:23,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {80786#true} call ULTIMATE.init(); {80786#true} is VALID [2022-04-15 12:21:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2714 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:21:23,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093995878] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:21:23,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:21:23,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 110 [2022-04-15 12:21:23,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:23,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [252476663] [2022-04-15 12:21:23,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [252476663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:23,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:23,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 12:21:23,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27992036] [2022-04-15 12:21:23,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:23,837 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-15 12:21:23,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:23,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:23,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:23,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 12:21:23,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:23,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 12:21:23,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5888, Invalid=6102, Unknown=0, NotChecked=0, Total=11990 [2022-04-15 12:21:23,907 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:34,695 INFO L93 Difference]: Finished difference Result 404 states and 514 transitions. [2022-04-15 12:21:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 12:21:34,695 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-15 12:21:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 505 transitions. [2022-04-15 12:21:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 505 transitions. [2022-04-15 12:21:34,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 505 transitions. [2022-04-15 12:21:35,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 505 edges. 505 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:35,026 INFO L225 Difference]: With dead ends: 404 [2022-04-15 12:21:35,026 INFO L226 Difference]: Without dead ends: 387 [2022-04-15 12:21:35,027 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=11666, Invalid=14740, Unknown=0, NotChecked=0, Total=26406 [2022-04-15 12:21:35,027 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1267 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:35,028 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1267 Valid, 47 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:21:35,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-04-15 12:21:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 130. [2022-04-15 12:21:35,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:35,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 387 states. Second operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:35,736 INFO L74 IsIncluded]: Start isIncluded. First operand 387 states. Second operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:35,736 INFO L87 Difference]: Start difference. First operand 387 states. Second operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:35,742 INFO L93 Difference]: Finished difference Result 387 states and 493 transitions. [2022-04-15 12:21:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 493 transitions. [2022-04-15 12:21:35,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:35,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:35,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 387 states. [2022-04-15 12:21:35,742 INFO L87 Difference]: Start difference. First operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 387 states. [2022-04-15 12:21:35,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:35,748 INFO L93 Difference]: Finished difference Result 387 states and 493 transitions. [2022-04-15 12:21:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 493 transitions. [2022-04-15 12:21:35,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:35,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:35,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:35,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2022-04-15 12:21:35,750 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 127 [2022-04-15 12:21:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:35,750 INFO L478 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2022-04-15 12:21:35,750 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:35,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 134 transitions. [2022-04-15 12:21:36,062 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:21:36,062 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2022-04-15 12:21:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-15 12:21:36,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:36,063 INFO L499 BasicCegarLoop]: trace histogram [53, 53, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:36,081 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:21:36,263 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:21:36,263 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:36,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:36,264 INFO L85 PathProgramCache]: Analyzing trace with hash 39492211, now seen corresponding path program 107 times [2022-04-15 12:21:36,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:36,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1354781787] [2022-04-15 12:21:36,268 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:21:36,268 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:21:36,268 INFO L85 PathProgramCache]: Analyzing trace with hash 39492211, now seen corresponding path program 108 times [2022-04-15 12:21:36,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:36,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129797167] [2022-04-15 12:21:36,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:36,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:37,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:37,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {83667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {83608#true} is VALID [2022-04-15 12:21:37,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {83608#true} assume true; {83608#true} is VALID [2022-04-15 12:21:37,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83608#true} {83608#true} #64#return; {83608#true} is VALID [2022-04-15 12:21:37,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {83608#true} call ULTIMATE.init(); {83667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:37,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {83667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {83608#true} is VALID [2022-04-15 12:21:37,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {83608#true} assume true; {83608#true} is VALID [2022-04-15 12:21:37,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83608#true} {83608#true} #64#return; {83608#true} is VALID [2022-04-15 12:21:37,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {83608#true} call #t~ret6 := main(); {83608#true} is VALID [2022-04-15 12:21:37,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {83608#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {83613#(= main_~i~0 0)} is VALID [2022-04-15 12:21:37,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {83613#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83613#(= main_~i~0 0)} is VALID [2022-04-15 12:21:37,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {83613#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83614#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:37,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {83614#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83614#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:37,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {83614#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83615#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:37,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {83615#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83615#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:37,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {83615#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83616#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:37,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {83616#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83616#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:37,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {83616#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83617#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:37,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {83617#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83617#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:37,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {83617#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83618#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:37,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {83618#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83618#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:37,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {83618#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83619#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:37,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {83619#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83619#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:37,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {83619#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83620#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:37,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {83620#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83620#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:37,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {83620#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83621#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:37,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {83621#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83621#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:37,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {83621#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83622#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:37,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {83622#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83622#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:37,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {83622#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83623#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:37,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {83623#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83623#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:37,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {83623#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83624#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:37,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {83624#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83624#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:37,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {83624#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83625#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:37,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {83625#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83625#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:37,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {83625#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83626#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:37,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {83626#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83626#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:37,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {83626#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83627#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:37,280 INFO L290 TraceCheckUtils]: 34: Hoare triple {83627#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83627#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:37,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {83627#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83628#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:37,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {83628#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83628#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:37,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {83628#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83629#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:37,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {83629#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83629#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:37,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {83629#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83630#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:37,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {83630#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83630#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:37,282 INFO L290 TraceCheckUtils]: 41: Hoare triple {83630#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83631#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:37,282 INFO L290 TraceCheckUtils]: 42: Hoare triple {83631#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83631#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:37,283 INFO L290 TraceCheckUtils]: 43: Hoare triple {83631#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83632#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:37,283 INFO L290 TraceCheckUtils]: 44: Hoare triple {83632#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83632#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:37,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {83632#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83633#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:37,284 INFO L290 TraceCheckUtils]: 46: Hoare triple {83633#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83633#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:37,284 INFO L290 TraceCheckUtils]: 47: Hoare triple {83633#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83634#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:37,284 INFO L290 TraceCheckUtils]: 48: Hoare triple {83634#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83634#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:37,284 INFO L290 TraceCheckUtils]: 49: Hoare triple {83634#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83635#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:37,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {83635#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83635#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:37,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {83635#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83636#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:37,285 INFO L290 TraceCheckUtils]: 52: Hoare triple {83636#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83636#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:37,286 INFO L290 TraceCheckUtils]: 53: Hoare triple {83636#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83637#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:37,286 INFO L290 TraceCheckUtils]: 54: Hoare triple {83637#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83637#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:37,286 INFO L290 TraceCheckUtils]: 55: Hoare triple {83637#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83638#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:37,286 INFO L290 TraceCheckUtils]: 56: Hoare triple {83638#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83638#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:37,287 INFO L290 TraceCheckUtils]: 57: Hoare triple {83638#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83639#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:37,287 INFO L290 TraceCheckUtils]: 58: Hoare triple {83639#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83639#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:37,287 INFO L290 TraceCheckUtils]: 59: Hoare triple {83639#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83640#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:37,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {83640#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83640#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:37,288 INFO L290 TraceCheckUtils]: 61: Hoare triple {83640#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83641#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:37,288 INFO L290 TraceCheckUtils]: 62: Hoare triple {83641#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83641#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:37,288 INFO L290 TraceCheckUtils]: 63: Hoare triple {83641#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83642#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:37,288 INFO L290 TraceCheckUtils]: 64: Hoare triple {83642#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83642#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:37,289 INFO L290 TraceCheckUtils]: 65: Hoare triple {83642#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83643#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:37,289 INFO L290 TraceCheckUtils]: 66: Hoare triple {83643#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83643#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:37,289 INFO L290 TraceCheckUtils]: 67: Hoare triple {83643#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83644#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:37,290 INFO L290 TraceCheckUtils]: 68: Hoare triple {83644#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83644#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:37,290 INFO L290 TraceCheckUtils]: 69: Hoare triple {83644#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83645#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:37,290 INFO L290 TraceCheckUtils]: 70: Hoare triple {83645#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83645#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:37,290 INFO L290 TraceCheckUtils]: 71: Hoare triple {83645#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83646#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:37,291 INFO L290 TraceCheckUtils]: 72: Hoare triple {83646#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83646#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:37,291 INFO L290 TraceCheckUtils]: 73: Hoare triple {83646#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83647#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:37,291 INFO L290 TraceCheckUtils]: 74: Hoare triple {83647#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83647#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:37,292 INFO L290 TraceCheckUtils]: 75: Hoare triple {83647#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83648#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:37,292 INFO L290 TraceCheckUtils]: 76: Hoare triple {83648#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83648#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:37,292 INFO L290 TraceCheckUtils]: 77: Hoare triple {83648#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83649#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:37,292 INFO L290 TraceCheckUtils]: 78: Hoare triple {83649#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83649#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:37,293 INFO L290 TraceCheckUtils]: 79: Hoare triple {83649#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83650#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:37,293 INFO L290 TraceCheckUtils]: 80: Hoare triple {83650#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83650#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:37,293 INFO L290 TraceCheckUtils]: 81: Hoare triple {83650#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83651#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:37,293 INFO L290 TraceCheckUtils]: 82: Hoare triple {83651#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83651#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:37,294 INFO L290 TraceCheckUtils]: 83: Hoare triple {83651#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83652#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:37,294 INFO L290 TraceCheckUtils]: 84: Hoare triple {83652#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83652#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:37,294 INFO L290 TraceCheckUtils]: 85: Hoare triple {83652#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83653#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:37,295 INFO L290 TraceCheckUtils]: 86: Hoare triple {83653#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83653#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:37,295 INFO L290 TraceCheckUtils]: 87: Hoare triple {83653#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83654#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:37,295 INFO L290 TraceCheckUtils]: 88: Hoare triple {83654#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83654#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:37,295 INFO L290 TraceCheckUtils]: 89: Hoare triple {83654#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83655#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:37,296 INFO L290 TraceCheckUtils]: 90: Hoare triple {83655#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83655#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:37,296 INFO L290 TraceCheckUtils]: 91: Hoare triple {83655#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83656#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:37,296 INFO L290 TraceCheckUtils]: 92: Hoare triple {83656#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83656#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:37,297 INFO L290 TraceCheckUtils]: 93: Hoare triple {83656#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83657#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:37,297 INFO L290 TraceCheckUtils]: 94: Hoare triple {83657#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83657#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:37,297 INFO L290 TraceCheckUtils]: 95: Hoare triple {83657#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83658#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:37,297 INFO L290 TraceCheckUtils]: 96: Hoare triple {83658#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83658#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:37,298 INFO L290 TraceCheckUtils]: 97: Hoare triple {83658#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83659#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:37,298 INFO L290 TraceCheckUtils]: 98: Hoare triple {83659#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83659#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:37,298 INFO L290 TraceCheckUtils]: 99: Hoare triple {83659#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83660#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:37,298 INFO L290 TraceCheckUtils]: 100: Hoare triple {83660#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83660#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:37,299 INFO L290 TraceCheckUtils]: 101: Hoare triple {83660#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83661#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:37,299 INFO L290 TraceCheckUtils]: 102: Hoare triple {83661#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83661#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:37,299 INFO L290 TraceCheckUtils]: 103: Hoare triple {83661#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83662#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:37,300 INFO L290 TraceCheckUtils]: 104: Hoare triple {83662#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83662#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:37,300 INFO L290 TraceCheckUtils]: 105: Hoare triple {83662#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83663#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:37,300 INFO L290 TraceCheckUtils]: 106: Hoare triple {83663#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83663#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:37,300 INFO L290 TraceCheckUtils]: 107: Hoare triple {83663#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83664#(<= main_~i~0 51)} is VALID [2022-04-15 12:21:37,301 INFO L290 TraceCheckUtils]: 108: Hoare triple {83664#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83664#(<= main_~i~0 51)} is VALID [2022-04-15 12:21:37,301 INFO L290 TraceCheckUtils]: 109: Hoare triple {83664#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83665#(<= main_~i~0 52)} is VALID [2022-04-15 12:21:37,301 INFO L290 TraceCheckUtils]: 110: Hoare triple {83665#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83665#(<= main_~i~0 52)} is VALID [2022-04-15 12:21:37,302 INFO L290 TraceCheckUtils]: 111: Hoare triple {83665#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83666#(<= main_~i~0 53)} is VALID [2022-04-15 12:21:37,302 INFO L290 TraceCheckUtils]: 112: Hoare triple {83666#(<= main_~i~0 53)} assume !(~i~0 < 1024); {83609#false} is VALID [2022-04-15 12:21:37,302 INFO L290 TraceCheckUtils]: 113: Hoare triple {83609#false} ~i~0 := 0; {83609#false} is VALID [2022-04-15 12:21:37,302 INFO L290 TraceCheckUtils]: 114: Hoare triple {83609#false} #t~short5 := ~i~0 < 1024; {83609#false} is VALID [2022-04-15 12:21:37,302 INFO L290 TraceCheckUtils]: 115: Hoare triple {83609#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83609#false} is VALID [2022-04-15 12:21:37,302 INFO L290 TraceCheckUtils]: 116: Hoare triple {83609#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {83609#false} is VALID [2022-04-15 12:21:37,302 INFO L290 TraceCheckUtils]: 117: Hoare triple {83609#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {83609#false} is VALID [2022-04-15 12:21:37,302 INFO L290 TraceCheckUtils]: 118: Hoare triple {83609#false} #t~short5 := ~i~0 < 1024; {83609#false} is VALID [2022-04-15 12:21:37,302 INFO L290 TraceCheckUtils]: 119: Hoare triple {83609#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83609#false} is VALID [2022-04-15 12:21:37,302 INFO L290 TraceCheckUtils]: 120: Hoare triple {83609#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {83609#false} is VALID [2022-04-15 12:21:37,302 INFO L290 TraceCheckUtils]: 121: Hoare triple {83609#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {83609#false} is VALID [2022-04-15 12:21:37,302 INFO L290 TraceCheckUtils]: 122: Hoare triple {83609#false} #t~short5 := ~i~0 < 1024; {83609#false} is VALID [2022-04-15 12:21:37,302 INFO L290 TraceCheckUtils]: 123: Hoare triple {83609#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83609#false} is VALID [2022-04-15 12:21:37,302 INFO L290 TraceCheckUtils]: 124: Hoare triple {83609#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {83609#false} is VALID [2022-04-15 12:21:37,302 INFO L272 TraceCheckUtils]: 125: Hoare triple {83609#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {83609#false} is VALID [2022-04-15 12:21:37,303 INFO L290 TraceCheckUtils]: 126: Hoare triple {83609#false} ~cond := #in~cond; {83609#false} is VALID [2022-04-15 12:21:37,303 INFO L290 TraceCheckUtils]: 127: Hoare triple {83609#false} assume 0 == ~cond; {83609#false} is VALID [2022-04-15 12:21:37,303 INFO L290 TraceCheckUtils]: 128: Hoare triple {83609#false} assume !false; {83609#false} is VALID [2022-04-15 12:21:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2819 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:21:37,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:37,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129797167] [2022-04-15 12:21:37,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129797167] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:37,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234769691] [2022-04-15 12:21:37,303 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:21:37,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:37,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:37,304 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:21:37,305 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:21:37,584 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:21:37,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:37,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:21:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:37,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:37,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {83608#true} call ULTIMATE.init(); {83608#true} is VALID [2022-04-15 12:21:37,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {83608#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {83608#true} is VALID [2022-04-15 12:21:37,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {83608#true} assume true; {83608#true} is VALID [2022-04-15 12:21:37,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83608#true} {83608#true} #64#return; {83608#true} is VALID [2022-04-15 12:21:37,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {83608#true} call #t~ret6 := main(); {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {83608#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 38: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,886 INFO L290 TraceCheckUtils]: 45: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 49: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 50: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 51: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 52: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 53: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 54: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 55: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 56: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 57: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 58: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 59: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 60: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 61: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 62: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 63: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 64: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,887 INFO L290 TraceCheckUtils]: 65: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 66: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 67: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 68: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 69: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 70: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 71: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 72: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 73: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 74: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 75: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 76: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 77: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 78: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 79: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 80: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 81: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 82: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 83: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 84: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,888 INFO L290 TraceCheckUtils]: 85: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 86: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 87: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 88: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 89: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 90: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 91: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 92: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 93: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 94: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 95: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 96: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 97: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 98: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 99: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 100: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 101: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 102: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 103: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 104: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,889 INFO L290 TraceCheckUtils]: 105: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,890 INFO L290 TraceCheckUtils]: 106: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,890 INFO L290 TraceCheckUtils]: 107: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,890 INFO L290 TraceCheckUtils]: 108: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,890 INFO L290 TraceCheckUtils]: 109: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,890 INFO L290 TraceCheckUtils]: 110: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:37,890 INFO L290 TraceCheckUtils]: 111: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:37,890 INFO L290 TraceCheckUtils]: 112: Hoare triple {83608#true} assume !(~i~0 < 1024); {83608#true} is VALID [2022-04-15 12:21:37,890 INFO L290 TraceCheckUtils]: 113: Hoare triple {83608#true} ~i~0 := 0; {84010#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:37,890 INFO L290 TraceCheckUtils]: 114: Hoare triple {84010#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {84010#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:37,891 INFO L290 TraceCheckUtils]: 115: Hoare triple {84010#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {84010#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:37,891 INFO L290 TraceCheckUtils]: 116: Hoare triple {84010#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {84010#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:37,891 INFO L290 TraceCheckUtils]: 117: Hoare triple {84010#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {83614#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:37,891 INFO L290 TraceCheckUtils]: 118: Hoare triple {83614#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {83614#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:37,892 INFO L290 TraceCheckUtils]: 119: Hoare triple {83614#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83614#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:37,892 INFO L290 TraceCheckUtils]: 120: Hoare triple {83614#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {83614#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:37,892 INFO L290 TraceCheckUtils]: 121: Hoare triple {83614#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {83615#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:37,892 INFO L290 TraceCheckUtils]: 122: Hoare triple {83615#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {83615#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:37,893 INFO L290 TraceCheckUtils]: 123: Hoare triple {83615#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83615#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:37,893 INFO L290 TraceCheckUtils]: 124: Hoare triple {83615#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {83615#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:37,893 INFO L272 TraceCheckUtils]: 125: Hoare triple {83615#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {84047#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:21:37,894 INFO L290 TraceCheckUtils]: 126: Hoare triple {84047#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {84051#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:21:37,894 INFO L290 TraceCheckUtils]: 127: Hoare triple {84051#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {83609#false} is VALID [2022-04-15 12:21:37,894 INFO L290 TraceCheckUtils]: 128: Hoare triple {83609#false} assume !false; {83609#false} is VALID [2022-04-15 12:21:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2819 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2022-04-15 12:21:37,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:21:38,191 INFO L290 TraceCheckUtils]: 128: Hoare triple {83609#false} assume !false; {83609#false} is VALID [2022-04-15 12:21:38,192 INFO L290 TraceCheckUtils]: 127: Hoare triple {84051#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {83609#false} is VALID [2022-04-15 12:21:38,192 INFO L290 TraceCheckUtils]: 126: Hoare triple {84047#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {84051#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:21:38,192 INFO L272 TraceCheckUtils]: 125: Hoare triple {84067#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {84047#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:21:38,192 INFO L290 TraceCheckUtils]: 124: Hoare triple {84067#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {84067#(<= main_~i~0 512)} is VALID [2022-04-15 12:21:38,193 INFO L290 TraceCheckUtils]: 123: Hoare triple {84067#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {84067#(<= main_~i~0 512)} is VALID [2022-04-15 12:21:38,193 INFO L290 TraceCheckUtils]: 122: Hoare triple {84067#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {84067#(<= main_~i~0 512)} is VALID [2022-04-15 12:21:38,193 INFO L290 TraceCheckUtils]: 121: Hoare triple {84080#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84067#(<= main_~i~0 512)} is VALID [2022-04-15 12:21:38,194 INFO L290 TraceCheckUtils]: 120: Hoare triple {84080#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {84080#(<= main_~i~0 511)} is VALID [2022-04-15 12:21:38,194 INFO L290 TraceCheckUtils]: 119: Hoare triple {84080#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {84080#(<= main_~i~0 511)} is VALID [2022-04-15 12:21:38,194 INFO L290 TraceCheckUtils]: 118: Hoare triple {84080#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {84080#(<= main_~i~0 511)} is VALID [2022-04-15 12:21:38,194 INFO L290 TraceCheckUtils]: 117: Hoare triple {84093#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84080#(<= main_~i~0 511)} is VALID [2022-04-15 12:21:38,195 INFO L290 TraceCheckUtils]: 116: Hoare triple {84093#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {84093#(<= main_~i~0 510)} is VALID [2022-04-15 12:21:38,195 INFO L290 TraceCheckUtils]: 115: Hoare triple {84093#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {84093#(<= main_~i~0 510)} is VALID [2022-04-15 12:21:38,195 INFO L290 TraceCheckUtils]: 114: Hoare triple {84093#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {84093#(<= main_~i~0 510)} is VALID [2022-04-15 12:21:38,195 INFO L290 TraceCheckUtils]: 113: Hoare triple {83608#true} ~i~0 := 0; {84093#(<= main_~i~0 510)} is VALID [2022-04-15 12:21:38,195 INFO L290 TraceCheckUtils]: 112: Hoare triple {83608#true} assume !(~i~0 < 1024); {83608#true} is VALID [2022-04-15 12:21:38,195 INFO L290 TraceCheckUtils]: 111: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,195 INFO L290 TraceCheckUtils]: 110: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 109: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 108: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 107: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 106: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 105: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 104: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 103: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 102: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 101: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 100: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 99: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 98: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 97: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 96: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 95: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 94: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 93: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 92: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,196 INFO L290 TraceCheckUtils]: 91: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 90: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 89: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 88: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 87: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 86: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 85: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 84: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 83: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 82: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 81: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 80: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 79: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 78: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 77: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 76: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 75: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 74: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 73: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 72: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,197 INFO L290 TraceCheckUtils]: 71: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 70: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 69: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 68: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 67: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 66: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 65: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 64: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 63: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 62: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 61: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 60: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 59: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 58: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 57: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 55: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 54: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 53: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 52: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,198 INFO L290 TraceCheckUtils]: 51: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 50: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 49: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 48: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 47: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 46: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 40: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 39: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {83608#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {83608#true} is VALID [2022-04-15 12:21:38,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {83608#true} call #t~ret6 := main(); {83608#true} is VALID [2022-04-15 12:21:38,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83608#true} {83608#true} #64#return; {83608#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {83608#true} assume true; {83608#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {83608#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {83608#true} is VALID [2022-04-15 12:21:38,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {83608#true} call ULTIMATE.init(); {83608#true} is VALID [2022-04-15 12:21:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2819 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2022-04-15 12:21:38,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234769691] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:21:38,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:21:38,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 7, 7] total 63 [2022-04-15 12:21:38,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:38,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1354781787] [2022-04-15 12:21:38,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1354781787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:38,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:38,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-15 12:21:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681364441] [2022-04-15 12:21:38,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:38,202 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2022-04-15 12:21:38,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:38,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:38,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:38,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-15 12:21:38,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:38,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-15 12:21:38,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1776, Invalid=2130, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 12:21:38,279 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:49,392 INFO L93 Difference]: Finished difference Result 411 states and 523 transitions. [2022-04-15 12:21:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 12:21:49,392 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2022-04-15 12:21:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 514 transitions. [2022-04-15 12:21:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 514 transitions. [2022-04-15 12:21:49,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 514 transitions. [2022-04-15 12:21:49,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 514 edges. 514 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:49,726 INFO L225 Difference]: With dead ends: 411 [2022-04-15 12:21:49,726 INFO L226 Difference]: Without dead ends: 394 [2022-04-15 12:21:49,726 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5017, Invalid=8555, Unknown=0, NotChecked=0, Total=13572 [2022-04-15 12:21:49,727 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1315 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:49,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1315 Valid, 32 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:21:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-04-15 12:21:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 132. [2022-04-15 12:21:50,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:50,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:50,452 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:50,452 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:50,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:50,458 INFO L93 Difference]: Finished difference Result 394 states and 502 transitions. [2022-04-15 12:21:50,458 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 502 transitions. [2022-04-15 12:21:50,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:50,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:50,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 394 states. [2022-04-15 12:21:50,458 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 394 states. [2022-04-15 12:21:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:50,464 INFO L93 Difference]: Finished difference Result 394 states and 502 transitions. [2022-04-15 12:21:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 502 transitions. [2022-04-15 12:21:50,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:50,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:50,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:50,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2022-04-15 12:21:50,466 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 129 [2022-04-15 12:21:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:50,466 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2022-04-15 12:21:50,466 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:50,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 136 transitions. [2022-04-15 12:21:50,790 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:21:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2022-04-15 12:21:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 12:21:50,791 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:50,791 INFO L499 BasicCegarLoop]: trace histogram [54, 54, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:50,808 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:21:50,991 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:21:50,991 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:50,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1317641967, now seen corresponding path program 109 times [2022-04-15 12:21:50,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:50,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1168788593] [2022-04-15 12:21:50,996 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:21:50,996 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:21:50,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1317641967, now seen corresponding path program 110 times [2022-04-15 12:21:50,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:50,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97488592] [2022-04-15 12:21:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:50,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:52,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:52,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {86489#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {86429#true} is VALID [2022-04-15 12:21:52,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {86429#true} assume true; {86429#true} is VALID [2022-04-15 12:21:52,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86429#true} {86429#true} #64#return; {86429#true} is VALID [2022-04-15 12:21:52,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {86429#true} call ULTIMATE.init(); {86489#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:52,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {86489#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {86429#true} is VALID [2022-04-15 12:21:52,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {86429#true} assume true; {86429#true} is VALID [2022-04-15 12:21:52,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86429#true} {86429#true} #64#return; {86429#true} is VALID [2022-04-15 12:21:52,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {86429#true} call #t~ret6 := main(); {86429#true} is VALID [2022-04-15 12:21:52,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {86429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {86434#(= main_~i~0 0)} is VALID [2022-04-15 12:21:52,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {86434#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86434#(= main_~i~0 0)} is VALID [2022-04-15 12:21:52,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {86434#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86435#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:52,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {86435#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86435#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:52,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {86435#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86436#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:52,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {86436#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86436#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:52,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {86436#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86437#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:52,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {86437#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86437#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:52,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {86437#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86438#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:52,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {86438#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86438#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:52,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {86438#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86439#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:52,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {86439#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86439#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:52,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {86439#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86440#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:52,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {86440#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86440#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:52,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {86440#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86441#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:52,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {86441#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86441#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:52,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {86441#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86442#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:52,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {86442#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86442#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:52,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {86442#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86443#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:52,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {86443#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86443#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:52,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {86443#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86444#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:52,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {86444#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86444#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:52,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {86444#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86445#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:52,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {86445#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86445#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:52,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {86445#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86446#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:52,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {86446#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86446#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:52,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {86446#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86447#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:52,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {86447#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86447#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:52,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {86447#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86448#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:52,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {86448#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86448#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:52,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {86448#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86449#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:52,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {86449#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86449#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:52,030 INFO L290 TraceCheckUtils]: 37: Hoare triple {86449#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86450#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:52,030 INFO L290 TraceCheckUtils]: 38: Hoare triple {86450#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86450#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:52,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {86450#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86451#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:52,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {86451#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86451#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:52,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {86451#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86452#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:52,031 INFO L290 TraceCheckUtils]: 42: Hoare triple {86452#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86452#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:52,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {86452#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86453#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:52,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {86453#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86453#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:52,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {86453#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86454#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:52,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {86454#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86454#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:52,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {86454#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86455#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:52,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {86455#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86455#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:52,033 INFO L290 TraceCheckUtils]: 49: Hoare triple {86455#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86456#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:52,033 INFO L290 TraceCheckUtils]: 50: Hoare triple {86456#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86456#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:52,034 INFO L290 TraceCheckUtils]: 51: Hoare triple {86456#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86457#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:52,034 INFO L290 TraceCheckUtils]: 52: Hoare triple {86457#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86457#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:52,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {86457#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86458#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:52,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {86458#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86458#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:52,035 INFO L290 TraceCheckUtils]: 55: Hoare triple {86458#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86459#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:52,035 INFO L290 TraceCheckUtils]: 56: Hoare triple {86459#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86459#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:52,035 INFO L290 TraceCheckUtils]: 57: Hoare triple {86459#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86460#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:52,035 INFO L290 TraceCheckUtils]: 58: Hoare triple {86460#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86460#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:52,036 INFO L290 TraceCheckUtils]: 59: Hoare triple {86460#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86461#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:52,036 INFO L290 TraceCheckUtils]: 60: Hoare triple {86461#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86461#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:52,036 INFO L290 TraceCheckUtils]: 61: Hoare triple {86461#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86462#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:52,037 INFO L290 TraceCheckUtils]: 62: Hoare triple {86462#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86462#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:52,037 INFO L290 TraceCheckUtils]: 63: Hoare triple {86462#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86463#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:52,037 INFO L290 TraceCheckUtils]: 64: Hoare triple {86463#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86463#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:52,037 INFO L290 TraceCheckUtils]: 65: Hoare triple {86463#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86464#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:52,038 INFO L290 TraceCheckUtils]: 66: Hoare triple {86464#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86464#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:52,038 INFO L290 TraceCheckUtils]: 67: Hoare triple {86464#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86465#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:52,038 INFO L290 TraceCheckUtils]: 68: Hoare triple {86465#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86465#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:52,038 INFO L290 TraceCheckUtils]: 69: Hoare triple {86465#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86466#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:52,039 INFO L290 TraceCheckUtils]: 70: Hoare triple {86466#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86466#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:52,039 INFO L290 TraceCheckUtils]: 71: Hoare triple {86466#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86467#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:52,039 INFO L290 TraceCheckUtils]: 72: Hoare triple {86467#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86467#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:52,040 INFO L290 TraceCheckUtils]: 73: Hoare triple {86467#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86468#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:52,040 INFO L290 TraceCheckUtils]: 74: Hoare triple {86468#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86468#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:52,040 INFO L290 TraceCheckUtils]: 75: Hoare triple {86468#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86469#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:52,040 INFO L290 TraceCheckUtils]: 76: Hoare triple {86469#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86469#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:52,041 INFO L290 TraceCheckUtils]: 77: Hoare triple {86469#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86470#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:52,041 INFO L290 TraceCheckUtils]: 78: Hoare triple {86470#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86470#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:52,041 INFO L290 TraceCheckUtils]: 79: Hoare triple {86470#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86471#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:52,041 INFO L290 TraceCheckUtils]: 80: Hoare triple {86471#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86471#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:52,042 INFO L290 TraceCheckUtils]: 81: Hoare triple {86471#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86472#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:52,042 INFO L290 TraceCheckUtils]: 82: Hoare triple {86472#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86472#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:52,042 INFO L290 TraceCheckUtils]: 83: Hoare triple {86472#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86473#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:52,043 INFO L290 TraceCheckUtils]: 84: Hoare triple {86473#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86473#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:52,043 INFO L290 TraceCheckUtils]: 85: Hoare triple {86473#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86474#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:52,043 INFO L290 TraceCheckUtils]: 86: Hoare triple {86474#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86474#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:52,043 INFO L290 TraceCheckUtils]: 87: Hoare triple {86474#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86475#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:52,044 INFO L290 TraceCheckUtils]: 88: Hoare triple {86475#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86475#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:52,044 INFO L290 TraceCheckUtils]: 89: Hoare triple {86475#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86476#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:52,044 INFO L290 TraceCheckUtils]: 90: Hoare triple {86476#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86476#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:52,044 INFO L290 TraceCheckUtils]: 91: Hoare triple {86476#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86477#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:52,045 INFO L290 TraceCheckUtils]: 92: Hoare triple {86477#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86477#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:52,045 INFO L290 TraceCheckUtils]: 93: Hoare triple {86477#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86478#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:52,045 INFO L290 TraceCheckUtils]: 94: Hoare triple {86478#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86478#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:52,046 INFO L290 TraceCheckUtils]: 95: Hoare triple {86478#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86479#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:52,046 INFO L290 TraceCheckUtils]: 96: Hoare triple {86479#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86479#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:52,046 INFO L290 TraceCheckUtils]: 97: Hoare triple {86479#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86480#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:52,046 INFO L290 TraceCheckUtils]: 98: Hoare triple {86480#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86480#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:52,047 INFO L290 TraceCheckUtils]: 99: Hoare triple {86480#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86481#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:52,047 INFO L290 TraceCheckUtils]: 100: Hoare triple {86481#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86481#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:52,047 INFO L290 TraceCheckUtils]: 101: Hoare triple {86481#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86482#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:52,047 INFO L290 TraceCheckUtils]: 102: Hoare triple {86482#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86482#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:52,048 INFO L290 TraceCheckUtils]: 103: Hoare triple {86482#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86483#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:52,048 INFO L290 TraceCheckUtils]: 104: Hoare triple {86483#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86483#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:52,048 INFO L290 TraceCheckUtils]: 105: Hoare triple {86483#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86484#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:52,049 INFO L290 TraceCheckUtils]: 106: Hoare triple {86484#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86484#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:52,049 INFO L290 TraceCheckUtils]: 107: Hoare triple {86484#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86485#(<= main_~i~0 51)} is VALID [2022-04-15 12:21:52,049 INFO L290 TraceCheckUtils]: 108: Hoare triple {86485#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86485#(<= main_~i~0 51)} is VALID [2022-04-15 12:21:52,049 INFO L290 TraceCheckUtils]: 109: Hoare triple {86485#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86486#(<= main_~i~0 52)} is VALID [2022-04-15 12:21:52,050 INFO L290 TraceCheckUtils]: 110: Hoare triple {86486#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86486#(<= main_~i~0 52)} is VALID [2022-04-15 12:21:52,050 INFO L290 TraceCheckUtils]: 111: Hoare triple {86486#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86487#(<= main_~i~0 53)} is VALID [2022-04-15 12:21:52,050 INFO L290 TraceCheckUtils]: 112: Hoare triple {86487#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86487#(<= main_~i~0 53)} is VALID [2022-04-15 12:21:52,051 INFO L290 TraceCheckUtils]: 113: Hoare triple {86487#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86488#(<= main_~i~0 54)} is VALID [2022-04-15 12:21:52,051 INFO L290 TraceCheckUtils]: 114: Hoare triple {86488#(<= main_~i~0 54)} assume !(~i~0 < 1024); {86430#false} is VALID [2022-04-15 12:21:52,051 INFO L290 TraceCheckUtils]: 115: Hoare triple {86430#false} ~i~0 := 0; {86430#false} is VALID [2022-04-15 12:21:52,051 INFO L290 TraceCheckUtils]: 116: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 12:21:52,051 INFO L290 TraceCheckUtils]: 117: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 12:21:52,051 INFO L290 TraceCheckUtils]: 118: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 12:21:52,051 INFO L290 TraceCheckUtils]: 119: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-15 12:21:52,051 INFO L290 TraceCheckUtils]: 120: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 12:21:52,051 INFO L290 TraceCheckUtils]: 121: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 12:21:52,051 INFO L290 TraceCheckUtils]: 122: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 12:21:52,051 INFO L290 TraceCheckUtils]: 123: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-15 12:21:52,051 INFO L290 TraceCheckUtils]: 124: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 12:21:52,051 INFO L290 TraceCheckUtils]: 125: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 12:21:52,051 INFO L290 TraceCheckUtils]: 126: Hoare triple {86430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 12:21:52,052 INFO L272 TraceCheckUtils]: 127: Hoare triple {86430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {86430#false} is VALID [2022-04-15 12:21:52,052 INFO L290 TraceCheckUtils]: 128: Hoare triple {86430#false} ~cond := #in~cond; {86430#false} is VALID [2022-04-15 12:21:52,052 INFO L290 TraceCheckUtils]: 129: Hoare triple {86430#false} assume 0 == ~cond; {86430#false} is VALID [2022-04-15 12:21:52,052 INFO L290 TraceCheckUtils]: 130: Hoare triple {86430#false} assume !false; {86430#false} is VALID [2022-04-15 12:21:52,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:21:52,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:52,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97488592] [2022-04-15 12:21:52,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97488592] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:52,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055990242] [2022-04-15 12:21:52,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:21:52,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:52,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:52,054 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:21:52,055 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:21:52,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:21:52,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:52,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-15 12:21:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:52,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:53,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {86429#true} call ULTIMATE.init(); {86429#true} is VALID [2022-04-15 12:21:53,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {86429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {86429#true} is VALID [2022-04-15 12:21:53,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {86429#true} assume true; {86429#true} is VALID [2022-04-15 12:21:53,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86429#true} {86429#true} #64#return; {86429#true} is VALID [2022-04-15 12:21:53,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {86429#true} call #t~ret6 := main(); {86429#true} is VALID [2022-04-15 12:21:53,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {86429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {86508#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:53,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {86508#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86508#(<= main_~i~0 0)} is VALID [2022-04-15 12:21:53,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {86508#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86435#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:53,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {86435#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86435#(<= main_~i~0 1)} is VALID [2022-04-15 12:21:53,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {86435#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86436#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:53,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {86436#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86436#(<= main_~i~0 2)} is VALID [2022-04-15 12:21:53,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {86436#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86437#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:53,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {86437#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86437#(<= main_~i~0 3)} is VALID [2022-04-15 12:21:53,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {86437#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86438#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:53,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {86438#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86438#(<= main_~i~0 4)} is VALID [2022-04-15 12:21:53,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {86438#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86439#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:53,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {86439#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86439#(<= main_~i~0 5)} is VALID [2022-04-15 12:21:53,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {86439#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86440#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:53,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {86440#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86440#(<= main_~i~0 6)} is VALID [2022-04-15 12:21:53,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {86440#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86441#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:53,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {86441#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86441#(<= main_~i~0 7)} is VALID [2022-04-15 12:21:53,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {86441#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86442#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:53,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {86442#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86442#(<= main_~i~0 8)} is VALID [2022-04-15 12:21:53,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {86442#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86443#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:53,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {86443#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86443#(<= main_~i~0 9)} is VALID [2022-04-15 12:21:53,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {86443#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86444#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:53,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {86444#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86444#(<= main_~i~0 10)} is VALID [2022-04-15 12:21:53,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {86444#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86445#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:53,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {86445#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86445#(<= main_~i~0 11)} is VALID [2022-04-15 12:21:53,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {86445#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86446#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:53,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {86446#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86446#(<= main_~i~0 12)} is VALID [2022-04-15 12:21:53,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {86446#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86447#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:53,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {86447#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86447#(<= main_~i~0 13)} is VALID [2022-04-15 12:21:53,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {86447#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86448#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:53,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {86448#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86448#(<= main_~i~0 14)} is VALID [2022-04-15 12:21:53,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {86448#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86449#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:53,032 INFO L290 TraceCheckUtils]: 36: Hoare triple {86449#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86449#(<= main_~i~0 15)} is VALID [2022-04-15 12:21:53,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {86449#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86450#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:53,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {86450#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86450#(<= main_~i~0 16)} is VALID [2022-04-15 12:21:53,033 INFO L290 TraceCheckUtils]: 39: Hoare triple {86450#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86451#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:53,033 INFO L290 TraceCheckUtils]: 40: Hoare triple {86451#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86451#(<= main_~i~0 17)} is VALID [2022-04-15 12:21:53,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {86451#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86452#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:53,034 INFO L290 TraceCheckUtils]: 42: Hoare triple {86452#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86452#(<= main_~i~0 18)} is VALID [2022-04-15 12:21:53,034 INFO L290 TraceCheckUtils]: 43: Hoare triple {86452#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86453#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:53,034 INFO L290 TraceCheckUtils]: 44: Hoare triple {86453#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86453#(<= main_~i~0 19)} is VALID [2022-04-15 12:21:53,034 INFO L290 TraceCheckUtils]: 45: Hoare triple {86453#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86454#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:53,035 INFO L290 TraceCheckUtils]: 46: Hoare triple {86454#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86454#(<= main_~i~0 20)} is VALID [2022-04-15 12:21:53,035 INFO L290 TraceCheckUtils]: 47: Hoare triple {86454#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86455#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:53,035 INFO L290 TraceCheckUtils]: 48: Hoare triple {86455#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86455#(<= main_~i~0 21)} is VALID [2022-04-15 12:21:53,036 INFO L290 TraceCheckUtils]: 49: Hoare triple {86455#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86456#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:53,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {86456#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86456#(<= main_~i~0 22)} is VALID [2022-04-15 12:21:53,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {86456#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86457#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:53,036 INFO L290 TraceCheckUtils]: 52: Hoare triple {86457#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86457#(<= main_~i~0 23)} is VALID [2022-04-15 12:21:53,037 INFO L290 TraceCheckUtils]: 53: Hoare triple {86457#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86458#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:53,037 INFO L290 TraceCheckUtils]: 54: Hoare triple {86458#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86458#(<= main_~i~0 24)} is VALID [2022-04-15 12:21:53,037 INFO L290 TraceCheckUtils]: 55: Hoare triple {86458#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86459#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:53,037 INFO L290 TraceCheckUtils]: 56: Hoare triple {86459#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86459#(<= main_~i~0 25)} is VALID [2022-04-15 12:21:53,038 INFO L290 TraceCheckUtils]: 57: Hoare triple {86459#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86460#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:53,038 INFO L290 TraceCheckUtils]: 58: Hoare triple {86460#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86460#(<= main_~i~0 26)} is VALID [2022-04-15 12:21:53,038 INFO L290 TraceCheckUtils]: 59: Hoare triple {86460#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86461#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:53,039 INFO L290 TraceCheckUtils]: 60: Hoare triple {86461#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86461#(<= main_~i~0 27)} is VALID [2022-04-15 12:21:53,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {86461#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86462#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:53,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {86462#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86462#(<= main_~i~0 28)} is VALID [2022-04-15 12:21:53,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {86462#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86463#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:53,040 INFO L290 TraceCheckUtils]: 64: Hoare triple {86463#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86463#(<= main_~i~0 29)} is VALID [2022-04-15 12:21:53,040 INFO L290 TraceCheckUtils]: 65: Hoare triple {86463#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86464#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:53,040 INFO L290 TraceCheckUtils]: 66: Hoare triple {86464#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86464#(<= main_~i~0 30)} is VALID [2022-04-15 12:21:53,041 INFO L290 TraceCheckUtils]: 67: Hoare triple {86464#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86465#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:53,041 INFO L290 TraceCheckUtils]: 68: Hoare triple {86465#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86465#(<= main_~i~0 31)} is VALID [2022-04-15 12:21:53,041 INFO L290 TraceCheckUtils]: 69: Hoare triple {86465#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86466#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:53,041 INFO L290 TraceCheckUtils]: 70: Hoare triple {86466#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86466#(<= main_~i~0 32)} is VALID [2022-04-15 12:21:53,042 INFO L290 TraceCheckUtils]: 71: Hoare triple {86466#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86467#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:53,042 INFO L290 TraceCheckUtils]: 72: Hoare triple {86467#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86467#(<= main_~i~0 33)} is VALID [2022-04-15 12:21:53,042 INFO L290 TraceCheckUtils]: 73: Hoare triple {86467#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86468#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:53,042 INFO L290 TraceCheckUtils]: 74: Hoare triple {86468#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86468#(<= main_~i~0 34)} is VALID [2022-04-15 12:21:53,043 INFO L290 TraceCheckUtils]: 75: Hoare triple {86468#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86469#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:53,043 INFO L290 TraceCheckUtils]: 76: Hoare triple {86469#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86469#(<= main_~i~0 35)} is VALID [2022-04-15 12:21:53,043 INFO L290 TraceCheckUtils]: 77: Hoare triple {86469#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86470#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:53,044 INFO L290 TraceCheckUtils]: 78: Hoare triple {86470#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86470#(<= main_~i~0 36)} is VALID [2022-04-15 12:21:53,044 INFO L290 TraceCheckUtils]: 79: Hoare triple {86470#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86471#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:53,044 INFO L290 TraceCheckUtils]: 80: Hoare triple {86471#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86471#(<= main_~i~0 37)} is VALID [2022-04-15 12:21:53,044 INFO L290 TraceCheckUtils]: 81: Hoare triple {86471#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86472#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:53,045 INFO L290 TraceCheckUtils]: 82: Hoare triple {86472#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86472#(<= main_~i~0 38)} is VALID [2022-04-15 12:21:53,045 INFO L290 TraceCheckUtils]: 83: Hoare triple {86472#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86473#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:53,045 INFO L290 TraceCheckUtils]: 84: Hoare triple {86473#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86473#(<= main_~i~0 39)} is VALID [2022-04-15 12:21:53,045 INFO L290 TraceCheckUtils]: 85: Hoare triple {86473#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86474#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:53,046 INFO L290 TraceCheckUtils]: 86: Hoare triple {86474#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86474#(<= main_~i~0 40)} is VALID [2022-04-15 12:21:53,046 INFO L290 TraceCheckUtils]: 87: Hoare triple {86474#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86475#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:53,046 INFO L290 TraceCheckUtils]: 88: Hoare triple {86475#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86475#(<= main_~i~0 41)} is VALID [2022-04-15 12:21:53,047 INFO L290 TraceCheckUtils]: 89: Hoare triple {86475#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86476#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:53,047 INFO L290 TraceCheckUtils]: 90: Hoare triple {86476#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86476#(<= main_~i~0 42)} is VALID [2022-04-15 12:21:53,047 INFO L290 TraceCheckUtils]: 91: Hoare triple {86476#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86477#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:53,047 INFO L290 TraceCheckUtils]: 92: Hoare triple {86477#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86477#(<= main_~i~0 43)} is VALID [2022-04-15 12:21:53,048 INFO L290 TraceCheckUtils]: 93: Hoare triple {86477#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86478#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:53,048 INFO L290 TraceCheckUtils]: 94: Hoare triple {86478#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86478#(<= main_~i~0 44)} is VALID [2022-04-15 12:21:53,048 INFO L290 TraceCheckUtils]: 95: Hoare triple {86478#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86479#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:53,048 INFO L290 TraceCheckUtils]: 96: Hoare triple {86479#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86479#(<= main_~i~0 45)} is VALID [2022-04-15 12:21:53,049 INFO L290 TraceCheckUtils]: 97: Hoare triple {86479#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86480#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:53,049 INFO L290 TraceCheckUtils]: 98: Hoare triple {86480#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86480#(<= main_~i~0 46)} is VALID [2022-04-15 12:21:53,049 INFO L290 TraceCheckUtils]: 99: Hoare triple {86480#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86481#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:53,050 INFO L290 TraceCheckUtils]: 100: Hoare triple {86481#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86481#(<= main_~i~0 47)} is VALID [2022-04-15 12:21:53,050 INFO L290 TraceCheckUtils]: 101: Hoare triple {86481#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86482#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:53,050 INFO L290 TraceCheckUtils]: 102: Hoare triple {86482#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86482#(<= main_~i~0 48)} is VALID [2022-04-15 12:21:53,050 INFO L290 TraceCheckUtils]: 103: Hoare triple {86482#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86483#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:53,051 INFO L290 TraceCheckUtils]: 104: Hoare triple {86483#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86483#(<= main_~i~0 49)} is VALID [2022-04-15 12:21:53,051 INFO L290 TraceCheckUtils]: 105: Hoare triple {86483#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86484#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:53,051 INFO L290 TraceCheckUtils]: 106: Hoare triple {86484#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86484#(<= main_~i~0 50)} is VALID [2022-04-15 12:21:53,052 INFO L290 TraceCheckUtils]: 107: Hoare triple {86484#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86485#(<= main_~i~0 51)} is VALID [2022-04-15 12:21:53,052 INFO L290 TraceCheckUtils]: 108: Hoare triple {86485#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86485#(<= main_~i~0 51)} is VALID [2022-04-15 12:21:53,052 INFO L290 TraceCheckUtils]: 109: Hoare triple {86485#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86486#(<= main_~i~0 52)} is VALID [2022-04-15 12:21:53,052 INFO L290 TraceCheckUtils]: 110: Hoare triple {86486#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86486#(<= main_~i~0 52)} is VALID [2022-04-15 12:21:53,053 INFO L290 TraceCheckUtils]: 111: Hoare triple {86486#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86487#(<= main_~i~0 53)} is VALID [2022-04-15 12:21:53,053 INFO L290 TraceCheckUtils]: 112: Hoare triple {86487#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86487#(<= main_~i~0 53)} is VALID [2022-04-15 12:21:53,053 INFO L290 TraceCheckUtils]: 113: Hoare triple {86487#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86488#(<= main_~i~0 54)} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 114: Hoare triple {86488#(<= main_~i~0 54)} assume !(~i~0 < 1024); {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 115: Hoare triple {86430#false} ~i~0 := 0; {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 116: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 117: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 118: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 119: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 120: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 121: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 122: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 123: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 124: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 125: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 126: Hoare triple {86430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L272 TraceCheckUtils]: 127: Hoare triple {86430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 128: Hoare triple {86430#false} ~cond := #in~cond; {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 129: Hoare triple {86430#false} assume 0 == ~cond; {86430#false} is VALID [2022-04-15 12:21:53,054 INFO L290 TraceCheckUtils]: 130: Hoare triple {86430#false} assume !false; {86430#false} is VALID [2022-04-15 12:21:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:21:53,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:21:56,135 INFO L290 TraceCheckUtils]: 130: Hoare triple {86430#false} assume !false; {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L290 TraceCheckUtils]: 129: Hoare triple {86430#false} assume 0 == ~cond; {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L290 TraceCheckUtils]: 128: Hoare triple {86430#false} ~cond := #in~cond; {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L272 TraceCheckUtils]: 127: Hoare triple {86430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L290 TraceCheckUtils]: 126: Hoare triple {86430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L290 TraceCheckUtils]: 125: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L290 TraceCheckUtils]: 124: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L290 TraceCheckUtils]: 123: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L290 TraceCheckUtils]: 122: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L290 TraceCheckUtils]: 121: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L290 TraceCheckUtils]: 120: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L290 TraceCheckUtils]: 119: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L290 TraceCheckUtils]: 118: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L290 TraceCheckUtils]: 117: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L290 TraceCheckUtils]: 116: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 12:21:56,136 INFO L290 TraceCheckUtils]: 115: Hoare triple {86430#false} ~i~0 := 0; {86430#false} is VALID [2022-04-15 12:21:56,137 INFO L290 TraceCheckUtils]: 114: Hoare triple {86932#(< main_~i~0 1024)} assume !(~i~0 < 1024); {86430#false} is VALID [2022-04-15 12:21:56,137 INFO L290 TraceCheckUtils]: 113: Hoare triple {86936#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86932#(< main_~i~0 1024)} is VALID [2022-04-15 12:21:56,137 INFO L290 TraceCheckUtils]: 112: Hoare triple {86936#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86936#(< main_~i~0 1023)} is VALID [2022-04-15 12:21:56,138 INFO L290 TraceCheckUtils]: 111: Hoare triple {86943#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86936#(< main_~i~0 1023)} is VALID [2022-04-15 12:21:56,138 INFO L290 TraceCheckUtils]: 110: Hoare triple {86943#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86943#(< main_~i~0 1022)} is VALID [2022-04-15 12:21:56,138 INFO L290 TraceCheckUtils]: 109: Hoare triple {86950#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86943#(< main_~i~0 1022)} is VALID [2022-04-15 12:21:56,138 INFO L290 TraceCheckUtils]: 108: Hoare triple {86950#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86950#(< main_~i~0 1021)} is VALID [2022-04-15 12:21:56,139 INFO L290 TraceCheckUtils]: 107: Hoare triple {86957#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86950#(< main_~i~0 1021)} is VALID [2022-04-15 12:21:56,139 INFO L290 TraceCheckUtils]: 106: Hoare triple {86957#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86957#(< main_~i~0 1020)} is VALID [2022-04-15 12:21:56,139 INFO L290 TraceCheckUtils]: 105: Hoare triple {86964#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86957#(< main_~i~0 1020)} is VALID [2022-04-15 12:21:56,140 INFO L290 TraceCheckUtils]: 104: Hoare triple {86964#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86964#(< main_~i~0 1019)} is VALID [2022-04-15 12:21:56,140 INFO L290 TraceCheckUtils]: 103: Hoare triple {86971#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86964#(< main_~i~0 1019)} is VALID [2022-04-15 12:21:56,140 INFO L290 TraceCheckUtils]: 102: Hoare triple {86971#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86971#(< main_~i~0 1018)} is VALID [2022-04-15 12:21:56,140 INFO L290 TraceCheckUtils]: 101: Hoare triple {86978#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86971#(< main_~i~0 1018)} is VALID [2022-04-15 12:21:56,141 INFO L290 TraceCheckUtils]: 100: Hoare triple {86978#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86978#(< main_~i~0 1017)} is VALID [2022-04-15 12:21:56,141 INFO L290 TraceCheckUtils]: 99: Hoare triple {86985#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86978#(< main_~i~0 1017)} is VALID [2022-04-15 12:21:56,141 INFO L290 TraceCheckUtils]: 98: Hoare triple {86985#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86985#(< main_~i~0 1016)} is VALID [2022-04-15 12:21:56,142 INFO L290 TraceCheckUtils]: 97: Hoare triple {86992#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86985#(< main_~i~0 1016)} is VALID [2022-04-15 12:21:56,142 INFO L290 TraceCheckUtils]: 96: Hoare triple {86992#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86992#(< main_~i~0 1015)} is VALID [2022-04-15 12:21:56,142 INFO L290 TraceCheckUtils]: 95: Hoare triple {86999#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86992#(< main_~i~0 1015)} is VALID [2022-04-15 12:21:56,142 INFO L290 TraceCheckUtils]: 94: Hoare triple {86999#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86999#(< main_~i~0 1014)} is VALID [2022-04-15 12:21:56,143 INFO L290 TraceCheckUtils]: 93: Hoare triple {87006#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86999#(< main_~i~0 1014)} is VALID [2022-04-15 12:21:56,143 INFO L290 TraceCheckUtils]: 92: Hoare triple {87006#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87006#(< main_~i~0 1013)} is VALID [2022-04-15 12:21:56,143 INFO L290 TraceCheckUtils]: 91: Hoare triple {87013#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87006#(< main_~i~0 1013)} is VALID [2022-04-15 12:21:56,143 INFO L290 TraceCheckUtils]: 90: Hoare triple {87013#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87013#(< main_~i~0 1012)} is VALID [2022-04-15 12:21:56,144 INFO L290 TraceCheckUtils]: 89: Hoare triple {87020#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87013#(< main_~i~0 1012)} is VALID [2022-04-15 12:21:56,144 INFO L290 TraceCheckUtils]: 88: Hoare triple {87020#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87020#(< main_~i~0 1011)} is VALID [2022-04-15 12:21:56,144 INFO L290 TraceCheckUtils]: 87: Hoare triple {87027#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87020#(< main_~i~0 1011)} is VALID [2022-04-15 12:21:56,145 INFO L290 TraceCheckUtils]: 86: Hoare triple {87027#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87027#(< main_~i~0 1010)} is VALID [2022-04-15 12:21:56,145 INFO L290 TraceCheckUtils]: 85: Hoare triple {87034#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87027#(< main_~i~0 1010)} is VALID [2022-04-15 12:21:56,145 INFO L290 TraceCheckUtils]: 84: Hoare triple {87034#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87034#(< main_~i~0 1009)} is VALID [2022-04-15 12:21:56,145 INFO L290 TraceCheckUtils]: 83: Hoare triple {87041#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87034#(< main_~i~0 1009)} is VALID [2022-04-15 12:21:56,146 INFO L290 TraceCheckUtils]: 82: Hoare triple {87041#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87041#(< main_~i~0 1008)} is VALID [2022-04-15 12:21:56,146 INFO L290 TraceCheckUtils]: 81: Hoare triple {87048#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87041#(< main_~i~0 1008)} is VALID [2022-04-15 12:21:56,146 INFO L290 TraceCheckUtils]: 80: Hoare triple {87048#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87048#(< main_~i~0 1007)} is VALID [2022-04-15 12:21:56,147 INFO L290 TraceCheckUtils]: 79: Hoare triple {87055#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87048#(< main_~i~0 1007)} is VALID [2022-04-15 12:21:56,147 INFO L290 TraceCheckUtils]: 78: Hoare triple {87055#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87055#(< main_~i~0 1006)} is VALID [2022-04-15 12:21:56,147 INFO L290 TraceCheckUtils]: 77: Hoare triple {87062#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87055#(< main_~i~0 1006)} is VALID [2022-04-15 12:21:56,147 INFO L290 TraceCheckUtils]: 76: Hoare triple {87062#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87062#(< main_~i~0 1005)} is VALID [2022-04-15 12:21:56,148 INFO L290 TraceCheckUtils]: 75: Hoare triple {87069#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87062#(< main_~i~0 1005)} is VALID [2022-04-15 12:21:56,148 INFO L290 TraceCheckUtils]: 74: Hoare triple {87069#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87069#(< main_~i~0 1004)} is VALID [2022-04-15 12:21:56,148 INFO L290 TraceCheckUtils]: 73: Hoare triple {87076#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87069#(< main_~i~0 1004)} is VALID [2022-04-15 12:21:56,149 INFO L290 TraceCheckUtils]: 72: Hoare triple {87076#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87076#(< main_~i~0 1003)} is VALID [2022-04-15 12:21:56,149 INFO L290 TraceCheckUtils]: 71: Hoare triple {87083#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87076#(< main_~i~0 1003)} is VALID [2022-04-15 12:21:56,149 INFO L290 TraceCheckUtils]: 70: Hoare triple {87083#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87083#(< main_~i~0 1002)} is VALID [2022-04-15 12:21:56,149 INFO L290 TraceCheckUtils]: 69: Hoare triple {87090#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87083#(< main_~i~0 1002)} is VALID [2022-04-15 12:21:56,150 INFO L290 TraceCheckUtils]: 68: Hoare triple {87090#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87090#(< main_~i~0 1001)} is VALID [2022-04-15 12:21:56,150 INFO L290 TraceCheckUtils]: 67: Hoare triple {87097#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87090#(< main_~i~0 1001)} is VALID [2022-04-15 12:21:56,150 INFO L290 TraceCheckUtils]: 66: Hoare triple {87097#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87097#(< main_~i~0 1000)} is VALID [2022-04-15 12:21:56,151 INFO L290 TraceCheckUtils]: 65: Hoare triple {87104#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87097#(< main_~i~0 1000)} is VALID [2022-04-15 12:21:56,151 INFO L290 TraceCheckUtils]: 64: Hoare triple {87104#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87104#(< main_~i~0 999)} is VALID [2022-04-15 12:21:56,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {87111#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87104#(< main_~i~0 999)} is VALID [2022-04-15 12:21:56,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {87111#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87111#(< main_~i~0 998)} is VALID [2022-04-15 12:21:56,152 INFO L290 TraceCheckUtils]: 61: Hoare triple {87118#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87111#(< main_~i~0 998)} is VALID [2022-04-15 12:21:56,152 INFO L290 TraceCheckUtils]: 60: Hoare triple {87118#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87118#(< main_~i~0 997)} is VALID [2022-04-15 12:21:56,152 INFO L290 TraceCheckUtils]: 59: Hoare triple {87125#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87118#(< main_~i~0 997)} is VALID [2022-04-15 12:21:56,152 INFO L290 TraceCheckUtils]: 58: Hoare triple {87125#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87125#(< main_~i~0 996)} is VALID [2022-04-15 12:21:56,153 INFO L290 TraceCheckUtils]: 57: Hoare triple {87132#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87125#(< main_~i~0 996)} is VALID [2022-04-15 12:21:56,153 INFO L290 TraceCheckUtils]: 56: Hoare triple {87132#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87132#(< main_~i~0 995)} is VALID [2022-04-15 12:21:56,153 INFO L290 TraceCheckUtils]: 55: Hoare triple {87139#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87132#(< main_~i~0 995)} is VALID [2022-04-15 12:21:56,154 INFO L290 TraceCheckUtils]: 54: Hoare triple {87139#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87139#(< main_~i~0 994)} is VALID [2022-04-15 12:21:56,154 INFO L290 TraceCheckUtils]: 53: Hoare triple {87146#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87139#(< main_~i~0 994)} is VALID [2022-04-15 12:21:56,154 INFO L290 TraceCheckUtils]: 52: Hoare triple {87146#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87146#(< main_~i~0 993)} is VALID [2022-04-15 12:21:56,154 INFO L290 TraceCheckUtils]: 51: Hoare triple {87153#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87146#(< main_~i~0 993)} is VALID [2022-04-15 12:21:56,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {87153#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87153#(< main_~i~0 992)} is VALID [2022-04-15 12:21:56,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {87160#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87153#(< main_~i~0 992)} is VALID [2022-04-15 12:21:56,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {87160#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87160#(< main_~i~0 991)} is VALID [2022-04-15 12:21:56,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {87167#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87160#(< main_~i~0 991)} is VALID [2022-04-15 12:21:56,156 INFO L290 TraceCheckUtils]: 46: Hoare triple {87167#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87167#(< main_~i~0 990)} is VALID [2022-04-15 12:21:56,156 INFO L290 TraceCheckUtils]: 45: Hoare triple {87174#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87167#(< main_~i~0 990)} is VALID [2022-04-15 12:21:56,156 INFO L290 TraceCheckUtils]: 44: Hoare triple {87174#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87174#(< main_~i~0 989)} is VALID [2022-04-15 12:21:56,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {87181#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87174#(< main_~i~0 989)} is VALID [2022-04-15 12:21:56,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {87181#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87181#(< main_~i~0 988)} is VALID [2022-04-15 12:21:56,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {87188#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87181#(< main_~i~0 988)} is VALID [2022-04-15 12:21:56,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {87188#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87188#(< main_~i~0 987)} is VALID [2022-04-15 12:21:56,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {87195#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87188#(< main_~i~0 987)} is VALID [2022-04-15 12:21:56,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {87195#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87195#(< main_~i~0 986)} is VALID [2022-04-15 12:21:56,158 INFO L290 TraceCheckUtils]: 37: Hoare triple {87202#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87195#(< main_~i~0 986)} is VALID [2022-04-15 12:21:56,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {87202#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87202#(< main_~i~0 985)} is VALID [2022-04-15 12:21:56,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {87209#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87202#(< main_~i~0 985)} is VALID [2022-04-15 12:21:56,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {87209#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87209#(< main_~i~0 984)} is VALID [2022-04-15 12:21:56,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {87216#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87209#(< main_~i~0 984)} is VALID [2022-04-15 12:21:56,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {87216#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87216#(< main_~i~0 983)} is VALID [2022-04-15 12:21:56,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {87223#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87216#(< main_~i~0 983)} is VALID [2022-04-15 12:21:56,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {87223#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87223#(< main_~i~0 982)} is VALID [2022-04-15 12:21:56,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {87230#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87223#(< main_~i~0 982)} is VALID [2022-04-15 12:21:56,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {87230#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87230#(< main_~i~0 981)} is VALID [2022-04-15 12:21:56,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {87237#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87230#(< main_~i~0 981)} is VALID [2022-04-15 12:21:56,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {87237#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87237#(< main_~i~0 980)} is VALID [2022-04-15 12:21:56,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {87244#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87237#(< main_~i~0 980)} is VALID [2022-04-15 12:21:56,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {87244#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87244#(< main_~i~0 979)} is VALID [2022-04-15 12:21:56,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {87251#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87244#(< main_~i~0 979)} is VALID [2022-04-15 12:21:56,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {87251#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87251#(< main_~i~0 978)} is VALID [2022-04-15 12:21:56,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {87258#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87251#(< main_~i~0 978)} is VALID [2022-04-15 12:21:56,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {87258#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87258#(< main_~i~0 977)} is VALID [2022-04-15 12:21:56,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {87265#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87258#(< main_~i~0 977)} is VALID [2022-04-15 12:21:56,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {87265#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87265#(< main_~i~0 976)} is VALID [2022-04-15 12:21:56,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {87272#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87265#(< main_~i~0 976)} is VALID [2022-04-15 12:21:56,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {87272#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87272#(< main_~i~0 975)} is VALID [2022-04-15 12:21:56,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {87279#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87272#(< main_~i~0 975)} is VALID [2022-04-15 12:21:56,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {87279#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87279#(< main_~i~0 974)} is VALID [2022-04-15 12:21:56,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {87286#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87279#(< main_~i~0 974)} is VALID [2022-04-15 12:21:56,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {87286#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87286#(< main_~i~0 973)} is VALID [2022-04-15 12:21:56,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {87293#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87286#(< main_~i~0 973)} is VALID [2022-04-15 12:21:56,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {87293#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87293#(< main_~i~0 972)} is VALID [2022-04-15 12:21:56,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {87300#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87293#(< main_~i~0 972)} is VALID [2022-04-15 12:21:56,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {87300#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87300#(< main_~i~0 971)} is VALID [2022-04-15 12:21:56,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {87307#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87300#(< main_~i~0 971)} is VALID [2022-04-15 12:21:56,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {87307#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87307#(< main_~i~0 970)} is VALID [2022-04-15 12:21:56,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {86429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {87307#(< main_~i~0 970)} is VALID [2022-04-15 12:21:56,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {86429#true} call #t~ret6 := main(); {86429#true} is VALID [2022-04-15 12:21:56,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86429#true} {86429#true} #64#return; {86429#true} is VALID [2022-04-15 12:21:56,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {86429#true} assume true; {86429#true} is VALID [2022-04-15 12:21:56,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {86429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {86429#true} is VALID [2022-04-15 12:21:56,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {86429#true} call ULTIMATE.init(); {86429#true} is VALID [2022-04-15 12:21:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:21:56,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055990242] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:21:56,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:21:56,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 114 [2022-04-15 12:21:56,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:56,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1168788593] [2022-04-15 12:21:56,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1168788593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:56,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:56,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-15 12:21:56,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036208112] [2022-04-15 12:21:56,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:56,169 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-15 12:21:56,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:56,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:56,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:56,240 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-15 12:21:56,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:56,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-15 12:21:56,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6330, Invalid=6552, Unknown=0, NotChecked=0, Total=12882 [2022-04-15 12:21:56,241 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:08,105 INFO L93 Difference]: Finished difference Result 418 states and 532 transitions. [2022-04-15 12:22:08,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-15 12:22:08,106 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-15 12:22:08,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:22:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 523 transitions. [2022-04-15 12:22:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 523 transitions. [2022-04-15 12:22:08,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 523 transitions. [2022-04-15 12:22:08,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 523 edges. 523 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:08,447 INFO L225 Difference]: With dead ends: 418 [2022-04-15 12:22:08,447 INFO L226 Difference]: Without dead ends: 401 [2022-04-15 12:22:08,449 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=12546, Invalid=15846, Unknown=0, NotChecked=0, Total=28392 [2022-04-15 12:22:08,449 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1321 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:22:08,449 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1321 Valid, 47 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:22:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-04-15 12:22:09,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 134. [2022-04-15 12:22:09,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:22:09,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 401 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:09,209 INFO L74 IsIncluded]: Start isIncluded. First operand 401 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:09,210 INFO L87 Difference]: Start difference. First operand 401 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:09,215 INFO L93 Difference]: Finished difference Result 401 states and 511 transitions. [2022-04-15 12:22:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 511 transitions. [2022-04-15 12:22:09,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:09,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:09,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 401 states. [2022-04-15 12:22:09,216 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 401 states. [2022-04-15 12:22:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:09,222 INFO L93 Difference]: Finished difference Result 401 states and 511 transitions. [2022-04-15 12:22:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 511 transitions. [2022-04-15 12:22:09,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:09,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:09,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:22:09,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:22:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2022-04-15 12:22:09,224 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 131 [2022-04-15 12:22:09,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:22:09,224 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2022-04-15 12:22:09,224 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:09,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 138 transitions. [2022-04-15 12:22:09,557 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:22:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2022-04-15 12:22:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 12:22:09,557 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:22:09,557 INFO L499 BasicCegarLoop]: trace histogram [55, 55, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:22:09,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-04-15 12:22:09,758 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:09,758 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:22:09,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:22:09,758 INFO L85 PathProgramCache]: Analyzing trace with hash 146470959, now seen corresponding path program 111 times [2022-04-15 12:22:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:09,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [64620428] [2022-04-15 12:22:09,762 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:22:09,762 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:22:09,762 INFO L85 PathProgramCache]: Analyzing trace with hash 146470959, now seen corresponding path program 112 times [2022-04-15 12:22:09,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:09,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276946212] [2022-04-15 12:22:09,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:09,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:10,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:22:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:10,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {89408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {89347#true} is VALID [2022-04-15 12:22:10,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {89347#true} assume true; {89347#true} is VALID [2022-04-15 12:22:10,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89347#true} {89347#true} #64#return; {89347#true} is VALID [2022-04-15 12:22:10,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {89347#true} call ULTIMATE.init(); {89408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:22:10,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {89408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {89347#true} is VALID [2022-04-15 12:22:10,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {89347#true} assume true; {89347#true} is VALID [2022-04-15 12:22:10,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89347#true} {89347#true} #64#return; {89347#true} is VALID [2022-04-15 12:22:10,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {89347#true} call #t~ret6 := main(); {89347#true} is VALID [2022-04-15 12:22:10,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {89347#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {89352#(= main_~i~0 0)} is VALID [2022-04-15 12:22:10,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {89352#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89352#(= main_~i~0 0)} is VALID [2022-04-15 12:22:10,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {89352#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89353#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:10,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {89353#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89353#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:10,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {89353#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89354#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:10,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {89354#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89354#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:10,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {89354#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89355#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:10,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {89355#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89355#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:10,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {89355#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89356#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:10,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {89356#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89356#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:10,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {89356#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89357#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:10,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {89357#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89357#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:10,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {89357#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89358#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:10,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {89358#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89358#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:10,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {89358#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89359#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:10,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {89359#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89359#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:10,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {89359#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89360#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:10,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {89360#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89360#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:10,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {89360#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89361#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:10,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {89361#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89361#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:10,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {89361#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89362#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:10,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {89362#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89362#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:10,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {89362#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89363#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:10,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {89363#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89363#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:10,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {89363#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89364#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:10,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {89364#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89364#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:10,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {89364#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89365#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:10,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {89365#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89365#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:10,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {89365#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89366#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:10,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {89366#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89366#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:10,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {89366#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89367#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:10,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {89367#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89367#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:10,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {89367#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89368#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:10,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {89368#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89368#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:10,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {89368#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89369#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:10,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {89369#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89369#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:10,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {89369#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89370#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:10,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {89370#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89370#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:10,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {89370#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89371#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:10,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {89371#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89371#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:10,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {89371#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89372#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:10,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {89372#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89372#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:10,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {89372#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89373#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:10,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {89373#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89373#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:10,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {89373#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89374#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:10,821 INFO L290 TraceCheckUtils]: 50: Hoare triple {89374#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89374#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:10,821 INFO L290 TraceCheckUtils]: 51: Hoare triple {89374#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89375#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:10,821 INFO L290 TraceCheckUtils]: 52: Hoare triple {89375#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89375#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:10,821 INFO L290 TraceCheckUtils]: 53: Hoare triple {89375#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89376#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:10,822 INFO L290 TraceCheckUtils]: 54: Hoare triple {89376#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89376#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:10,822 INFO L290 TraceCheckUtils]: 55: Hoare triple {89376#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89377#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:10,822 INFO L290 TraceCheckUtils]: 56: Hoare triple {89377#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89377#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:10,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {89377#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89378#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:10,823 INFO L290 TraceCheckUtils]: 58: Hoare triple {89378#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89378#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:10,823 INFO L290 TraceCheckUtils]: 59: Hoare triple {89378#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89379#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:10,823 INFO L290 TraceCheckUtils]: 60: Hoare triple {89379#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89379#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:10,824 INFO L290 TraceCheckUtils]: 61: Hoare triple {89379#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89380#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:10,824 INFO L290 TraceCheckUtils]: 62: Hoare triple {89380#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89380#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:10,824 INFO L290 TraceCheckUtils]: 63: Hoare triple {89380#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89381#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:10,824 INFO L290 TraceCheckUtils]: 64: Hoare triple {89381#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89381#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:10,825 INFO L290 TraceCheckUtils]: 65: Hoare triple {89381#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89382#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:10,825 INFO L290 TraceCheckUtils]: 66: Hoare triple {89382#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89382#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:10,825 INFO L290 TraceCheckUtils]: 67: Hoare triple {89382#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89383#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:10,825 INFO L290 TraceCheckUtils]: 68: Hoare triple {89383#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89383#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:10,826 INFO L290 TraceCheckUtils]: 69: Hoare triple {89383#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89384#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:10,826 INFO L290 TraceCheckUtils]: 70: Hoare triple {89384#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89384#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:10,826 INFO L290 TraceCheckUtils]: 71: Hoare triple {89384#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89385#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:10,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {89385#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89385#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:10,827 INFO L290 TraceCheckUtils]: 73: Hoare triple {89385#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89386#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:10,827 INFO L290 TraceCheckUtils]: 74: Hoare triple {89386#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89386#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:10,827 INFO L290 TraceCheckUtils]: 75: Hoare triple {89386#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89387#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:10,828 INFO L290 TraceCheckUtils]: 76: Hoare triple {89387#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89387#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:10,828 INFO L290 TraceCheckUtils]: 77: Hoare triple {89387#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89388#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:10,828 INFO L290 TraceCheckUtils]: 78: Hoare triple {89388#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89388#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:10,828 INFO L290 TraceCheckUtils]: 79: Hoare triple {89388#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89389#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:10,829 INFO L290 TraceCheckUtils]: 80: Hoare triple {89389#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89389#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:10,829 INFO L290 TraceCheckUtils]: 81: Hoare triple {89389#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89390#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:10,829 INFO L290 TraceCheckUtils]: 82: Hoare triple {89390#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89390#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:10,830 INFO L290 TraceCheckUtils]: 83: Hoare triple {89390#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89391#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:10,830 INFO L290 TraceCheckUtils]: 84: Hoare triple {89391#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89391#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:10,830 INFO L290 TraceCheckUtils]: 85: Hoare triple {89391#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89392#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:10,830 INFO L290 TraceCheckUtils]: 86: Hoare triple {89392#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89392#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:10,831 INFO L290 TraceCheckUtils]: 87: Hoare triple {89392#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89393#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:10,831 INFO L290 TraceCheckUtils]: 88: Hoare triple {89393#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89393#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:10,831 INFO L290 TraceCheckUtils]: 89: Hoare triple {89393#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89394#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:10,831 INFO L290 TraceCheckUtils]: 90: Hoare triple {89394#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89394#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:10,832 INFO L290 TraceCheckUtils]: 91: Hoare triple {89394#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89395#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:10,832 INFO L290 TraceCheckUtils]: 92: Hoare triple {89395#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89395#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:10,832 INFO L290 TraceCheckUtils]: 93: Hoare triple {89395#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89396#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:10,832 INFO L290 TraceCheckUtils]: 94: Hoare triple {89396#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89396#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:10,833 INFO L290 TraceCheckUtils]: 95: Hoare triple {89396#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89397#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:10,833 INFO L290 TraceCheckUtils]: 96: Hoare triple {89397#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89397#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:10,833 INFO L290 TraceCheckUtils]: 97: Hoare triple {89397#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89398#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:10,834 INFO L290 TraceCheckUtils]: 98: Hoare triple {89398#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89398#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:10,834 INFO L290 TraceCheckUtils]: 99: Hoare triple {89398#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89399#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:10,834 INFO L290 TraceCheckUtils]: 100: Hoare triple {89399#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89399#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:10,834 INFO L290 TraceCheckUtils]: 101: Hoare triple {89399#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89400#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:10,835 INFO L290 TraceCheckUtils]: 102: Hoare triple {89400#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89400#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:10,835 INFO L290 TraceCheckUtils]: 103: Hoare triple {89400#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89401#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:10,835 INFO L290 TraceCheckUtils]: 104: Hoare triple {89401#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89401#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:10,836 INFO L290 TraceCheckUtils]: 105: Hoare triple {89401#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89402#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:10,836 INFO L290 TraceCheckUtils]: 106: Hoare triple {89402#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89402#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:10,836 INFO L290 TraceCheckUtils]: 107: Hoare triple {89402#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89403#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:10,836 INFO L290 TraceCheckUtils]: 108: Hoare triple {89403#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89403#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:10,837 INFO L290 TraceCheckUtils]: 109: Hoare triple {89403#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89404#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:10,837 INFO L290 TraceCheckUtils]: 110: Hoare triple {89404#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89404#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:10,837 INFO L290 TraceCheckUtils]: 111: Hoare triple {89404#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89405#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:10,837 INFO L290 TraceCheckUtils]: 112: Hoare triple {89405#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89405#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:10,838 INFO L290 TraceCheckUtils]: 113: Hoare triple {89405#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89406#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:10,838 INFO L290 TraceCheckUtils]: 114: Hoare triple {89406#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89406#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:10,838 INFO L290 TraceCheckUtils]: 115: Hoare triple {89406#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89407#(<= main_~i~0 55)} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 116: Hoare triple {89407#(<= main_~i~0 55)} assume !(~i~0 < 1024); {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 117: Hoare triple {89348#false} ~i~0 := 0; {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 118: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 119: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 120: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 121: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 122: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 123: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 124: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 125: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 126: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 127: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 128: Hoare triple {89348#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L272 TraceCheckUtils]: 129: Hoare triple {89348#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 130: Hoare triple {89348#false} ~cond := #in~cond; {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 131: Hoare triple {89348#false} assume 0 == ~cond; {89348#false} is VALID [2022-04-15 12:22:10,839 INFO L290 TraceCheckUtils]: 132: Hoare triple {89348#false} assume !false; {89348#false} is VALID [2022-04-15 12:22:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3035 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:22:10,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:22:10,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276946212] [2022-04-15 12:22:10,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276946212] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:22:10,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800663461] [2022-04-15 12:22:10,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:22:10,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:22:10,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:22:10,841 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:10,841 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:11,169 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:22:11,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:22:11,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 12:22:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:11,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:22:11,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {89347#true} call ULTIMATE.init(); {89347#true} is VALID [2022-04-15 12:22:11,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {89347#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {89347#true} is VALID [2022-04-15 12:22:11,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {89347#true} assume true; {89347#true} is VALID [2022-04-15 12:22:11,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89347#true} {89347#true} #64#return; {89347#true} is VALID [2022-04-15 12:22:11,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {89347#true} call #t~ret6 := main(); {89347#true} is VALID [2022-04-15 12:22:11,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {89347#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {89427#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:11,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {89427#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89427#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:11,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {89427#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89353#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:11,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {89353#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89353#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:11,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {89353#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89354#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:11,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {89354#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89354#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:11,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {89354#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89355#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:11,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {89355#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89355#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:11,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {89355#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89356#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:11,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {89356#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89356#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:11,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {89356#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89357#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:11,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {89357#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89357#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:11,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {89357#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89358#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:11,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {89358#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89358#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:11,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {89358#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89359#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:11,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {89359#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89359#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:11,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {89359#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89360#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:11,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {89360#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89360#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:11,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {89360#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89361#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:11,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {89361#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89361#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:11,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {89361#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89362#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:11,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {89362#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89362#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:11,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {89362#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89363#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:11,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {89363#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89363#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:11,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {89363#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89364#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:11,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {89364#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89364#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:11,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {89364#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89365#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:11,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {89365#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89365#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:11,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {89365#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89366#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:11,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {89366#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89366#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:11,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {89366#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89367#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:11,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {89367#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89367#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:11,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {89367#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89368#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:11,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {89368#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89368#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:11,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {89368#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89369#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:11,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {89369#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89369#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:11,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {89369#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89370#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:11,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {89370#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89370#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:11,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {89370#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89371#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:11,836 INFO L290 TraceCheckUtils]: 44: Hoare triple {89371#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89371#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:11,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {89371#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89372#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:11,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {89372#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89372#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:11,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {89372#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89373#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:11,837 INFO L290 TraceCheckUtils]: 48: Hoare triple {89373#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89373#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:11,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {89373#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89374#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:11,838 INFO L290 TraceCheckUtils]: 50: Hoare triple {89374#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89374#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:11,838 INFO L290 TraceCheckUtils]: 51: Hoare triple {89374#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89375#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:11,838 INFO L290 TraceCheckUtils]: 52: Hoare triple {89375#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89375#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:11,838 INFO L290 TraceCheckUtils]: 53: Hoare triple {89375#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89376#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:11,839 INFO L290 TraceCheckUtils]: 54: Hoare triple {89376#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89376#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:11,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {89376#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89377#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:11,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {89377#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89377#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:11,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {89377#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89378#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:11,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {89378#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89378#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:11,840 INFO L290 TraceCheckUtils]: 59: Hoare triple {89378#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89379#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:11,840 INFO L290 TraceCheckUtils]: 60: Hoare triple {89379#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89379#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:11,841 INFO L290 TraceCheckUtils]: 61: Hoare triple {89379#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89380#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:11,841 INFO L290 TraceCheckUtils]: 62: Hoare triple {89380#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89380#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:11,841 INFO L290 TraceCheckUtils]: 63: Hoare triple {89380#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89381#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:11,841 INFO L290 TraceCheckUtils]: 64: Hoare triple {89381#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89381#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:11,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {89381#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89382#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:11,842 INFO L290 TraceCheckUtils]: 66: Hoare triple {89382#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89382#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:11,842 INFO L290 TraceCheckUtils]: 67: Hoare triple {89382#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89383#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:11,843 INFO L290 TraceCheckUtils]: 68: Hoare triple {89383#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89383#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:11,843 INFO L290 TraceCheckUtils]: 69: Hoare triple {89383#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89384#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:11,843 INFO L290 TraceCheckUtils]: 70: Hoare triple {89384#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89384#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:11,843 INFO L290 TraceCheckUtils]: 71: Hoare triple {89384#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89385#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:11,844 INFO L290 TraceCheckUtils]: 72: Hoare triple {89385#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89385#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:11,844 INFO L290 TraceCheckUtils]: 73: Hoare triple {89385#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89386#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:11,844 INFO L290 TraceCheckUtils]: 74: Hoare triple {89386#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89386#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:11,844 INFO L290 TraceCheckUtils]: 75: Hoare triple {89386#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89387#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:11,845 INFO L290 TraceCheckUtils]: 76: Hoare triple {89387#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89387#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:11,845 INFO L290 TraceCheckUtils]: 77: Hoare triple {89387#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89388#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:11,845 INFO L290 TraceCheckUtils]: 78: Hoare triple {89388#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89388#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:11,846 INFO L290 TraceCheckUtils]: 79: Hoare triple {89388#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89389#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:11,846 INFO L290 TraceCheckUtils]: 80: Hoare triple {89389#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89389#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:11,846 INFO L290 TraceCheckUtils]: 81: Hoare triple {89389#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89390#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:11,846 INFO L290 TraceCheckUtils]: 82: Hoare triple {89390#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89390#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:11,847 INFO L290 TraceCheckUtils]: 83: Hoare triple {89390#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89391#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:11,847 INFO L290 TraceCheckUtils]: 84: Hoare triple {89391#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89391#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:11,847 INFO L290 TraceCheckUtils]: 85: Hoare triple {89391#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89392#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:11,848 INFO L290 TraceCheckUtils]: 86: Hoare triple {89392#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89392#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:11,848 INFO L290 TraceCheckUtils]: 87: Hoare triple {89392#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89393#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:11,848 INFO L290 TraceCheckUtils]: 88: Hoare triple {89393#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89393#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:11,848 INFO L290 TraceCheckUtils]: 89: Hoare triple {89393#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89394#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:11,849 INFO L290 TraceCheckUtils]: 90: Hoare triple {89394#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89394#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:11,849 INFO L290 TraceCheckUtils]: 91: Hoare triple {89394#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89395#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:11,849 INFO L290 TraceCheckUtils]: 92: Hoare triple {89395#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89395#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:11,850 INFO L290 TraceCheckUtils]: 93: Hoare triple {89395#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89396#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:11,850 INFO L290 TraceCheckUtils]: 94: Hoare triple {89396#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89396#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:11,850 INFO L290 TraceCheckUtils]: 95: Hoare triple {89396#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89397#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:11,850 INFO L290 TraceCheckUtils]: 96: Hoare triple {89397#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89397#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:11,851 INFO L290 TraceCheckUtils]: 97: Hoare triple {89397#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89398#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:11,851 INFO L290 TraceCheckUtils]: 98: Hoare triple {89398#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89398#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:11,851 INFO L290 TraceCheckUtils]: 99: Hoare triple {89398#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89399#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:11,851 INFO L290 TraceCheckUtils]: 100: Hoare triple {89399#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89399#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:11,852 INFO L290 TraceCheckUtils]: 101: Hoare triple {89399#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89400#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:11,852 INFO L290 TraceCheckUtils]: 102: Hoare triple {89400#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89400#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:11,852 INFO L290 TraceCheckUtils]: 103: Hoare triple {89400#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89401#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:11,853 INFO L290 TraceCheckUtils]: 104: Hoare triple {89401#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89401#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:11,853 INFO L290 TraceCheckUtils]: 105: Hoare triple {89401#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89402#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:11,853 INFO L290 TraceCheckUtils]: 106: Hoare triple {89402#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89402#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:11,853 INFO L290 TraceCheckUtils]: 107: Hoare triple {89402#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89403#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:11,854 INFO L290 TraceCheckUtils]: 108: Hoare triple {89403#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89403#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:11,854 INFO L290 TraceCheckUtils]: 109: Hoare triple {89403#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89404#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:11,854 INFO L290 TraceCheckUtils]: 110: Hoare triple {89404#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89404#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:11,855 INFO L290 TraceCheckUtils]: 111: Hoare triple {89404#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89405#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:11,855 INFO L290 TraceCheckUtils]: 112: Hoare triple {89405#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89405#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:11,855 INFO L290 TraceCheckUtils]: 113: Hoare triple {89405#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89406#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:11,855 INFO L290 TraceCheckUtils]: 114: Hoare triple {89406#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89406#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:11,856 INFO L290 TraceCheckUtils]: 115: Hoare triple {89406#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89407#(<= main_~i~0 55)} is VALID [2022-04-15 12:22:11,856 INFO L290 TraceCheckUtils]: 116: Hoare triple {89407#(<= main_~i~0 55)} assume !(~i~0 < 1024); {89348#false} is VALID [2022-04-15 12:22:11,856 INFO L290 TraceCheckUtils]: 117: Hoare triple {89348#false} ~i~0 := 0; {89348#false} is VALID [2022-04-15 12:22:11,856 INFO L290 TraceCheckUtils]: 118: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 12:22:11,856 INFO L290 TraceCheckUtils]: 119: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 12:22:11,856 INFO L290 TraceCheckUtils]: 120: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 12:22:11,856 INFO L290 TraceCheckUtils]: 121: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-15 12:22:11,856 INFO L290 TraceCheckUtils]: 122: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 12:22:11,856 INFO L290 TraceCheckUtils]: 123: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 12:22:11,856 INFO L290 TraceCheckUtils]: 124: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 12:22:11,856 INFO L290 TraceCheckUtils]: 125: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-15 12:22:11,856 INFO L290 TraceCheckUtils]: 126: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 12:22:11,856 INFO L290 TraceCheckUtils]: 127: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 12:22:11,857 INFO L290 TraceCheckUtils]: 128: Hoare triple {89348#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 12:22:11,857 INFO L272 TraceCheckUtils]: 129: Hoare triple {89348#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {89348#false} is VALID [2022-04-15 12:22:11,857 INFO L290 TraceCheckUtils]: 130: Hoare triple {89348#false} ~cond := #in~cond; {89348#false} is VALID [2022-04-15 12:22:11,857 INFO L290 TraceCheckUtils]: 131: Hoare triple {89348#false} assume 0 == ~cond; {89348#false} is VALID [2022-04-15 12:22:11,857 INFO L290 TraceCheckUtils]: 132: Hoare triple {89348#false} assume !false; {89348#false} is VALID [2022-04-15 12:22:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3035 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:22:11,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:22:15,030 INFO L290 TraceCheckUtils]: 132: Hoare triple {89348#false} assume !false; {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L290 TraceCheckUtils]: 131: Hoare triple {89348#false} assume 0 == ~cond; {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L290 TraceCheckUtils]: 130: Hoare triple {89348#false} ~cond := #in~cond; {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L272 TraceCheckUtils]: 129: Hoare triple {89348#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L290 TraceCheckUtils]: 128: Hoare triple {89348#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L290 TraceCheckUtils]: 127: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L290 TraceCheckUtils]: 126: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L290 TraceCheckUtils]: 125: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L290 TraceCheckUtils]: 124: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L290 TraceCheckUtils]: 123: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L290 TraceCheckUtils]: 122: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L290 TraceCheckUtils]: 121: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L290 TraceCheckUtils]: 120: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L290 TraceCheckUtils]: 119: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L290 TraceCheckUtils]: 118: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 12:22:15,031 INFO L290 TraceCheckUtils]: 117: Hoare triple {89348#false} ~i~0 := 0; {89348#false} is VALID [2022-04-15 12:22:15,032 INFO L290 TraceCheckUtils]: 116: Hoare triple {89857#(< main_~i~0 1024)} assume !(~i~0 < 1024); {89348#false} is VALID [2022-04-15 12:22:15,032 INFO L290 TraceCheckUtils]: 115: Hoare triple {89861#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89857#(< main_~i~0 1024)} is VALID [2022-04-15 12:22:15,032 INFO L290 TraceCheckUtils]: 114: Hoare triple {89861#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89861#(< main_~i~0 1023)} is VALID [2022-04-15 12:22:15,033 INFO L290 TraceCheckUtils]: 113: Hoare triple {89868#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89861#(< main_~i~0 1023)} is VALID [2022-04-15 12:22:15,033 INFO L290 TraceCheckUtils]: 112: Hoare triple {89868#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89868#(< main_~i~0 1022)} is VALID [2022-04-15 12:22:15,033 INFO L290 TraceCheckUtils]: 111: Hoare triple {89875#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89868#(< main_~i~0 1022)} is VALID [2022-04-15 12:22:15,033 INFO L290 TraceCheckUtils]: 110: Hoare triple {89875#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89875#(< main_~i~0 1021)} is VALID [2022-04-15 12:22:15,034 INFO L290 TraceCheckUtils]: 109: Hoare triple {89882#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89875#(< main_~i~0 1021)} is VALID [2022-04-15 12:22:15,034 INFO L290 TraceCheckUtils]: 108: Hoare triple {89882#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89882#(< main_~i~0 1020)} is VALID [2022-04-15 12:22:15,034 INFO L290 TraceCheckUtils]: 107: Hoare triple {89889#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89882#(< main_~i~0 1020)} is VALID [2022-04-15 12:22:15,034 INFO L290 TraceCheckUtils]: 106: Hoare triple {89889#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89889#(< main_~i~0 1019)} is VALID [2022-04-15 12:22:15,035 INFO L290 TraceCheckUtils]: 105: Hoare triple {89896#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89889#(< main_~i~0 1019)} is VALID [2022-04-15 12:22:15,035 INFO L290 TraceCheckUtils]: 104: Hoare triple {89896#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89896#(< main_~i~0 1018)} is VALID [2022-04-15 12:22:15,035 INFO L290 TraceCheckUtils]: 103: Hoare triple {89903#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89896#(< main_~i~0 1018)} is VALID [2022-04-15 12:22:15,036 INFO L290 TraceCheckUtils]: 102: Hoare triple {89903#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89903#(< main_~i~0 1017)} is VALID [2022-04-15 12:22:15,036 INFO L290 TraceCheckUtils]: 101: Hoare triple {89910#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89903#(< main_~i~0 1017)} is VALID [2022-04-15 12:22:15,036 INFO L290 TraceCheckUtils]: 100: Hoare triple {89910#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89910#(< main_~i~0 1016)} is VALID [2022-04-15 12:22:15,037 INFO L290 TraceCheckUtils]: 99: Hoare triple {89917#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89910#(< main_~i~0 1016)} is VALID [2022-04-15 12:22:15,037 INFO L290 TraceCheckUtils]: 98: Hoare triple {89917#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89917#(< main_~i~0 1015)} is VALID [2022-04-15 12:22:15,037 INFO L290 TraceCheckUtils]: 97: Hoare triple {89924#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89917#(< main_~i~0 1015)} is VALID [2022-04-15 12:22:15,037 INFO L290 TraceCheckUtils]: 96: Hoare triple {89924#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89924#(< main_~i~0 1014)} is VALID [2022-04-15 12:22:15,038 INFO L290 TraceCheckUtils]: 95: Hoare triple {89931#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89924#(< main_~i~0 1014)} is VALID [2022-04-15 12:22:15,038 INFO L290 TraceCheckUtils]: 94: Hoare triple {89931#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89931#(< main_~i~0 1013)} is VALID [2022-04-15 12:22:15,038 INFO L290 TraceCheckUtils]: 93: Hoare triple {89938#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89931#(< main_~i~0 1013)} is VALID [2022-04-15 12:22:15,038 INFO L290 TraceCheckUtils]: 92: Hoare triple {89938#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89938#(< main_~i~0 1012)} is VALID [2022-04-15 12:22:15,039 INFO L290 TraceCheckUtils]: 91: Hoare triple {89945#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89938#(< main_~i~0 1012)} is VALID [2022-04-15 12:22:15,039 INFO L290 TraceCheckUtils]: 90: Hoare triple {89945#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89945#(< main_~i~0 1011)} is VALID [2022-04-15 12:22:15,039 INFO L290 TraceCheckUtils]: 89: Hoare triple {89952#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89945#(< main_~i~0 1011)} is VALID [2022-04-15 12:22:15,040 INFO L290 TraceCheckUtils]: 88: Hoare triple {89952#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89952#(< main_~i~0 1010)} is VALID [2022-04-15 12:22:15,040 INFO L290 TraceCheckUtils]: 87: Hoare triple {89959#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89952#(< main_~i~0 1010)} is VALID [2022-04-15 12:22:15,040 INFO L290 TraceCheckUtils]: 86: Hoare triple {89959#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89959#(< main_~i~0 1009)} is VALID [2022-04-15 12:22:15,040 INFO L290 TraceCheckUtils]: 85: Hoare triple {89966#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89959#(< main_~i~0 1009)} is VALID [2022-04-15 12:22:15,041 INFO L290 TraceCheckUtils]: 84: Hoare triple {89966#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89966#(< main_~i~0 1008)} is VALID [2022-04-15 12:22:15,041 INFO L290 TraceCheckUtils]: 83: Hoare triple {89973#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89966#(< main_~i~0 1008)} is VALID [2022-04-15 12:22:15,041 INFO L290 TraceCheckUtils]: 82: Hoare triple {89973#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89973#(< main_~i~0 1007)} is VALID [2022-04-15 12:22:15,042 INFO L290 TraceCheckUtils]: 81: Hoare triple {89980#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89973#(< main_~i~0 1007)} is VALID [2022-04-15 12:22:15,042 INFO L290 TraceCheckUtils]: 80: Hoare triple {89980#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89980#(< main_~i~0 1006)} is VALID [2022-04-15 12:22:15,042 INFO L290 TraceCheckUtils]: 79: Hoare triple {89987#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89980#(< main_~i~0 1006)} is VALID [2022-04-15 12:22:15,042 INFO L290 TraceCheckUtils]: 78: Hoare triple {89987#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89987#(< main_~i~0 1005)} is VALID [2022-04-15 12:22:15,043 INFO L290 TraceCheckUtils]: 77: Hoare triple {89994#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89987#(< main_~i~0 1005)} is VALID [2022-04-15 12:22:15,043 INFO L290 TraceCheckUtils]: 76: Hoare triple {89994#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89994#(< main_~i~0 1004)} is VALID [2022-04-15 12:22:15,043 INFO L290 TraceCheckUtils]: 75: Hoare triple {90001#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89994#(< main_~i~0 1004)} is VALID [2022-04-15 12:22:15,043 INFO L290 TraceCheckUtils]: 74: Hoare triple {90001#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90001#(< main_~i~0 1003)} is VALID [2022-04-15 12:22:15,044 INFO L290 TraceCheckUtils]: 73: Hoare triple {90008#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90001#(< main_~i~0 1003)} is VALID [2022-04-15 12:22:15,044 INFO L290 TraceCheckUtils]: 72: Hoare triple {90008#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90008#(< main_~i~0 1002)} is VALID [2022-04-15 12:22:15,044 INFO L290 TraceCheckUtils]: 71: Hoare triple {90015#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90008#(< main_~i~0 1002)} is VALID [2022-04-15 12:22:15,045 INFO L290 TraceCheckUtils]: 70: Hoare triple {90015#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90015#(< main_~i~0 1001)} is VALID [2022-04-15 12:22:15,045 INFO L290 TraceCheckUtils]: 69: Hoare triple {90022#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90015#(< main_~i~0 1001)} is VALID [2022-04-15 12:22:15,045 INFO L290 TraceCheckUtils]: 68: Hoare triple {90022#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90022#(< main_~i~0 1000)} is VALID [2022-04-15 12:22:15,045 INFO L290 TraceCheckUtils]: 67: Hoare triple {90029#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90022#(< main_~i~0 1000)} is VALID [2022-04-15 12:22:15,046 INFO L290 TraceCheckUtils]: 66: Hoare triple {90029#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90029#(< main_~i~0 999)} is VALID [2022-04-15 12:22:15,046 INFO L290 TraceCheckUtils]: 65: Hoare triple {90036#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90029#(< main_~i~0 999)} is VALID [2022-04-15 12:22:15,046 INFO L290 TraceCheckUtils]: 64: Hoare triple {90036#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90036#(< main_~i~0 998)} is VALID [2022-04-15 12:22:15,047 INFO L290 TraceCheckUtils]: 63: Hoare triple {90043#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90036#(< main_~i~0 998)} is VALID [2022-04-15 12:22:15,047 INFO L290 TraceCheckUtils]: 62: Hoare triple {90043#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90043#(< main_~i~0 997)} is VALID [2022-04-15 12:22:15,047 INFO L290 TraceCheckUtils]: 61: Hoare triple {90050#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90043#(< main_~i~0 997)} is VALID [2022-04-15 12:22:15,047 INFO L290 TraceCheckUtils]: 60: Hoare triple {90050#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90050#(< main_~i~0 996)} is VALID [2022-04-15 12:22:15,048 INFO L290 TraceCheckUtils]: 59: Hoare triple {90057#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90050#(< main_~i~0 996)} is VALID [2022-04-15 12:22:15,048 INFO L290 TraceCheckUtils]: 58: Hoare triple {90057#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90057#(< main_~i~0 995)} is VALID [2022-04-15 12:22:15,048 INFO L290 TraceCheckUtils]: 57: Hoare triple {90064#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90057#(< main_~i~0 995)} is VALID [2022-04-15 12:22:15,048 INFO L290 TraceCheckUtils]: 56: Hoare triple {90064#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90064#(< main_~i~0 994)} is VALID [2022-04-15 12:22:15,049 INFO L290 TraceCheckUtils]: 55: Hoare triple {90071#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90064#(< main_~i~0 994)} is VALID [2022-04-15 12:22:15,049 INFO L290 TraceCheckUtils]: 54: Hoare triple {90071#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90071#(< main_~i~0 993)} is VALID [2022-04-15 12:22:15,049 INFO L290 TraceCheckUtils]: 53: Hoare triple {90078#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90071#(< main_~i~0 993)} is VALID [2022-04-15 12:22:15,050 INFO L290 TraceCheckUtils]: 52: Hoare triple {90078#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90078#(< main_~i~0 992)} is VALID [2022-04-15 12:22:15,050 INFO L290 TraceCheckUtils]: 51: Hoare triple {90085#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90078#(< main_~i~0 992)} is VALID [2022-04-15 12:22:15,050 INFO L290 TraceCheckUtils]: 50: Hoare triple {90085#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90085#(< main_~i~0 991)} is VALID [2022-04-15 12:22:15,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {90092#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90085#(< main_~i~0 991)} is VALID [2022-04-15 12:22:15,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {90092#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90092#(< main_~i~0 990)} is VALID [2022-04-15 12:22:15,051 INFO L290 TraceCheckUtils]: 47: Hoare triple {90099#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90092#(< main_~i~0 990)} is VALID [2022-04-15 12:22:15,051 INFO L290 TraceCheckUtils]: 46: Hoare triple {90099#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90099#(< main_~i~0 989)} is VALID [2022-04-15 12:22:15,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {90106#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90099#(< main_~i~0 989)} is VALID [2022-04-15 12:22:15,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {90106#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90106#(< main_~i~0 988)} is VALID [2022-04-15 12:22:15,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {90113#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90106#(< main_~i~0 988)} is VALID [2022-04-15 12:22:15,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {90113#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90113#(< main_~i~0 987)} is VALID [2022-04-15 12:22:15,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {90120#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90113#(< main_~i~0 987)} is VALID [2022-04-15 12:22:15,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {90120#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90120#(< main_~i~0 986)} is VALID [2022-04-15 12:22:15,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {90127#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90120#(< main_~i~0 986)} is VALID [2022-04-15 12:22:15,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {90127#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90127#(< main_~i~0 985)} is VALID [2022-04-15 12:22:15,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {90134#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90127#(< main_~i~0 985)} is VALID [2022-04-15 12:22:15,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {90134#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90134#(< main_~i~0 984)} is VALID [2022-04-15 12:22:15,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {90141#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90134#(< main_~i~0 984)} is VALID [2022-04-15 12:22:15,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {90141#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90141#(< main_~i~0 983)} is VALID [2022-04-15 12:22:15,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {90148#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90141#(< main_~i~0 983)} is VALID [2022-04-15 12:22:15,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {90148#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90148#(< main_~i~0 982)} is VALID [2022-04-15 12:22:15,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {90155#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90148#(< main_~i~0 982)} is VALID [2022-04-15 12:22:15,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {90155#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90155#(< main_~i~0 981)} is VALID [2022-04-15 12:22:15,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {90162#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90155#(< main_~i~0 981)} is VALID [2022-04-15 12:22:15,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {90162#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90162#(< main_~i~0 980)} is VALID [2022-04-15 12:22:15,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {90169#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90162#(< main_~i~0 980)} is VALID [2022-04-15 12:22:15,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {90169#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90169#(< main_~i~0 979)} is VALID [2022-04-15 12:22:15,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {90176#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90169#(< main_~i~0 979)} is VALID [2022-04-15 12:22:15,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {90176#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90176#(< main_~i~0 978)} is VALID [2022-04-15 12:22:15,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {90183#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90176#(< main_~i~0 978)} is VALID [2022-04-15 12:22:15,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {90183#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90183#(< main_~i~0 977)} is VALID [2022-04-15 12:22:15,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {90190#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90183#(< main_~i~0 977)} is VALID [2022-04-15 12:22:15,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {90190#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90190#(< main_~i~0 976)} is VALID [2022-04-15 12:22:15,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {90197#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90190#(< main_~i~0 976)} is VALID [2022-04-15 12:22:15,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {90197#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90197#(< main_~i~0 975)} is VALID [2022-04-15 12:22:15,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {90204#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90197#(< main_~i~0 975)} is VALID [2022-04-15 12:22:15,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {90204#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90204#(< main_~i~0 974)} is VALID [2022-04-15 12:22:15,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {90211#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90204#(< main_~i~0 974)} is VALID [2022-04-15 12:22:15,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {90211#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90211#(< main_~i~0 973)} is VALID [2022-04-15 12:22:15,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {90218#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90211#(< main_~i~0 973)} is VALID [2022-04-15 12:22:15,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {90218#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90218#(< main_~i~0 972)} is VALID [2022-04-15 12:22:15,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {90225#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90218#(< main_~i~0 972)} is VALID [2022-04-15 12:22:15,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {90225#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90225#(< main_~i~0 971)} is VALID [2022-04-15 12:22:15,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {90232#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90225#(< main_~i~0 971)} is VALID [2022-04-15 12:22:15,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {90232#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90232#(< main_~i~0 970)} is VALID [2022-04-15 12:22:15,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {90239#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90232#(< main_~i~0 970)} is VALID [2022-04-15 12:22:15,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {90239#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90239#(< main_~i~0 969)} is VALID [2022-04-15 12:22:15,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {89347#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {90239#(< main_~i~0 969)} is VALID [2022-04-15 12:22:15,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {89347#true} call #t~ret6 := main(); {89347#true} is VALID [2022-04-15 12:22:15,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89347#true} {89347#true} #64#return; {89347#true} is VALID [2022-04-15 12:22:15,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {89347#true} assume true; {89347#true} is VALID [2022-04-15 12:22:15,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {89347#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {89347#true} is VALID [2022-04-15 12:22:15,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {89347#true} call ULTIMATE.init(); {89347#true} is VALID [2022-04-15 12:22:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3035 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:22:15,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800663461] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:22:15,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:22:15,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 116 [2022-04-15 12:22:15,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:22:15,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [64620428] [2022-04-15 12:22:15,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [64620428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:15,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:15,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-15 12:22:15,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922512759] [2022-04-15 12:22:15,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:22:15,064 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-15 12:22:15,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:22:15,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:15,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:15,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-15 12:22:15,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:15,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-15 12:22:15,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6557, Invalid=6783, Unknown=0, NotChecked=0, Total=13340 [2022-04-15 12:22:15,138 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:27,322 INFO L93 Difference]: Finished difference Result 425 states and 541 transitions. [2022-04-15 12:22:27,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 12:22:27,323 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-15 12:22:27,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:22:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 532 transitions. [2022-04-15 12:22:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 532 transitions. [2022-04-15 12:22:27,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 532 transitions. [2022-04-15 12:22:27,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 532 edges. 532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:27,675 INFO L225 Difference]: With dead ends: 425 [2022-04-15 12:22:27,675 INFO L226 Difference]: Without dead ends: 408 [2022-04-15 12:22:27,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1869 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=12998, Invalid=16414, Unknown=0, NotChecked=0, Total=29412 [2022-04-15 12:22:27,677 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1250 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:22:27,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1250 Valid, 42 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:22:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-04-15 12:22:28,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 136. [2022-04-15 12:22:28,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:22:28,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 408 states. Second operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:28,455 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:28,455 INFO L87 Difference]: Start difference. First operand 408 states. Second operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:28,461 INFO L93 Difference]: Finished difference Result 408 states and 520 transitions. [2022-04-15 12:22:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 520 transitions. [2022-04-15 12:22:28,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:28,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:28,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 408 states. [2022-04-15 12:22:28,461 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 408 states. [2022-04-15 12:22:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:28,467 INFO L93 Difference]: Finished difference Result 408 states and 520 transitions. [2022-04-15 12:22:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 520 transitions. [2022-04-15 12:22:28,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:28,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:28,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:22:28,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:22:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2022-04-15 12:22:28,469 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 133 [2022-04-15 12:22:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:22:28,469 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2022-04-15 12:22:28,469 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:28,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 140 transitions. [2022-04-15 12:22:28,804 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:22:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2022-04-15 12:22:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 12:22:28,805 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:22:28,805 INFO L499 BasicCegarLoop]: trace histogram [56, 56, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:22:28,824 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:22:29,005 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:22:29,005 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:22:29,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:22:29,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1590280243, now seen corresponding path program 113 times [2022-04-15 12:22:29,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:29,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [63480090] [2022-04-15 12:22:29,010 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:22:29,010 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:22:29,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1590280243, now seen corresponding path program 114 times [2022-04-15 12:22:29,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:29,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724403840] [2022-04-15 12:22:29,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:29,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:30,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:22:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:30,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {92375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {92313#true} is VALID [2022-04-15 12:22:30,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {92313#true} assume true; {92313#true} is VALID [2022-04-15 12:22:30,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {92313#true} {92313#true} #64#return; {92313#true} is VALID [2022-04-15 12:22:30,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {92313#true} call ULTIMATE.init(); {92375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:22:30,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {92375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {92313#true} is VALID [2022-04-15 12:22:30,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {92313#true} assume true; {92313#true} is VALID [2022-04-15 12:22:30,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92313#true} {92313#true} #64#return; {92313#true} is VALID [2022-04-15 12:22:30,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {92313#true} call #t~ret6 := main(); {92313#true} is VALID [2022-04-15 12:22:30,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {92313#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92318#(= main_~i~0 0)} is VALID [2022-04-15 12:22:30,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {92318#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92318#(= main_~i~0 0)} is VALID [2022-04-15 12:22:30,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {92318#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92319#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:30,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {92319#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92319#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:30,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {92319#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92320#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:30,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {92320#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92320#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:30,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {92320#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92321#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:30,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {92321#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92321#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:30,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {92321#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92322#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:30,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {92322#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92322#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:30,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {92322#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92323#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:30,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {92323#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92323#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:30,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {92323#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92324#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:30,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {92324#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92324#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:30,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {92324#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92325#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:30,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {92325#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92325#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:30,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {92325#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92326#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:30,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {92326#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92326#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:30,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {92326#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92327#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:30,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {92327#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92327#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:30,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {92327#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92328#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:30,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {92328#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92328#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:30,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {92328#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92329#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:30,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {92329#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92329#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:30,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {92329#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92330#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:30,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {92330#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92330#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:30,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {92330#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92331#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:30,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {92331#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92331#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:30,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {92331#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92332#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:30,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {92332#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92332#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:30,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {92332#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92333#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:30,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {92333#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92333#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:30,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {92333#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92334#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:30,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {92334#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92334#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:30,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {92334#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92335#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:30,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {92335#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92335#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:30,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {92335#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92336#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:30,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {92336#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92336#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:30,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {92336#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92337#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:30,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {92337#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92337#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:30,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {92337#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92338#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:30,106 INFO L290 TraceCheckUtils]: 46: Hoare triple {92338#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92338#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:30,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {92338#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92339#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:30,106 INFO L290 TraceCheckUtils]: 48: Hoare triple {92339#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92339#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:30,106 INFO L290 TraceCheckUtils]: 49: Hoare triple {92339#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92340#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:30,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {92340#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92340#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:30,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {92340#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92341#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:30,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {92341#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92341#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:30,108 INFO L290 TraceCheckUtils]: 53: Hoare triple {92341#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92342#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:30,108 INFO L290 TraceCheckUtils]: 54: Hoare triple {92342#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92342#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:30,108 INFO L290 TraceCheckUtils]: 55: Hoare triple {92342#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92343#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:30,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {92343#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92343#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:30,109 INFO L290 TraceCheckUtils]: 57: Hoare triple {92343#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:30,109 INFO L290 TraceCheckUtils]: 58: Hoare triple {92344#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92344#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:30,109 INFO L290 TraceCheckUtils]: 59: Hoare triple {92344#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92345#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:30,109 INFO L290 TraceCheckUtils]: 60: Hoare triple {92345#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92345#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:30,110 INFO L290 TraceCheckUtils]: 61: Hoare triple {92345#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92346#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:30,110 INFO L290 TraceCheckUtils]: 62: Hoare triple {92346#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92346#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:30,110 INFO L290 TraceCheckUtils]: 63: Hoare triple {92346#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92347#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:30,111 INFO L290 TraceCheckUtils]: 64: Hoare triple {92347#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92347#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:30,111 INFO L290 TraceCheckUtils]: 65: Hoare triple {92347#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92348#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:30,111 INFO L290 TraceCheckUtils]: 66: Hoare triple {92348#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92348#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:30,111 INFO L290 TraceCheckUtils]: 67: Hoare triple {92348#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92349#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:30,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {92349#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92349#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:30,112 INFO L290 TraceCheckUtils]: 69: Hoare triple {92349#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92350#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:30,112 INFO L290 TraceCheckUtils]: 70: Hoare triple {92350#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92350#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:30,113 INFO L290 TraceCheckUtils]: 71: Hoare triple {92350#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92351#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:30,113 INFO L290 TraceCheckUtils]: 72: Hoare triple {92351#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92351#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:30,113 INFO L290 TraceCheckUtils]: 73: Hoare triple {92351#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92352#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:30,113 INFO L290 TraceCheckUtils]: 74: Hoare triple {92352#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92352#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:30,114 INFO L290 TraceCheckUtils]: 75: Hoare triple {92352#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92353#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:30,114 INFO L290 TraceCheckUtils]: 76: Hoare triple {92353#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92353#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:30,114 INFO L290 TraceCheckUtils]: 77: Hoare triple {92353#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92354#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:30,114 INFO L290 TraceCheckUtils]: 78: Hoare triple {92354#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92354#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:30,115 INFO L290 TraceCheckUtils]: 79: Hoare triple {92354#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92355#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:30,115 INFO L290 TraceCheckUtils]: 80: Hoare triple {92355#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92355#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:30,115 INFO L290 TraceCheckUtils]: 81: Hoare triple {92355#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92356#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:30,116 INFO L290 TraceCheckUtils]: 82: Hoare triple {92356#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92356#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:30,116 INFO L290 TraceCheckUtils]: 83: Hoare triple {92356#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92357#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:30,116 INFO L290 TraceCheckUtils]: 84: Hoare triple {92357#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92357#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:30,116 INFO L290 TraceCheckUtils]: 85: Hoare triple {92357#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92358#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:30,117 INFO L290 TraceCheckUtils]: 86: Hoare triple {92358#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92358#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:30,117 INFO L290 TraceCheckUtils]: 87: Hoare triple {92358#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92359#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:30,117 INFO L290 TraceCheckUtils]: 88: Hoare triple {92359#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92359#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:30,117 INFO L290 TraceCheckUtils]: 89: Hoare triple {92359#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92360#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:30,118 INFO L290 TraceCheckUtils]: 90: Hoare triple {92360#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92360#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:30,118 INFO L290 TraceCheckUtils]: 91: Hoare triple {92360#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92361#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:30,118 INFO L290 TraceCheckUtils]: 92: Hoare triple {92361#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92361#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:30,119 INFO L290 TraceCheckUtils]: 93: Hoare triple {92361#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92362#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:30,119 INFO L290 TraceCheckUtils]: 94: Hoare triple {92362#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92362#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:30,119 INFO L290 TraceCheckUtils]: 95: Hoare triple {92362#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92363#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:30,119 INFO L290 TraceCheckUtils]: 96: Hoare triple {92363#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92363#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:30,120 INFO L290 TraceCheckUtils]: 97: Hoare triple {92363#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92364#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:30,120 INFO L290 TraceCheckUtils]: 98: Hoare triple {92364#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92364#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:30,120 INFO L290 TraceCheckUtils]: 99: Hoare triple {92364#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92365#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:30,120 INFO L290 TraceCheckUtils]: 100: Hoare triple {92365#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92365#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:30,121 INFO L290 TraceCheckUtils]: 101: Hoare triple {92365#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92366#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:30,121 INFO L290 TraceCheckUtils]: 102: Hoare triple {92366#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92366#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:30,121 INFO L290 TraceCheckUtils]: 103: Hoare triple {92366#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92367#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:30,122 INFO L290 TraceCheckUtils]: 104: Hoare triple {92367#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92367#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:30,122 INFO L290 TraceCheckUtils]: 105: Hoare triple {92367#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92368#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:30,122 INFO L290 TraceCheckUtils]: 106: Hoare triple {92368#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92368#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:30,122 INFO L290 TraceCheckUtils]: 107: Hoare triple {92368#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92369#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:30,123 INFO L290 TraceCheckUtils]: 108: Hoare triple {92369#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92369#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:30,123 INFO L290 TraceCheckUtils]: 109: Hoare triple {92369#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92370#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:30,123 INFO L290 TraceCheckUtils]: 110: Hoare triple {92370#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92370#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:30,124 INFO L290 TraceCheckUtils]: 111: Hoare triple {92370#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92371#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:30,124 INFO L290 TraceCheckUtils]: 112: Hoare triple {92371#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92371#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:30,124 INFO L290 TraceCheckUtils]: 113: Hoare triple {92371#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92372#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:30,124 INFO L290 TraceCheckUtils]: 114: Hoare triple {92372#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92372#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:30,125 INFO L290 TraceCheckUtils]: 115: Hoare triple {92372#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92373#(<= main_~i~0 55)} is VALID [2022-04-15 12:22:30,125 INFO L290 TraceCheckUtils]: 116: Hoare triple {92373#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92373#(<= main_~i~0 55)} is VALID [2022-04-15 12:22:30,125 INFO L290 TraceCheckUtils]: 117: Hoare triple {92373#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92374#(<= main_~i~0 56)} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 118: Hoare triple {92374#(<= main_~i~0 56)} assume !(~i~0 < 1024); {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 119: Hoare triple {92314#false} ~i~0 := 0; {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 120: Hoare triple {92314#false} #t~short5 := ~i~0 < 1024; {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 121: Hoare triple {92314#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 122: Hoare triple {92314#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 123: Hoare triple {92314#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 124: Hoare triple {92314#false} #t~short5 := ~i~0 < 1024; {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 125: Hoare triple {92314#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 126: Hoare triple {92314#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 127: Hoare triple {92314#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 128: Hoare triple {92314#false} #t~short5 := ~i~0 < 1024; {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 129: Hoare triple {92314#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 130: Hoare triple {92314#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L272 TraceCheckUtils]: 131: Hoare triple {92314#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 132: Hoare triple {92314#false} ~cond := #in~cond; {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 133: Hoare triple {92314#false} assume 0 == ~cond; {92314#false} is VALID [2022-04-15 12:22:30,126 INFO L290 TraceCheckUtils]: 134: Hoare triple {92314#false} assume !false; {92314#false} is VALID [2022-04-15 12:22:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3146 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:22:30,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:22:30,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724403840] [2022-04-15 12:22:30,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724403840] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:22:30,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388442135] [2022-04-15 12:22:30,127 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:22:30,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:22:30,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:22:30,128 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:22:30,129 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:22:30,446 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:22:30,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:22:30,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:22:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:30,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:22:30,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {92313#true} call ULTIMATE.init(); {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {92313#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {92313#true} assume true; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92313#true} {92313#true} #64#return; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {92313#true} call #t~ret6 := main(); {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {92313#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 36: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 37: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 54: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 55: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 56: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 57: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 58: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,740 INFO L290 TraceCheckUtils]: 59: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 60: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 61: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 62: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 63: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 64: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 65: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 66: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 67: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 68: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 69: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 70: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 71: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 72: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 73: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 74: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 75: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 76: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 77: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 78: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,741 INFO L290 TraceCheckUtils]: 79: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 80: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 81: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 82: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 83: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 84: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 85: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 86: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 87: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 88: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 89: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 90: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 91: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 92: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 93: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 94: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 95: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 96: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 97: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,742 INFO L290 TraceCheckUtils]: 98: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 99: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 100: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 101: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 102: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 103: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 104: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 105: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 106: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 107: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 108: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 109: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 110: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 111: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 112: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 113: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 114: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 115: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 116: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 117: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:30,743 INFO L290 TraceCheckUtils]: 118: Hoare triple {92313#true} assume !(~i~0 < 1024); {92313#true} is VALID [2022-04-15 12:22:30,744 INFO L290 TraceCheckUtils]: 119: Hoare triple {92313#true} ~i~0 := 0; {92736#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:30,744 INFO L290 TraceCheckUtils]: 120: Hoare triple {92736#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {92736#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:30,744 INFO L290 TraceCheckUtils]: 121: Hoare triple {92736#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92736#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:30,745 INFO L290 TraceCheckUtils]: 122: Hoare triple {92736#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92736#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:30,745 INFO L290 TraceCheckUtils]: 123: Hoare triple {92736#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92319#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:30,745 INFO L290 TraceCheckUtils]: 124: Hoare triple {92319#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {92319#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:30,745 INFO L290 TraceCheckUtils]: 125: Hoare triple {92319#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92319#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:30,746 INFO L290 TraceCheckUtils]: 126: Hoare triple {92319#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92319#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:30,746 INFO L290 TraceCheckUtils]: 127: Hoare triple {92319#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92320#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:30,746 INFO L290 TraceCheckUtils]: 128: Hoare triple {92320#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {92320#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:30,746 INFO L290 TraceCheckUtils]: 129: Hoare triple {92320#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92320#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:30,747 INFO L290 TraceCheckUtils]: 130: Hoare triple {92320#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {92320#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:30,747 INFO L272 TraceCheckUtils]: 131: Hoare triple {92320#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {92773#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:22:30,747 INFO L290 TraceCheckUtils]: 132: Hoare triple {92773#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {92777#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:22:30,748 INFO L290 TraceCheckUtils]: 133: Hoare triple {92777#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {92314#false} is VALID [2022-04-15 12:22:30,748 INFO L290 TraceCheckUtils]: 134: Hoare triple {92314#false} assume !false; {92314#false} is VALID [2022-04-15 12:22:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3146 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2022-04-15 12:22:30,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:22:31,051 INFO L290 TraceCheckUtils]: 134: Hoare triple {92314#false} assume !false; {92314#false} is VALID [2022-04-15 12:22:31,052 INFO L290 TraceCheckUtils]: 133: Hoare triple {92777#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {92314#false} is VALID [2022-04-15 12:22:31,052 INFO L290 TraceCheckUtils]: 132: Hoare triple {92773#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {92777#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:22:31,052 INFO L272 TraceCheckUtils]: 131: Hoare triple {92793#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {92773#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:22:31,053 INFO L290 TraceCheckUtils]: 130: Hoare triple {92793#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {92793#(<= main_~i~0 512)} is VALID [2022-04-15 12:22:31,053 INFO L290 TraceCheckUtils]: 129: Hoare triple {92793#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92793#(<= main_~i~0 512)} is VALID [2022-04-15 12:22:31,053 INFO L290 TraceCheckUtils]: 128: Hoare triple {92793#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {92793#(<= main_~i~0 512)} is VALID [2022-04-15 12:22:31,053 INFO L290 TraceCheckUtils]: 127: Hoare triple {92806#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92793#(<= main_~i~0 512)} is VALID [2022-04-15 12:22:31,054 INFO L290 TraceCheckUtils]: 126: Hoare triple {92806#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92806#(<= main_~i~0 511)} is VALID [2022-04-15 12:22:31,054 INFO L290 TraceCheckUtils]: 125: Hoare triple {92806#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92806#(<= main_~i~0 511)} is VALID [2022-04-15 12:22:31,054 INFO L290 TraceCheckUtils]: 124: Hoare triple {92806#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {92806#(<= main_~i~0 511)} is VALID [2022-04-15 12:22:31,054 INFO L290 TraceCheckUtils]: 123: Hoare triple {92819#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92806#(<= main_~i~0 511)} is VALID [2022-04-15 12:22:31,055 INFO L290 TraceCheckUtils]: 122: Hoare triple {92819#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92819#(<= main_~i~0 510)} is VALID [2022-04-15 12:22:31,055 INFO L290 TraceCheckUtils]: 121: Hoare triple {92819#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92819#(<= main_~i~0 510)} is VALID [2022-04-15 12:22:31,055 INFO L290 TraceCheckUtils]: 120: Hoare triple {92819#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {92819#(<= main_~i~0 510)} is VALID [2022-04-15 12:22:31,055 INFO L290 TraceCheckUtils]: 119: Hoare triple {92313#true} ~i~0 := 0; {92819#(<= main_~i~0 510)} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 118: Hoare triple {92313#true} assume !(~i~0 < 1024); {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 117: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 116: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 115: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 114: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 113: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 112: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 111: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 110: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 109: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 108: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 107: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 106: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 105: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 104: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 103: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 102: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 101: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 100: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 99: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 98: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 97: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 96: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 95: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 94: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 93: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 92: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 91: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 90: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 89: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 88: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 87: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 86: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 85: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 84: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 83: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 82: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 81: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 80: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 79: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 78: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 77: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 76: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 75: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 74: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 73: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 72: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 71: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 70: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 69: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 68: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 67: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 66: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 65: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 63: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 62: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 61: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 60: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 55: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 54: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 52: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 51: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 47: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 45: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 43: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 42: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 41: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {92313#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {92313#true} call #t~ret6 := main(); {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92313#true} {92313#true} #64#return; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {92313#true} assume true; {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {92313#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {92313#true} is VALID [2022-04-15 12:22:31,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {92313#true} call ULTIMATE.init(); {92313#true} is VALID [2022-04-15 12:22:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3146 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2022-04-15 12:22:31,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388442135] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:22:31,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:22:31,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 7, 7] total 66 [2022-04-15 12:22:31,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:22:31,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [63480090] [2022-04-15 12:22:31,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [63480090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:31,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:31,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-15 12:22:31,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936597786] [2022-04-15 12:22:31,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:22:31,063 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2022-04-15 12:22:31,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:22:31,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:31,136 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:22:31,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-15 12:22:31,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:31,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-15 12:22:31,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=2331, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 12:22:31,138 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:43,657 INFO L93 Difference]: Finished difference Result 432 states and 550 transitions. [2022-04-15 12:22:43,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-15 12:22:43,657 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2022-04-15 12:22:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:22:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 541 transitions. [2022-04-15 12:22:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 541 transitions. [2022-04-15 12:22:43,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 541 transitions. [2022-04-15 12:22:43,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:44,004 INFO L225 Difference]: With dead ends: 432 [2022-04-15 12:22:44,004 INFO L226 Difference]: Without dead ends: 415 [2022-04-15 12:22:44,005 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=5551, Invalid=9455, Unknown=0, NotChecked=0, Total=15006 [2022-04-15 12:22:44,005 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1483 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:22:44,005 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1483 Valid, 42 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:22:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-04-15 12:22:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 138. [2022-04-15 12:22:44,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:22:44,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 415 states. Second operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:44,792 INFO L74 IsIncluded]: Start isIncluded. First operand 415 states. Second operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:44,792 INFO L87 Difference]: Start difference. First operand 415 states. Second operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:44,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:44,798 INFO L93 Difference]: Finished difference Result 415 states and 529 transitions. [2022-04-15 12:22:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 529 transitions. [2022-04-15 12:22:44,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:44,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:44,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 415 states. [2022-04-15 12:22:44,799 INFO L87 Difference]: Start difference. First operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 415 states. [2022-04-15 12:22:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:44,805 INFO L93 Difference]: Finished difference Result 415 states and 529 transitions. [2022-04-15 12:22:44,805 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 529 transitions. [2022-04-15 12:22:44,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:44,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:44,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:22:44,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:22:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 142 transitions. [2022-04-15 12:22:44,807 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 142 transitions. Word has length 135 [2022-04-15 12:22:44,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:22:44,807 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 142 transitions. [2022-04-15 12:22:44,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:44,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 142 transitions. [2022-04-15 12:22:45,145 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:22:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2022-04-15 12:22:45,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-15 12:22:45,146 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:22:45,146 INFO L499 BasicCegarLoop]: trace histogram [57, 57, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:22:45,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-15 12:22:45,346 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:22:45,346 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:22:45,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:22:45,346 INFO L85 PathProgramCache]: Analyzing trace with hash 134092779, now seen corresponding path program 115 times [2022-04-15 12:22:45,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:45,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1484171387] [2022-04-15 12:22:45,350 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:22:45,351 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:22:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash 134092779, now seen corresponding path program 116 times [2022-04-15 12:22:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:45,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977184446] [2022-04-15 12:22:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:45,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:46,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:22:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:46,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {95338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {95275#true} is VALID [2022-04-15 12:22:46,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {95275#true} assume true; {95275#true} is VALID [2022-04-15 12:22:46,447 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95275#true} {95275#true} #64#return; {95275#true} is VALID [2022-04-15 12:22:46,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {95275#true} call ULTIMATE.init(); {95338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:22:46,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {95338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {95275#true} is VALID [2022-04-15 12:22:46,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {95275#true} assume true; {95275#true} is VALID [2022-04-15 12:22:46,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95275#true} {95275#true} #64#return; {95275#true} is VALID [2022-04-15 12:22:46,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {95275#true} call #t~ret6 := main(); {95275#true} is VALID [2022-04-15 12:22:46,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {95275#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {95280#(= main_~i~0 0)} is VALID [2022-04-15 12:22:46,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {95280#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95280#(= main_~i~0 0)} is VALID [2022-04-15 12:22:46,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {95280#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95281#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:46,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {95281#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95281#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:46,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {95281#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95282#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:46,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {95282#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95282#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:46,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {95282#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95283#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:46,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {95283#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95283#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:46,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {95283#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95284#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:46,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {95284#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95284#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:46,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {95284#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95285#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:46,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {95285#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95285#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:46,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {95285#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95286#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:46,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {95286#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95286#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:46,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {95286#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95287#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:46,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {95287#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95287#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:46,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {95287#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95288#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:46,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {95288#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95288#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:46,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {95288#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95289#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:46,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {95289#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95289#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:46,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {95289#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95290#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:46,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {95290#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95290#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:46,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {95290#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95291#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:46,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {95291#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95291#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:46,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {95291#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95292#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:46,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {95292#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95292#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:46,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {95292#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95293#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:46,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {95293#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95293#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:46,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {95293#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95294#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:46,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {95294#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95294#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:46,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {95294#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95295#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:46,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {95295#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95295#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:46,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {95295#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95296#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:46,456 INFO L290 TraceCheckUtils]: 38: Hoare triple {95296#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95296#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:46,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {95296#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95297#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:46,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {95297#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95297#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:46,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {95297#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95298#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:46,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {95298#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95298#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:46,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {95298#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95299#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:46,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {95299#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95299#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:46,458 INFO L290 TraceCheckUtils]: 45: Hoare triple {95299#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95300#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:46,458 INFO L290 TraceCheckUtils]: 46: Hoare triple {95300#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95300#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:46,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {95300#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95301#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:46,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {95301#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95301#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:46,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {95301#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95302#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:46,460 INFO L290 TraceCheckUtils]: 50: Hoare triple {95302#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95302#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:46,460 INFO L290 TraceCheckUtils]: 51: Hoare triple {95302#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95303#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:46,460 INFO L290 TraceCheckUtils]: 52: Hoare triple {95303#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95303#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:46,460 INFO L290 TraceCheckUtils]: 53: Hoare triple {95303#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95304#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:46,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {95304#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95304#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:46,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {95304#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95305#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:46,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {95305#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95305#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:46,461 INFO L290 TraceCheckUtils]: 57: Hoare triple {95305#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95306#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:46,462 INFO L290 TraceCheckUtils]: 58: Hoare triple {95306#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95306#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:46,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {95306#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95307#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:46,462 INFO L290 TraceCheckUtils]: 60: Hoare triple {95307#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95307#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:46,463 INFO L290 TraceCheckUtils]: 61: Hoare triple {95307#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95308#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:46,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {95308#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95308#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:46,463 INFO L290 TraceCheckUtils]: 63: Hoare triple {95308#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95309#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:46,463 INFO L290 TraceCheckUtils]: 64: Hoare triple {95309#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95309#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:46,464 INFO L290 TraceCheckUtils]: 65: Hoare triple {95309#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95310#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:46,464 INFO L290 TraceCheckUtils]: 66: Hoare triple {95310#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95310#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:46,464 INFO L290 TraceCheckUtils]: 67: Hoare triple {95310#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95311#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:46,464 INFO L290 TraceCheckUtils]: 68: Hoare triple {95311#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95311#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:46,465 INFO L290 TraceCheckUtils]: 69: Hoare triple {95311#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95312#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:46,465 INFO L290 TraceCheckUtils]: 70: Hoare triple {95312#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95312#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:46,465 INFO L290 TraceCheckUtils]: 71: Hoare triple {95312#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95313#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:46,465 INFO L290 TraceCheckUtils]: 72: Hoare triple {95313#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95313#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:46,466 INFO L290 TraceCheckUtils]: 73: Hoare triple {95313#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95314#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:46,466 INFO L290 TraceCheckUtils]: 74: Hoare triple {95314#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95314#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:46,466 INFO L290 TraceCheckUtils]: 75: Hoare triple {95314#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95315#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:46,467 INFO L290 TraceCheckUtils]: 76: Hoare triple {95315#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95315#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:46,467 INFO L290 TraceCheckUtils]: 77: Hoare triple {95315#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95316#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:46,467 INFO L290 TraceCheckUtils]: 78: Hoare triple {95316#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95316#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:46,468 INFO L290 TraceCheckUtils]: 79: Hoare triple {95316#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95317#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:46,468 INFO L290 TraceCheckUtils]: 80: Hoare triple {95317#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95317#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:46,468 INFO L290 TraceCheckUtils]: 81: Hoare triple {95317#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95318#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:46,468 INFO L290 TraceCheckUtils]: 82: Hoare triple {95318#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95318#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:46,469 INFO L290 TraceCheckUtils]: 83: Hoare triple {95318#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95319#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:46,469 INFO L290 TraceCheckUtils]: 84: Hoare triple {95319#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95319#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:46,469 INFO L290 TraceCheckUtils]: 85: Hoare triple {95319#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95320#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:46,469 INFO L290 TraceCheckUtils]: 86: Hoare triple {95320#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95320#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:46,470 INFO L290 TraceCheckUtils]: 87: Hoare triple {95320#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95321#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:46,470 INFO L290 TraceCheckUtils]: 88: Hoare triple {95321#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95321#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:46,470 INFO L290 TraceCheckUtils]: 89: Hoare triple {95321#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95322#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:46,470 INFO L290 TraceCheckUtils]: 90: Hoare triple {95322#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95322#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:46,471 INFO L290 TraceCheckUtils]: 91: Hoare triple {95322#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95323#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:46,471 INFO L290 TraceCheckUtils]: 92: Hoare triple {95323#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95323#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:46,471 INFO L290 TraceCheckUtils]: 93: Hoare triple {95323#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95324#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:46,472 INFO L290 TraceCheckUtils]: 94: Hoare triple {95324#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95324#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:46,472 INFO L290 TraceCheckUtils]: 95: Hoare triple {95324#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95325#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:46,472 INFO L290 TraceCheckUtils]: 96: Hoare triple {95325#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95325#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:46,472 INFO L290 TraceCheckUtils]: 97: Hoare triple {95325#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95326#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:46,473 INFO L290 TraceCheckUtils]: 98: Hoare triple {95326#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95326#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:46,473 INFO L290 TraceCheckUtils]: 99: Hoare triple {95326#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95327#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:46,473 INFO L290 TraceCheckUtils]: 100: Hoare triple {95327#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95327#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:46,473 INFO L290 TraceCheckUtils]: 101: Hoare triple {95327#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95328#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:46,474 INFO L290 TraceCheckUtils]: 102: Hoare triple {95328#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95328#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:46,474 INFO L290 TraceCheckUtils]: 103: Hoare triple {95328#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95329#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:46,474 INFO L290 TraceCheckUtils]: 104: Hoare triple {95329#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95329#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:46,475 INFO L290 TraceCheckUtils]: 105: Hoare triple {95329#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95330#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:46,475 INFO L290 TraceCheckUtils]: 106: Hoare triple {95330#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95330#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:46,475 INFO L290 TraceCheckUtils]: 107: Hoare triple {95330#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95331#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:46,475 INFO L290 TraceCheckUtils]: 108: Hoare triple {95331#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95331#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:46,476 INFO L290 TraceCheckUtils]: 109: Hoare triple {95331#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95332#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:46,476 INFO L290 TraceCheckUtils]: 110: Hoare triple {95332#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95332#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:46,476 INFO L290 TraceCheckUtils]: 111: Hoare triple {95332#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95333#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:46,476 INFO L290 TraceCheckUtils]: 112: Hoare triple {95333#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95333#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:46,477 INFO L290 TraceCheckUtils]: 113: Hoare triple {95333#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95334#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:46,477 INFO L290 TraceCheckUtils]: 114: Hoare triple {95334#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95334#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:46,477 INFO L290 TraceCheckUtils]: 115: Hoare triple {95334#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95335#(<= main_~i~0 55)} is VALID [2022-04-15 12:22:46,478 INFO L290 TraceCheckUtils]: 116: Hoare triple {95335#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95335#(<= main_~i~0 55)} is VALID [2022-04-15 12:22:46,478 INFO L290 TraceCheckUtils]: 117: Hoare triple {95335#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95336#(<= main_~i~0 56)} is VALID [2022-04-15 12:22:46,478 INFO L290 TraceCheckUtils]: 118: Hoare triple {95336#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95336#(<= main_~i~0 56)} is VALID [2022-04-15 12:22:46,478 INFO L290 TraceCheckUtils]: 119: Hoare triple {95336#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95337#(<= main_~i~0 57)} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 120: Hoare triple {95337#(<= main_~i~0 57)} assume !(~i~0 < 1024); {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 121: Hoare triple {95276#false} ~i~0 := 0; {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 122: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 123: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 124: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 125: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 126: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 127: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 128: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 129: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 130: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 131: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 132: Hoare triple {95276#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L272 TraceCheckUtils]: 133: Hoare triple {95276#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 134: Hoare triple {95276#false} ~cond := #in~cond; {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 135: Hoare triple {95276#false} assume 0 == ~cond; {95276#false} is VALID [2022-04-15 12:22:46,479 INFO L290 TraceCheckUtils]: 136: Hoare triple {95276#false} assume !false; {95276#false} is VALID [2022-04-15 12:22:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3259 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:22:46,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:22:46,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977184446] [2022-04-15 12:22:46,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977184446] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:22:46,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754302142] [2022-04-15 12:22:46,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:22:46,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:22:46,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:22:46,481 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:22:46,482 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:22:46,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:22:46,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:22:46,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 12:22:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:46,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:22:47,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {95275#true} call ULTIMATE.init(); {95275#true} is VALID [2022-04-15 12:22:47,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {95275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {95275#true} is VALID [2022-04-15 12:22:47,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {95275#true} assume true; {95275#true} is VALID [2022-04-15 12:22:47,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95275#true} {95275#true} #64#return; {95275#true} is VALID [2022-04-15 12:22:47,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {95275#true} call #t~ret6 := main(); {95275#true} is VALID [2022-04-15 12:22:47,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {95275#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {95357#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:47,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {95357#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95357#(<= main_~i~0 0)} is VALID [2022-04-15 12:22:47,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {95357#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95281#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:47,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {95281#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95281#(<= main_~i~0 1)} is VALID [2022-04-15 12:22:47,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {95281#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95282#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:47,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {95282#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95282#(<= main_~i~0 2)} is VALID [2022-04-15 12:22:47,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {95282#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95283#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:47,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {95283#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95283#(<= main_~i~0 3)} is VALID [2022-04-15 12:22:47,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {95283#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95284#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:47,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {95284#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95284#(<= main_~i~0 4)} is VALID [2022-04-15 12:22:47,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {95284#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95285#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:47,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {95285#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95285#(<= main_~i~0 5)} is VALID [2022-04-15 12:22:47,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {95285#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95286#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:47,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {95286#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95286#(<= main_~i~0 6)} is VALID [2022-04-15 12:22:47,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {95286#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95287#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:47,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {95287#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95287#(<= main_~i~0 7)} is VALID [2022-04-15 12:22:47,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {95287#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95288#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:47,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {95288#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95288#(<= main_~i~0 8)} is VALID [2022-04-15 12:22:47,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {95288#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95289#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:47,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {95289#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95289#(<= main_~i~0 9)} is VALID [2022-04-15 12:22:47,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {95289#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95290#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:47,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {95290#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95290#(<= main_~i~0 10)} is VALID [2022-04-15 12:22:47,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {95290#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95291#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:47,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {95291#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95291#(<= main_~i~0 11)} is VALID [2022-04-15 12:22:47,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {95291#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95292#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:47,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {95292#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95292#(<= main_~i~0 12)} is VALID [2022-04-15 12:22:47,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {95292#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95293#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:47,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {95293#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95293#(<= main_~i~0 13)} is VALID [2022-04-15 12:22:47,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {95293#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95294#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:47,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {95294#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95294#(<= main_~i~0 14)} is VALID [2022-04-15 12:22:47,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {95294#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95295#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:47,481 INFO L290 TraceCheckUtils]: 36: Hoare triple {95295#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95295#(<= main_~i~0 15)} is VALID [2022-04-15 12:22:47,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {95295#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95296#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:47,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {95296#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95296#(<= main_~i~0 16)} is VALID [2022-04-15 12:22:47,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {95296#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95297#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:47,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {95297#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95297#(<= main_~i~0 17)} is VALID [2022-04-15 12:22:47,483 INFO L290 TraceCheckUtils]: 41: Hoare triple {95297#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95298#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:47,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {95298#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95298#(<= main_~i~0 18)} is VALID [2022-04-15 12:22:47,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {95298#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95299#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:47,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {95299#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95299#(<= main_~i~0 19)} is VALID [2022-04-15 12:22:47,484 INFO L290 TraceCheckUtils]: 45: Hoare triple {95299#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95300#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:47,484 INFO L290 TraceCheckUtils]: 46: Hoare triple {95300#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95300#(<= main_~i~0 20)} is VALID [2022-04-15 12:22:47,484 INFO L290 TraceCheckUtils]: 47: Hoare triple {95300#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95301#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:47,485 INFO L290 TraceCheckUtils]: 48: Hoare triple {95301#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95301#(<= main_~i~0 21)} is VALID [2022-04-15 12:22:47,485 INFO L290 TraceCheckUtils]: 49: Hoare triple {95301#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95302#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:47,485 INFO L290 TraceCheckUtils]: 50: Hoare triple {95302#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95302#(<= main_~i~0 22)} is VALID [2022-04-15 12:22:47,485 INFO L290 TraceCheckUtils]: 51: Hoare triple {95302#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95303#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:47,486 INFO L290 TraceCheckUtils]: 52: Hoare triple {95303#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95303#(<= main_~i~0 23)} is VALID [2022-04-15 12:22:47,486 INFO L290 TraceCheckUtils]: 53: Hoare triple {95303#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95304#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:47,486 INFO L290 TraceCheckUtils]: 54: Hoare triple {95304#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95304#(<= main_~i~0 24)} is VALID [2022-04-15 12:22:47,486 INFO L290 TraceCheckUtils]: 55: Hoare triple {95304#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95305#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:47,487 INFO L290 TraceCheckUtils]: 56: Hoare triple {95305#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95305#(<= main_~i~0 25)} is VALID [2022-04-15 12:22:47,487 INFO L290 TraceCheckUtils]: 57: Hoare triple {95305#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95306#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:47,487 INFO L290 TraceCheckUtils]: 58: Hoare triple {95306#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95306#(<= main_~i~0 26)} is VALID [2022-04-15 12:22:47,488 INFO L290 TraceCheckUtils]: 59: Hoare triple {95306#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95307#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:47,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {95307#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95307#(<= main_~i~0 27)} is VALID [2022-04-15 12:22:47,488 INFO L290 TraceCheckUtils]: 61: Hoare triple {95307#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95308#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:47,488 INFO L290 TraceCheckUtils]: 62: Hoare triple {95308#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95308#(<= main_~i~0 28)} is VALID [2022-04-15 12:22:47,489 INFO L290 TraceCheckUtils]: 63: Hoare triple {95308#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95309#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:47,489 INFO L290 TraceCheckUtils]: 64: Hoare triple {95309#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95309#(<= main_~i~0 29)} is VALID [2022-04-15 12:22:47,489 INFO L290 TraceCheckUtils]: 65: Hoare triple {95309#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95310#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:47,489 INFO L290 TraceCheckUtils]: 66: Hoare triple {95310#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95310#(<= main_~i~0 30)} is VALID [2022-04-15 12:22:47,490 INFO L290 TraceCheckUtils]: 67: Hoare triple {95310#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95311#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:47,490 INFO L290 TraceCheckUtils]: 68: Hoare triple {95311#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95311#(<= main_~i~0 31)} is VALID [2022-04-15 12:22:47,490 INFO L290 TraceCheckUtils]: 69: Hoare triple {95311#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95312#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:47,491 INFO L290 TraceCheckUtils]: 70: Hoare triple {95312#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95312#(<= main_~i~0 32)} is VALID [2022-04-15 12:22:47,491 INFO L290 TraceCheckUtils]: 71: Hoare triple {95312#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95313#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:47,491 INFO L290 TraceCheckUtils]: 72: Hoare triple {95313#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95313#(<= main_~i~0 33)} is VALID [2022-04-15 12:22:47,491 INFO L290 TraceCheckUtils]: 73: Hoare triple {95313#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95314#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:47,492 INFO L290 TraceCheckUtils]: 74: Hoare triple {95314#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95314#(<= main_~i~0 34)} is VALID [2022-04-15 12:22:47,492 INFO L290 TraceCheckUtils]: 75: Hoare triple {95314#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95315#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:47,492 INFO L290 TraceCheckUtils]: 76: Hoare triple {95315#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95315#(<= main_~i~0 35)} is VALID [2022-04-15 12:22:47,493 INFO L290 TraceCheckUtils]: 77: Hoare triple {95315#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95316#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:47,493 INFO L290 TraceCheckUtils]: 78: Hoare triple {95316#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95316#(<= main_~i~0 36)} is VALID [2022-04-15 12:22:47,493 INFO L290 TraceCheckUtils]: 79: Hoare triple {95316#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95317#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:47,493 INFO L290 TraceCheckUtils]: 80: Hoare triple {95317#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95317#(<= main_~i~0 37)} is VALID [2022-04-15 12:22:47,494 INFO L290 TraceCheckUtils]: 81: Hoare triple {95317#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95318#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:47,494 INFO L290 TraceCheckUtils]: 82: Hoare triple {95318#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95318#(<= main_~i~0 38)} is VALID [2022-04-15 12:22:47,494 INFO L290 TraceCheckUtils]: 83: Hoare triple {95318#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95319#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:47,494 INFO L290 TraceCheckUtils]: 84: Hoare triple {95319#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95319#(<= main_~i~0 39)} is VALID [2022-04-15 12:22:47,495 INFO L290 TraceCheckUtils]: 85: Hoare triple {95319#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95320#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:47,495 INFO L290 TraceCheckUtils]: 86: Hoare triple {95320#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95320#(<= main_~i~0 40)} is VALID [2022-04-15 12:22:47,495 INFO L290 TraceCheckUtils]: 87: Hoare triple {95320#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95321#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:47,495 INFO L290 TraceCheckUtils]: 88: Hoare triple {95321#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95321#(<= main_~i~0 41)} is VALID [2022-04-15 12:22:47,496 INFO L290 TraceCheckUtils]: 89: Hoare triple {95321#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95322#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:47,496 INFO L290 TraceCheckUtils]: 90: Hoare triple {95322#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95322#(<= main_~i~0 42)} is VALID [2022-04-15 12:22:47,496 INFO L290 TraceCheckUtils]: 91: Hoare triple {95322#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95323#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:47,497 INFO L290 TraceCheckUtils]: 92: Hoare triple {95323#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95323#(<= main_~i~0 43)} is VALID [2022-04-15 12:22:47,497 INFO L290 TraceCheckUtils]: 93: Hoare triple {95323#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95324#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:47,497 INFO L290 TraceCheckUtils]: 94: Hoare triple {95324#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95324#(<= main_~i~0 44)} is VALID [2022-04-15 12:22:47,497 INFO L290 TraceCheckUtils]: 95: Hoare triple {95324#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95325#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:47,498 INFO L290 TraceCheckUtils]: 96: Hoare triple {95325#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95325#(<= main_~i~0 45)} is VALID [2022-04-15 12:22:47,498 INFO L290 TraceCheckUtils]: 97: Hoare triple {95325#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95326#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:47,498 INFO L290 TraceCheckUtils]: 98: Hoare triple {95326#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95326#(<= main_~i~0 46)} is VALID [2022-04-15 12:22:47,498 INFO L290 TraceCheckUtils]: 99: Hoare triple {95326#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95327#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:47,499 INFO L290 TraceCheckUtils]: 100: Hoare triple {95327#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95327#(<= main_~i~0 47)} is VALID [2022-04-15 12:22:47,499 INFO L290 TraceCheckUtils]: 101: Hoare triple {95327#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95328#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:47,499 INFO L290 TraceCheckUtils]: 102: Hoare triple {95328#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95328#(<= main_~i~0 48)} is VALID [2022-04-15 12:22:47,500 INFO L290 TraceCheckUtils]: 103: Hoare triple {95328#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95329#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:47,500 INFO L290 TraceCheckUtils]: 104: Hoare triple {95329#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95329#(<= main_~i~0 49)} is VALID [2022-04-15 12:22:47,500 INFO L290 TraceCheckUtils]: 105: Hoare triple {95329#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95330#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:47,500 INFO L290 TraceCheckUtils]: 106: Hoare triple {95330#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95330#(<= main_~i~0 50)} is VALID [2022-04-15 12:22:47,501 INFO L290 TraceCheckUtils]: 107: Hoare triple {95330#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95331#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:47,501 INFO L290 TraceCheckUtils]: 108: Hoare triple {95331#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95331#(<= main_~i~0 51)} is VALID [2022-04-15 12:22:47,501 INFO L290 TraceCheckUtils]: 109: Hoare triple {95331#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95332#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:47,501 INFO L290 TraceCheckUtils]: 110: Hoare triple {95332#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95332#(<= main_~i~0 52)} is VALID [2022-04-15 12:22:47,502 INFO L290 TraceCheckUtils]: 111: Hoare triple {95332#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95333#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:47,502 INFO L290 TraceCheckUtils]: 112: Hoare triple {95333#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95333#(<= main_~i~0 53)} is VALID [2022-04-15 12:22:47,502 INFO L290 TraceCheckUtils]: 113: Hoare triple {95333#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95334#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:47,503 INFO L290 TraceCheckUtils]: 114: Hoare triple {95334#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95334#(<= main_~i~0 54)} is VALID [2022-04-15 12:22:47,503 INFO L290 TraceCheckUtils]: 115: Hoare triple {95334#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95335#(<= main_~i~0 55)} is VALID [2022-04-15 12:22:47,503 INFO L290 TraceCheckUtils]: 116: Hoare triple {95335#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95335#(<= main_~i~0 55)} is VALID [2022-04-15 12:22:47,503 INFO L290 TraceCheckUtils]: 117: Hoare triple {95335#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95336#(<= main_~i~0 56)} is VALID [2022-04-15 12:22:47,504 INFO L290 TraceCheckUtils]: 118: Hoare triple {95336#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95336#(<= main_~i~0 56)} is VALID [2022-04-15 12:22:47,504 INFO L290 TraceCheckUtils]: 119: Hoare triple {95336#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95337#(<= main_~i~0 57)} is VALID [2022-04-15 12:22:47,504 INFO L290 TraceCheckUtils]: 120: Hoare triple {95337#(<= main_~i~0 57)} assume !(~i~0 < 1024); {95276#false} is VALID [2022-04-15 12:22:47,504 INFO L290 TraceCheckUtils]: 121: Hoare triple {95276#false} ~i~0 := 0; {95276#false} is VALID [2022-04-15 12:22:47,504 INFO L290 TraceCheckUtils]: 122: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 12:22:47,504 INFO L290 TraceCheckUtils]: 123: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 12:22:47,504 INFO L290 TraceCheckUtils]: 124: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 12:22:47,505 INFO L290 TraceCheckUtils]: 125: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-15 12:22:47,505 INFO L290 TraceCheckUtils]: 126: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 12:22:47,505 INFO L290 TraceCheckUtils]: 127: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 12:22:47,505 INFO L290 TraceCheckUtils]: 128: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 12:22:47,505 INFO L290 TraceCheckUtils]: 129: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-15 12:22:47,505 INFO L290 TraceCheckUtils]: 130: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 12:22:47,505 INFO L290 TraceCheckUtils]: 131: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 12:22:47,505 INFO L290 TraceCheckUtils]: 132: Hoare triple {95276#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 12:22:47,505 INFO L272 TraceCheckUtils]: 133: Hoare triple {95276#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {95276#false} is VALID [2022-04-15 12:22:47,505 INFO L290 TraceCheckUtils]: 134: Hoare triple {95276#false} ~cond := #in~cond; {95276#false} is VALID [2022-04-15 12:22:47,505 INFO L290 TraceCheckUtils]: 135: Hoare triple {95276#false} assume 0 == ~cond; {95276#false} is VALID [2022-04-15 12:22:47,505 INFO L290 TraceCheckUtils]: 136: Hoare triple {95276#false} assume !false; {95276#false} is VALID [2022-04-15 12:22:47,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3259 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:22:47,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:22:50,868 INFO L290 TraceCheckUtils]: 136: Hoare triple {95276#false} assume !false; {95276#false} is VALID [2022-04-15 12:22:50,868 INFO L290 TraceCheckUtils]: 135: Hoare triple {95276#false} assume 0 == ~cond; {95276#false} is VALID [2022-04-15 12:22:50,868 INFO L290 TraceCheckUtils]: 134: Hoare triple {95276#false} ~cond := #in~cond; {95276#false} is VALID [2022-04-15 12:22:50,868 INFO L272 TraceCheckUtils]: 133: Hoare triple {95276#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {95276#false} is VALID [2022-04-15 12:22:50,868 INFO L290 TraceCheckUtils]: 132: Hoare triple {95276#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 12:22:50,868 INFO L290 TraceCheckUtils]: 131: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 12:22:50,868 INFO L290 TraceCheckUtils]: 130: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 12:22:50,868 INFO L290 TraceCheckUtils]: 129: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-15 12:22:50,868 INFO L290 TraceCheckUtils]: 128: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 12:22:50,868 INFO L290 TraceCheckUtils]: 127: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 12:22:50,868 INFO L290 TraceCheckUtils]: 126: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 12:22:50,869 INFO L290 TraceCheckUtils]: 125: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-15 12:22:50,869 INFO L290 TraceCheckUtils]: 124: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 12:22:50,869 INFO L290 TraceCheckUtils]: 123: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 12:22:50,869 INFO L290 TraceCheckUtils]: 122: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 12:22:50,869 INFO L290 TraceCheckUtils]: 121: Hoare triple {95276#false} ~i~0 := 0; {95276#false} is VALID [2022-04-15 12:22:50,869 INFO L290 TraceCheckUtils]: 120: Hoare triple {95799#(< main_~i~0 1024)} assume !(~i~0 < 1024); {95276#false} is VALID [2022-04-15 12:22:50,869 INFO L290 TraceCheckUtils]: 119: Hoare triple {95803#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95799#(< main_~i~0 1024)} is VALID [2022-04-15 12:22:50,870 INFO L290 TraceCheckUtils]: 118: Hoare triple {95803#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95803#(< main_~i~0 1023)} is VALID [2022-04-15 12:22:50,870 INFO L290 TraceCheckUtils]: 117: Hoare triple {95810#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95803#(< main_~i~0 1023)} is VALID [2022-04-15 12:22:50,870 INFO L290 TraceCheckUtils]: 116: Hoare triple {95810#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95810#(< main_~i~0 1022)} is VALID [2022-04-15 12:22:50,870 INFO L290 TraceCheckUtils]: 115: Hoare triple {95817#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95810#(< main_~i~0 1022)} is VALID [2022-04-15 12:22:50,871 INFO L290 TraceCheckUtils]: 114: Hoare triple {95817#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95817#(< main_~i~0 1021)} is VALID [2022-04-15 12:22:50,871 INFO L290 TraceCheckUtils]: 113: Hoare triple {95824#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95817#(< main_~i~0 1021)} is VALID [2022-04-15 12:22:50,871 INFO L290 TraceCheckUtils]: 112: Hoare triple {95824#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95824#(< main_~i~0 1020)} is VALID [2022-04-15 12:22:50,872 INFO L290 TraceCheckUtils]: 111: Hoare triple {95831#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95824#(< main_~i~0 1020)} is VALID [2022-04-15 12:22:50,872 INFO L290 TraceCheckUtils]: 110: Hoare triple {95831#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95831#(< main_~i~0 1019)} is VALID [2022-04-15 12:22:50,872 INFO L290 TraceCheckUtils]: 109: Hoare triple {95838#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95831#(< main_~i~0 1019)} is VALID [2022-04-15 12:22:50,872 INFO L290 TraceCheckUtils]: 108: Hoare triple {95838#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95838#(< main_~i~0 1018)} is VALID [2022-04-15 12:22:50,873 INFO L290 TraceCheckUtils]: 107: Hoare triple {95845#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95838#(< main_~i~0 1018)} is VALID [2022-04-15 12:22:50,873 INFO L290 TraceCheckUtils]: 106: Hoare triple {95845#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95845#(< main_~i~0 1017)} is VALID [2022-04-15 12:22:50,873 INFO L290 TraceCheckUtils]: 105: Hoare triple {95852#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95845#(< main_~i~0 1017)} is VALID [2022-04-15 12:22:50,874 INFO L290 TraceCheckUtils]: 104: Hoare triple {95852#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95852#(< main_~i~0 1016)} is VALID [2022-04-15 12:22:50,874 INFO L290 TraceCheckUtils]: 103: Hoare triple {95859#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95852#(< main_~i~0 1016)} is VALID [2022-04-15 12:22:50,874 INFO L290 TraceCheckUtils]: 102: Hoare triple {95859#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95859#(< main_~i~0 1015)} is VALID [2022-04-15 12:22:50,874 INFO L290 TraceCheckUtils]: 101: Hoare triple {95866#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95859#(< main_~i~0 1015)} is VALID [2022-04-15 12:22:50,875 INFO L290 TraceCheckUtils]: 100: Hoare triple {95866#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95866#(< main_~i~0 1014)} is VALID [2022-04-15 12:22:50,875 INFO L290 TraceCheckUtils]: 99: Hoare triple {95873#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95866#(< main_~i~0 1014)} is VALID [2022-04-15 12:22:50,875 INFO L290 TraceCheckUtils]: 98: Hoare triple {95873#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95873#(< main_~i~0 1013)} is VALID [2022-04-15 12:22:50,876 INFO L290 TraceCheckUtils]: 97: Hoare triple {95880#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95873#(< main_~i~0 1013)} is VALID [2022-04-15 12:22:50,876 INFO L290 TraceCheckUtils]: 96: Hoare triple {95880#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95880#(< main_~i~0 1012)} is VALID [2022-04-15 12:22:50,876 INFO L290 TraceCheckUtils]: 95: Hoare triple {95887#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95880#(< main_~i~0 1012)} is VALID [2022-04-15 12:22:50,876 INFO L290 TraceCheckUtils]: 94: Hoare triple {95887#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95887#(< main_~i~0 1011)} is VALID [2022-04-15 12:22:50,877 INFO L290 TraceCheckUtils]: 93: Hoare triple {95894#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95887#(< main_~i~0 1011)} is VALID [2022-04-15 12:22:50,877 INFO L290 TraceCheckUtils]: 92: Hoare triple {95894#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95894#(< main_~i~0 1010)} is VALID [2022-04-15 12:22:50,877 INFO L290 TraceCheckUtils]: 91: Hoare triple {95901#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95894#(< main_~i~0 1010)} is VALID [2022-04-15 12:22:50,877 INFO L290 TraceCheckUtils]: 90: Hoare triple {95901#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95901#(< main_~i~0 1009)} is VALID [2022-04-15 12:22:50,878 INFO L290 TraceCheckUtils]: 89: Hoare triple {95908#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95901#(< main_~i~0 1009)} is VALID [2022-04-15 12:22:50,878 INFO L290 TraceCheckUtils]: 88: Hoare triple {95908#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95908#(< main_~i~0 1008)} is VALID [2022-04-15 12:22:50,878 INFO L290 TraceCheckUtils]: 87: Hoare triple {95915#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95908#(< main_~i~0 1008)} is VALID [2022-04-15 12:22:50,879 INFO L290 TraceCheckUtils]: 86: Hoare triple {95915#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95915#(< main_~i~0 1007)} is VALID [2022-04-15 12:22:50,879 INFO L290 TraceCheckUtils]: 85: Hoare triple {95922#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95915#(< main_~i~0 1007)} is VALID [2022-04-15 12:22:50,879 INFO L290 TraceCheckUtils]: 84: Hoare triple {95922#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95922#(< main_~i~0 1006)} is VALID [2022-04-15 12:22:50,879 INFO L290 TraceCheckUtils]: 83: Hoare triple {95929#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95922#(< main_~i~0 1006)} is VALID [2022-04-15 12:22:50,880 INFO L290 TraceCheckUtils]: 82: Hoare triple {95929#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95929#(< main_~i~0 1005)} is VALID [2022-04-15 12:22:50,880 INFO L290 TraceCheckUtils]: 81: Hoare triple {95936#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95929#(< main_~i~0 1005)} is VALID [2022-04-15 12:22:50,880 INFO L290 TraceCheckUtils]: 80: Hoare triple {95936#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95936#(< main_~i~0 1004)} is VALID [2022-04-15 12:22:50,881 INFO L290 TraceCheckUtils]: 79: Hoare triple {95943#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95936#(< main_~i~0 1004)} is VALID [2022-04-15 12:22:50,881 INFO L290 TraceCheckUtils]: 78: Hoare triple {95943#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95943#(< main_~i~0 1003)} is VALID [2022-04-15 12:22:50,881 INFO L290 TraceCheckUtils]: 77: Hoare triple {95950#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95943#(< main_~i~0 1003)} is VALID [2022-04-15 12:22:50,881 INFO L290 TraceCheckUtils]: 76: Hoare triple {95950#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95950#(< main_~i~0 1002)} is VALID [2022-04-15 12:22:50,882 INFO L290 TraceCheckUtils]: 75: Hoare triple {95957#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95950#(< main_~i~0 1002)} is VALID [2022-04-15 12:22:50,882 INFO L290 TraceCheckUtils]: 74: Hoare triple {95957#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95957#(< main_~i~0 1001)} is VALID [2022-04-15 12:22:50,882 INFO L290 TraceCheckUtils]: 73: Hoare triple {95964#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95957#(< main_~i~0 1001)} is VALID [2022-04-15 12:22:50,882 INFO L290 TraceCheckUtils]: 72: Hoare triple {95964#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95964#(< main_~i~0 1000)} is VALID [2022-04-15 12:22:50,883 INFO L290 TraceCheckUtils]: 71: Hoare triple {95971#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95964#(< main_~i~0 1000)} is VALID [2022-04-15 12:22:50,883 INFO L290 TraceCheckUtils]: 70: Hoare triple {95971#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95971#(< main_~i~0 999)} is VALID [2022-04-15 12:22:50,883 INFO L290 TraceCheckUtils]: 69: Hoare triple {95978#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95971#(< main_~i~0 999)} is VALID [2022-04-15 12:22:50,884 INFO L290 TraceCheckUtils]: 68: Hoare triple {95978#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95978#(< main_~i~0 998)} is VALID [2022-04-15 12:22:50,884 INFO L290 TraceCheckUtils]: 67: Hoare triple {95985#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95978#(< main_~i~0 998)} is VALID [2022-04-15 12:22:50,884 INFO L290 TraceCheckUtils]: 66: Hoare triple {95985#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95985#(< main_~i~0 997)} is VALID [2022-04-15 12:22:50,884 INFO L290 TraceCheckUtils]: 65: Hoare triple {95992#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95985#(< main_~i~0 997)} is VALID [2022-04-15 12:22:50,885 INFO L290 TraceCheckUtils]: 64: Hoare triple {95992#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95992#(< main_~i~0 996)} is VALID [2022-04-15 12:22:50,885 INFO L290 TraceCheckUtils]: 63: Hoare triple {95999#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95992#(< main_~i~0 996)} is VALID [2022-04-15 12:22:50,885 INFO L290 TraceCheckUtils]: 62: Hoare triple {95999#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95999#(< main_~i~0 995)} is VALID [2022-04-15 12:22:50,886 INFO L290 TraceCheckUtils]: 61: Hoare triple {96006#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95999#(< main_~i~0 995)} is VALID [2022-04-15 12:22:50,886 INFO L290 TraceCheckUtils]: 60: Hoare triple {96006#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96006#(< main_~i~0 994)} is VALID [2022-04-15 12:22:50,886 INFO L290 TraceCheckUtils]: 59: Hoare triple {96013#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96006#(< main_~i~0 994)} is VALID [2022-04-15 12:22:50,886 INFO L290 TraceCheckUtils]: 58: Hoare triple {96013#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96013#(< main_~i~0 993)} is VALID [2022-04-15 12:22:50,887 INFO L290 TraceCheckUtils]: 57: Hoare triple {96020#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96013#(< main_~i~0 993)} is VALID [2022-04-15 12:22:50,887 INFO L290 TraceCheckUtils]: 56: Hoare triple {96020#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96020#(< main_~i~0 992)} is VALID [2022-04-15 12:22:50,887 INFO L290 TraceCheckUtils]: 55: Hoare triple {96027#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96020#(< main_~i~0 992)} is VALID [2022-04-15 12:22:50,887 INFO L290 TraceCheckUtils]: 54: Hoare triple {96027#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96027#(< main_~i~0 991)} is VALID [2022-04-15 12:22:50,888 INFO L290 TraceCheckUtils]: 53: Hoare triple {96034#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96027#(< main_~i~0 991)} is VALID [2022-04-15 12:22:50,888 INFO L290 TraceCheckUtils]: 52: Hoare triple {96034#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96034#(< main_~i~0 990)} is VALID [2022-04-15 12:22:50,888 INFO L290 TraceCheckUtils]: 51: Hoare triple {96041#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96034#(< main_~i~0 990)} is VALID [2022-04-15 12:22:50,889 INFO L290 TraceCheckUtils]: 50: Hoare triple {96041#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96041#(< main_~i~0 989)} is VALID [2022-04-15 12:22:50,889 INFO L290 TraceCheckUtils]: 49: Hoare triple {96048#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96041#(< main_~i~0 989)} is VALID [2022-04-15 12:22:50,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {96048#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96048#(< main_~i~0 988)} is VALID [2022-04-15 12:22:50,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {96055#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96048#(< main_~i~0 988)} is VALID [2022-04-15 12:22:50,890 INFO L290 TraceCheckUtils]: 46: Hoare triple {96055#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96055#(< main_~i~0 987)} is VALID [2022-04-15 12:22:50,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {96062#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96055#(< main_~i~0 987)} is VALID [2022-04-15 12:22:50,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {96062#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96062#(< main_~i~0 986)} is VALID [2022-04-15 12:22:50,891 INFO L290 TraceCheckUtils]: 43: Hoare triple {96069#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96062#(< main_~i~0 986)} is VALID [2022-04-15 12:22:50,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {96069#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96069#(< main_~i~0 985)} is VALID [2022-04-15 12:22:50,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {96076#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96069#(< main_~i~0 985)} is VALID [2022-04-15 12:22:50,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {96076#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96076#(< main_~i~0 984)} is VALID [2022-04-15 12:22:50,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {96083#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96076#(< main_~i~0 984)} is VALID [2022-04-15 12:22:50,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {96083#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96083#(< main_~i~0 983)} is VALID [2022-04-15 12:22:50,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {96090#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96083#(< main_~i~0 983)} is VALID [2022-04-15 12:22:50,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {96090#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96090#(< main_~i~0 982)} is VALID [2022-04-15 12:22:50,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {96097#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96090#(< main_~i~0 982)} is VALID [2022-04-15 12:22:50,893 INFO L290 TraceCheckUtils]: 34: Hoare triple {96097#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96097#(< main_~i~0 981)} is VALID [2022-04-15 12:22:50,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {96104#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96097#(< main_~i~0 981)} is VALID [2022-04-15 12:22:50,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {96104#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96104#(< main_~i~0 980)} is VALID [2022-04-15 12:22:50,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {96111#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96104#(< main_~i~0 980)} is VALID [2022-04-15 12:22:50,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {96111#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96111#(< main_~i~0 979)} is VALID [2022-04-15 12:22:50,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {96118#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96111#(< main_~i~0 979)} is VALID [2022-04-15 12:22:50,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {96118#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96118#(< main_~i~0 978)} is VALID [2022-04-15 12:22:50,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {96125#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96118#(< main_~i~0 978)} is VALID [2022-04-15 12:22:50,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {96125#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96125#(< main_~i~0 977)} is VALID [2022-04-15 12:22:50,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {96132#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96125#(< main_~i~0 977)} is VALID [2022-04-15 12:22:50,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {96132#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96132#(< main_~i~0 976)} is VALID [2022-04-15 12:22:50,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {96139#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96132#(< main_~i~0 976)} is VALID [2022-04-15 12:22:50,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {96139#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96139#(< main_~i~0 975)} is VALID [2022-04-15 12:22:50,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {96146#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96139#(< main_~i~0 975)} is VALID [2022-04-15 12:22:50,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {96146#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96146#(< main_~i~0 974)} is VALID [2022-04-15 12:22:50,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {96153#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96146#(< main_~i~0 974)} is VALID [2022-04-15 12:22:50,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {96153#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96153#(< main_~i~0 973)} is VALID [2022-04-15 12:22:50,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {96160#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96153#(< main_~i~0 973)} is VALID [2022-04-15 12:22:50,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {96160#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96160#(< main_~i~0 972)} is VALID [2022-04-15 12:22:50,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {96167#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96160#(< main_~i~0 972)} is VALID [2022-04-15 12:22:50,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {96167#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96167#(< main_~i~0 971)} is VALID [2022-04-15 12:22:50,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {96174#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96167#(< main_~i~0 971)} is VALID [2022-04-15 12:22:50,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {96174#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96174#(< main_~i~0 970)} is VALID [2022-04-15 12:22:50,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {96181#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96174#(< main_~i~0 970)} is VALID [2022-04-15 12:22:50,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {96181#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96181#(< main_~i~0 969)} is VALID [2022-04-15 12:22:50,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {96188#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96181#(< main_~i~0 969)} is VALID [2022-04-15 12:22:50,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {96188#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96188#(< main_~i~0 968)} is VALID [2022-04-15 12:22:50,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {96195#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96188#(< main_~i~0 968)} is VALID [2022-04-15 12:22:50,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {96195#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96195#(< main_~i~0 967)} is VALID [2022-04-15 12:22:50,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {95275#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {96195#(< main_~i~0 967)} is VALID [2022-04-15 12:22:50,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {95275#true} call #t~ret6 := main(); {95275#true} is VALID [2022-04-15 12:22:50,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95275#true} {95275#true} #64#return; {95275#true} is VALID [2022-04-15 12:22:50,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {95275#true} assume true; {95275#true} is VALID [2022-04-15 12:22:50,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {95275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {95275#true} is VALID [2022-04-15 12:22:50,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {95275#true} call ULTIMATE.init(); {95275#true} is VALID [2022-04-15 12:22:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3259 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:22:50,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754302142] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:22:50,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:22:50,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 120 [2022-04-15 12:22:50,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:22:50,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1484171387] [2022-04-15 12:22:50,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1484171387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:50,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:50,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-15 12:22:50,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343788307] [2022-04-15 12:22:50,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:22:50,903 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2022-04-15 12:22:50,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:22:50,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:50,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:50,977 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-15 12:22:50,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:50,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-15 12:22:50,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7023, Invalid=7257, Unknown=0, NotChecked=0, Total=14280 [2022-04-15 12:22:50,979 INFO L87 Difference]: Start difference. First operand 138 states and 142 transitions. Second operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:04,140 INFO L93 Difference]: Finished difference Result 439 states and 559 transitions. [2022-04-15 12:23:04,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-15 12:23:04,140 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2022-04-15 12:23:04,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:23:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:04,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 550 transitions. [2022-04-15 12:23:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 550 transitions. [2022-04-15 12:23:04,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 550 transitions. [2022-04-15 12:23:04,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 550 edges. 550 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:04,503 INFO L225 Difference]: With dead ends: 439 [2022-04-15 12:23:04,503 INFO L226 Difference]: Without dead ends: 422 [2022-04-15 12:23:04,504 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=13926, Invalid=17580, Unknown=0, NotChecked=0, Total=31506 [2022-04-15 12:23:04,505 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1280 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:23:04,505 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1280 Valid, 47 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:23:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-04-15 12:23:05,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 140. [2022-04-15 12:23:05,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:23:05,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 422 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:05,338 INFO L74 IsIncluded]: Start isIncluded. First operand 422 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:05,338 INFO L87 Difference]: Start difference. First operand 422 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:05,344 INFO L93 Difference]: Finished difference Result 422 states and 538 transitions. [2022-04-15 12:23:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 538 transitions. [2022-04-15 12:23:05,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:05,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:05,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 422 states. [2022-04-15 12:23:05,345 INFO L87 Difference]: Start difference. First operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 422 states. [2022-04-15 12:23:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:05,352 INFO L93 Difference]: Finished difference Result 422 states and 538 transitions. [2022-04-15 12:23:05,352 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 538 transitions. [2022-04-15 12:23:05,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:05,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:05,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:23:05,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:23:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2022-04-15 12:23:05,354 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 137 [2022-04-15 12:23:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:23:05,354 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2022-04-15 12:23:05,354 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:05,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 144 transitions. [2022-04-15 12:23:05,715 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:23:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2022-04-15 12:23:05,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-15 12:23:05,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:23:05,716 INFO L499 BasicCegarLoop]: trace histogram [58, 58, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:23:05,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-15 12:23:05,916 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:05,916 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:23:05,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:23:05,917 INFO L85 PathProgramCache]: Analyzing trace with hash -600809335, now seen corresponding path program 117 times [2022-04-15 12:23:05,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:05,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1230875395] [2022-04-15 12:23:05,920 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:23:05,920 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:23:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash -600809335, now seen corresponding path program 118 times [2022-04-15 12:23:05,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:23:05,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362256790] [2022-04-15 12:23:05,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:23:05,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:23:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:07,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:23:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:07,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {98401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {98337#true} is VALID [2022-04-15 12:23:07,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {98337#true} assume true; {98337#true} is VALID [2022-04-15 12:23:07,047 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98337#true} {98337#true} #64#return; {98337#true} is VALID [2022-04-15 12:23:07,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {98337#true} call ULTIMATE.init(); {98401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:23:07,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {98401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {98337#true} is VALID [2022-04-15 12:23:07,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {98337#true} assume true; {98337#true} is VALID [2022-04-15 12:23:07,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98337#true} {98337#true} #64#return; {98337#true} is VALID [2022-04-15 12:23:07,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {98337#true} call #t~ret6 := main(); {98337#true} is VALID [2022-04-15 12:23:07,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {98337#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {98342#(= main_~i~0 0)} is VALID [2022-04-15 12:23:07,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {98342#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98342#(= main_~i~0 0)} is VALID [2022-04-15 12:23:07,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {98342#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98343#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:07,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {98343#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98343#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:07,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {98343#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98344#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:07,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {98344#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98344#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:07,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {98344#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98345#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:07,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {98345#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98345#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:07,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {98345#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98346#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:07,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {98346#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98346#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:07,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {98346#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98347#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:07,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {98347#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98347#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:07,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {98347#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98348#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:07,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {98348#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98348#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:07,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {98348#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98349#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:07,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {98349#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98349#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:07,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {98349#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98350#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:07,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {98350#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98350#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:07,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {98350#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98351#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:07,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {98351#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98351#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:07,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {98351#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98352#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:07,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {98352#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98352#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:07,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {98352#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98353#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:07,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {98353#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98353#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:07,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {98353#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98354#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:07,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {98354#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98354#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:07,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {98354#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98355#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:07,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {98355#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98355#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:07,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {98355#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98356#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:07,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {98356#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98356#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:07,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {98356#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98357#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:07,056 INFO L290 TraceCheckUtils]: 36: Hoare triple {98357#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98357#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:07,056 INFO L290 TraceCheckUtils]: 37: Hoare triple {98357#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98358#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:07,056 INFO L290 TraceCheckUtils]: 38: Hoare triple {98358#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98358#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:07,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {98358#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98359#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:07,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {98359#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98359#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:07,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {98359#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98360#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:07,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {98360#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98360#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:07,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {98360#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98361#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:07,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {98361#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98361#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:07,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {98361#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98362#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:07,069 INFO L290 TraceCheckUtils]: 46: Hoare triple {98362#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98362#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:07,069 INFO L290 TraceCheckUtils]: 47: Hoare triple {98362#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98363#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:07,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {98363#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98363#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:07,070 INFO L290 TraceCheckUtils]: 49: Hoare triple {98363#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98364#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:07,070 INFO L290 TraceCheckUtils]: 50: Hoare triple {98364#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98364#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:07,070 INFO L290 TraceCheckUtils]: 51: Hoare triple {98364#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98365#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:07,070 INFO L290 TraceCheckUtils]: 52: Hoare triple {98365#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98365#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:07,071 INFO L290 TraceCheckUtils]: 53: Hoare triple {98365#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98366#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:07,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {98366#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98366#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:07,071 INFO L290 TraceCheckUtils]: 55: Hoare triple {98366#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98367#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:07,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {98367#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98367#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:07,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {98367#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98368#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:07,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {98368#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98368#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:07,072 INFO L290 TraceCheckUtils]: 59: Hoare triple {98368#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98369#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:07,073 INFO L290 TraceCheckUtils]: 60: Hoare triple {98369#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98369#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:07,073 INFO L290 TraceCheckUtils]: 61: Hoare triple {98369#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98370#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:07,073 INFO L290 TraceCheckUtils]: 62: Hoare triple {98370#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98370#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:07,073 INFO L290 TraceCheckUtils]: 63: Hoare triple {98370#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98371#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:07,074 INFO L290 TraceCheckUtils]: 64: Hoare triple {98371#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98371#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:07,074 INFO L290 TraceCheckUtils]: 65: Hoare triple {98371#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98372#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:07,074 INFO L290 TraceCheckUtils]: 66: Hoare triple {98372#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98372#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:07,075 INFO L290 TraceCheckUtils]: 67: Hoare triple {98372#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98373#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:07,075 INFO L290 TraceCheckUtils]: 68: Hoare triple {98373#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98373#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:07,075 INFO L290 TraceCheckUtils]: 69: Hoare triple {98373#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98374#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:07,075 INFO L290 TraceCheckUtils]: 70: Hoare triple {98374#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98374#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:07,076 INFO L290 TraceCheckUtils]: 71: Hoare triple {98374#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98375#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:07,076 INFO L290 TraceCheckUtils]: 72: Hoare triple {98375#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98375#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:07,076 INFO L290 TraceCheckUtils]: 73: Hoare triple {98375#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98376#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:07,076 INFO L290 TraceCheckUtils]: 74: Hoare triple {98376#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98376#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:07,077 INFO L290 TraceCheckUtils]: 75: Hoare triple {98376#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98377#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:07,077 INFO L290 TraceCheckUtils]: 76: Hoare triple {98377#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98377#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:07,077 INFO L290 TraceCheckUtils]: 77: Hoare triple {98377#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98378#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:07,078 INFO L290 TraceCheckUtils]: 78: Hoare triple {98378#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98378#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:07,078 INFO L290 TraceCheckUtils]: 79: Hoare triple {98378#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98379#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:07,078 INFO L290 TraceCheckUtils]: 80: Hoare triple {98379#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98379#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:07,078 INFO L290 TraceCheckUtils]: 81: Hoare triple {98379#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98380#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:07,079 INFO L290 TraceCheckUtils]: 82: Hoare triple {98380#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98380#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:07,079 INFO L290 TraceCheckUtils]: 83: Hoare triple {98380#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98381#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:07,079 INFO L290 TraceCheckUtils]: 84: Hoare triple {98381#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98381#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:07,080 INFO L290 TraceCheckUtils]: 85: Hoare triple {98381#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98382#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:07,080 INFO L290 TraceCheckUtils]: 86: Hoare triple {98382#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98382#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:07,080 INFO L290 TraceCheckUtils]: 87: Hoare triple {98382#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98383#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:07,080 INFO L290 TraceCheckUtils]: 88: Hoare triple {98383#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98383#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:07,081 INFO L290 TraceCheckUtils]: 89: Hoare triple {98383#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98384#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:07,081 INFO L290 TraceCheckUtils]: 90: Hoare triple {98384#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98384#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:07,081 INFO L290 TraceCheckUtils]: 91: Hoare triple {98384#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98385#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:07,081 INFO L290 TraceCheckUtils]: 92: Hoare triple {98385#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98385#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:07,082 INFO L290 TraceCheckUtils]: 93: Hoare triple {98385#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98386#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:07,082 INFO L290 TraceCheckUtils]: 94: Hoare triple {98386#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98386#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:07,082 INFO L290 TraceCheckUtils]: 95: Hoare triple {98386#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98387#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:07,083 INFO L290 TraceCheckUtils]: 96: Hoare triple {98387#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98387#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:07,083 INFO L290 TraceCheckUtils]: 97: Hoare triple {98387#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98388#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:07,083 INFO L290 TraceCheckUtils]: 98: Hoare triple {98388#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98388#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:07,083 INFO L290 TraceCheckUtils]: 99: Hoare triple {98388#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98389#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:07,084 INFO L290 TraceCheckUtils]: 100: Hoare triple {98389#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98389#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:07,084 INFO L290 TraceCheckUtils]: 101: Hoare triple {98389#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98390#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:07,084 INFO L290 TraceCheckUtils]: 102: Hoare triple {98390#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98390#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:07,085 INFO L290 TraceCheckUtils]: 103: Hoare triple {98390#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98391#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:07,085 INFO L290 TraceCheckUtils]: 104: Hoare triple {98391#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98391#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:07,085 INFO L290 TraceCheckUtils]: 105: Hoare triple {98391#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98392#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:07,085 INFO L290 TraceCheckUtils]: 106: Hoare triple {98392#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98392#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:07,086 INFO L290 TraceCheckUtils]: 107: Hoare triple {98392#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98393#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:07,086 INFO L290 TraceCheckUtils]: 108: Hoare triple {98393#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98393#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:07,086 INFO L290 TraceCheckUtils]: 109: Hoare triple {98393#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98394#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:07,086 INFO L290 TraceCheckUtils]: 110: Hoare triple {98394#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98394#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:07,087 INFO L290 TraceCheckUtils]: 111: Hoare triple {98394#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98395#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:07,087 INFO L290 TraceCheckUtils]: 112: Hoare triple {98395#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98395#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:07,087 INFO L290 TraceCheckUtils]: 113: Hoare triple {98395#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98396#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:07,087 INFO L290 TraceCheckUtils]: 114: Hoare triple {98396#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98396#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:07,088 INFO L290 TraceCheckUtils]: 115: Hoare triple {98396#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98397#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:07,088 INFO L290 TraceCheckUtils]: 116: Hoare triple {98397#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98397#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:07,088 INFO L290 TraceCheckUtils]: 117: Hoare triple {98397#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98398#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:07,089 INFO L290 TraceCheckUtils]: 118: Hoare triple {98398#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98398#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:07,089 INFO L290 TraceCheckUtils]: 119: Hoare triple {98398#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98399#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:07,089 INFO L290 TraceCheckUtils]: 120: Hoare triple {98399#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98399#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:07,089 INFO L290 TraceCheckUtils]: 121: Hoare triple {98399#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98400#(<= main_~i~0 58)} is VALID [2022-04-15 12:23:07,090 INFO L290 TraceCheckUtils]: 122: Hoare triple {98400#(<= main_~i~0 58)} assume !(~i~0 < 1024); {98338#false} is VALID [2022-04-15 12:23:07,090 INFO L290 TraceCheckUtils]: 123: Hoare triple {98338#false} ~i~0 := 0; {98338#false} is VALID [2022-04-15 12:23:07,090 INFO L290 TraceCheckUtils]: 124: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 12:23:07,090 INFO L290 TraceCheckUtils]: 125: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 12:23:07,090 INFO L290 TraceCheckUtils]: 126: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 12:23:07,090 INFO L290 TraceCheckUtils]: 127: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-15 12:23:07,090 INFO L290 TraceCheckUtils]: 128: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 12:23:07,090 INFO L290 TraceCheckUtils]: 129: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 12:23:07,090 INFO L290 TraceCheckUtils]: 130: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 12:23:07,090 INFO L290 TraceCheckUtils]: 131: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-15 12:23:07,090 INFO L290 TraceCheckUtils]: 132: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 12:23:07,090 INFO L290 TraceCheckUtils]: 133: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 12:23:07,090 INFO L290 TraceCheckUtils]: 134: Hoare triple {98338#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 12:23:07,090 INFO L272 TraceCheckUtils]: 135: Hoare triple {98338#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {98338#false} is VALID [2022-04-15 12:23:07,091 INFO L290 TraceCheckUtils]: 136: Hoare triple {98338#false} ~cond := #in~cond; {98338#false} is VALID [2022-04-15 12:23:07,091 INFO L290 TraceCheckUtils]: 137: Hoare triple {98338#false} assume 0 == ~cond; {98338#false} is VALID [2022-04-15 12:23:07,091 INFO L290 TraceCheckUtils]: 138: Hoare triple {98338#false} assume !false; {98338#false} is VALID [2022-04-15 12:23:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:23:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:23:07,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362256790] [2022-04-15 12:23:07,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362256790] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:23:07,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516406579] [2022-04-15 12:23:07,091 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:23:07,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:23:07,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:23:07,093 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:07,093 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:07,450 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:23:07,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:23:07,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-15 12:23:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:07,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:23:08,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {98337#true} call ULTIMATE.init(); {98337#true} is VALID [2022-04-15 12:23:08,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {98337#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {98337#true} is VALID [2022-04-15 12:23:08,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {98337#true} assume true; {98337#true} is VALID [2022-04-15 12:23:08,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98337#true} {98337#true} #64#return; {98337#true} is VALID [2022-04-15 12:23:08,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {98337#true} call #t~ret6 := main(); {98337#true} is VALID [2022-04-15 12:23:08,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {98337#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {98420#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:08,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {98420#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98420#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:08,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {98420#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98343#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:08,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {98343#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98343#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:08,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {98343#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98344#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:08,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {98344#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98344#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:08,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {98344#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98345#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:08,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {98345#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98345#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:08,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {98345#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98346#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:08,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {98346#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98346#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:08,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {98346#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98347#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:08,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {98347#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98347#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:08,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {98347#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98348#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:08,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {98348#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98348#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:08,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {98348#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98349#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:08,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {98349#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98349#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:08,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {98349#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98350#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:08,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {98350#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98350#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:08,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {98350#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98351#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:08,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {98351#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98351#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:08,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {98351#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98352#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:08,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {98352#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98352#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:08,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {98352#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98353#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:08,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {98353#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98353#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:08,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {98353#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98354#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:08,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {98354#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98354#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:08,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {98354#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98355#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:08,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {98355#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98355#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:08,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {98355#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98356#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:08,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {98356#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98356#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:08,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {98356#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98357#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:08,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {98357#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98357#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:08,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {98357#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98358#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:08,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {98358#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98358#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:08,143 INFO L290 TraceCheckUtils]: 39: Hoare triple {98358#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98359#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:08,143 INFO L290 TraceCheckUtils]: 40: Hoare triple {98359#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98359#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:08,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {98359#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98360#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:08,143 INFO L290 TraceCheckUtils]: 42: Hoare triple {98360#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98360#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:08,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {98360#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98361#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:08,144 INFO L290 TraceCheckUtils]: 44: Hoare triple {98361#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98361#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:08,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {98361#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98362#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:08,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {98362#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98362#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:08,145 INFO L290 TraceCheckUtils]: 47: Hoare triple {98362#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98363#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:08,145 INFO L290 TraceCheckUtils]: 48: Hoare triple {98363#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98363#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:08,145 INFO L290 TraceCheckUtils]: 49: Hoare triple {98363#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98364#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:08,146 INFO L290 TraceCheckUtils]: 50: Hoare triple {98364#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98364#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:08,146 INFO L290 TraceCheckUtils]: 51: Hoare triple {98364#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98365#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:08,146 INFO L290 TraceCheckUtils]: 52: Hoare triple {98365#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98365#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:08,147 INFO L290 TraceCheckUtils]: 53: Hoare triple {98365#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98366#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:08,147 INFO L290 TraceCheckUtils]: 54: Hoare triple {98366#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98366#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:08,147 INFO L290 TraceCheckUtils]: 55: Hoare triple {98366#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98367#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:08,147 INFO L290 TraceCheckUtils]: 56: Hoare triple {98367#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98367#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:08,148 INFO L290 TraceCheckUtils]: 57: Hoare triple {98367#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98368#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:08,148 INFO L290 TraceCheckUtils]: 58: Hoare triple {98368#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98368#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:08,148 INFO L290 TraceCheckUtils]: 59: Hoare triple {98368#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98369#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:08,148 INFO L290 TraceCheckUtils]: 60: Hoare triple {98369#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98369#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:08,149 INFO L290 TraceCheckUtils]: 61: Hoare triple {98369#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98370#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:08,149 INFO L290 TraceCheckUtils]: 62: Hoare triple {98370#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98370#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:08,149 INFO L290 TraceCheckUtils]: 63: Hoare triple {98370#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98371#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:08,150 INFO L290 TraceCheckUtils]: 64: Hoare triple {98371#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98371#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:08,150 INFO L290 TraceCheckUtils]: 65: Hoare triple {98371#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98372#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:08,150 INFO L290 TraceCheckUtils]: 66: Hoare triple {98372#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98372#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:08,150 INFO L290 TraceCheckUtils]: 67: Hoare triple {98372#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98373#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:08,151 INFO L290 TraceCheckUtils]: 68: Hoare triple {98373#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98373#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:08,151 INFO L290 TraceCheckUtils]: 69: Hoare triple {98373#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98374#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:08,151 INFO L290 TraceCheckUtils]: 70: Hoare triple {98374#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98374#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:08,152 INFO L290 TraceCheckUtils]: 71: Hoare triple {98374#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98375#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:08,152 INFO L290 TraceCheckUtils]: 72: Hoare triple {98375#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98375#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:08,152 INFO L290 TraceCheckUtils]: 73: Hoare triple {98375#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98376#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:08,152 INFO L290 TraceCheckUtils]: 74: Hoare triple {98376#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98376#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:08,153 INFO L290 TraceCheckUtils]: 75: Hoare triple {98376#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98377#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:08,153 INFO L290 TraceCheckUtils]: 76: Hoare triple {98377#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98377#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:08,153 INFO L290 TraceCheckUtils]: 77: Hoare triple {98377#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98378#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:08,153 INFO L290 TraceCheckUtils]: 78: Hoare triple {98378#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98378#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:08,154 INFO L290 TraceCheckUtils]: 79: Hoare triple {98378#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98379#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:08,154 INFO L290 TraceCheckUtils]: 80: Hoare triple {98379#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98379#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:08,154 INFO L290 TraceCheckUtils]: 81: Hoare triple {98379#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98380#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:08,155 INFO L290 TraceCheckUtils]: 82: Hoare triple {98380#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98380#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:08,155 INFO L290 TraceCheckUtils]: 83: Hoare triple {98380#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98381#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:08,155 INFO L290 TraceCheckUtils]: 84: Hoare triple {98381#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98381#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:08,155 INFO L290 TraceCheckUtils]: 85: Hoare triple {98381#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98382#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:08,156 INFO L290 TraceCheckUtils]: 86: Hoare triple {98382#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98382#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:08,156 INFO L290 TraceCheckUtils]: 87: Hoare triple {98382#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98383#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:08,156 INFO L290 TraceCheckUtils]: 88: Hoare triple {98383#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98383#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:08,156 INFO L290 TraceCheckUtils]: 89: Hoare triple {98383#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98384#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:08,157 INFO L290 TraceCheckUtils]: 90: Hoare triple {98384#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98384#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:08,157 INFO L290 TraceCheckUtils]: 91: Hoare triple {98384#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98385#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:08,157 INFO L290 TraceCheckUtils]: 92: Hoare triple {98385#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98385#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:08,158 INFO L290 TraceCheckUtils]: 93: Hoare triple {98385#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98386#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:08,158 INFO L290 TraceCheckUtils]: 94: Hoare triple {98386#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98386#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:08,158 INFO L290 TraceCheckUtils]: 95: Hoare triple {98386#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98387#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:08,158 INFO L290 TraceCheckUtils]: 96: Hoare triple {98387#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98387#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:08,159 INFO L290 TraceCheckUtils]: 97: Hoare triple {98387#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98388#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:08,159 INFO L290 TraceCheckUtils]: 98: Hoare triple {98388#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98388#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:08,159 INFO L290 TraceCheckUtils]: 99: Hoare triple {98388#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98389#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:08,159 INFO L290 TraceCheckUtils]: 100: Hoare triple {98389#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98389#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:08,160 INFO L290 TraceCheckUtils]: 101: Hoare triple {98389#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98390#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:08,160 INFO L290 TraceCheckUtils]: 102: Hoare triple {98390#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98390#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:08,160 INFO L290 TraceCheckUtils]: 103: Hoare triple {98390#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98391#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:08,161 INFO L290 TraceCheckUtils]: 104: Hoare triple {98391#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98391#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:08,161 INFO L290 TraceCheckUtils]: 105: Hoare triple {98391#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98392#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:08,161 INFO L290 TraceCheckUtils]: 106: Hoare triple {98392#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98392#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:08,161 INFO L290 TraceCheckUtils]: 107: Hoare triple {98392#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98393#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:08,162 INFO L290 TraceCheckUtils]: 108: Hoare triple {98393#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98393#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:08,162 INFO L290 TraceCheckUtils]: 109: Hoare triple {98393#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98394#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:08,162 INFO L290 TraceCheckUtils]: 110: Hoare triple {98394#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98394#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:08,163 INFO L290 TraceCheckUtils]: 111: Hoare triple {98394#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98395#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:08,163 INFO L290 TraceCheckUtils]: 112: Hoare triple {98395#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98395#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:08,163 INFO L290 TraceCheckUtils]: 113: Hoare triple {98395#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98396#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:08,163 INFO L290 TraceCheckUtils]: 114: Hoare triple {98396#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98396#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:08,164 INFO L290 TraceCheckUtils]: 115: Hoare triple {98396#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98397#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:08,164 INFO L290 TraceCheckUtils]: 116: Hoare triple {98397#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98397#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:08,164 INFO L290 TraceCheckUtils]: 117: Hoare triple {98397#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98398#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:08,164 INFO L290 TraceCheckUtils]: 118: Hoare triple {98398#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98398#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:08,165 INFO L290 TraceCheckUtils]: 119: Hoare triple {98398#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98399#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:08,165 INFO L290 TraceCheckUtils]: 120: Hoare triple {98399#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98399#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:08,165 INFO L290 TraceCheckUtils]: 121: Hoare triple {98399#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98400#(<= main_~i~0 58)} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 122: Hoare triple {98400#(<= main_~i~0 58)} assume !(~i~0 < 1024); {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 123: Hoare triple {98338#false} ~i~0 := 0; {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 124: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 125: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 126: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 127: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 128: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 129: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 130: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 131: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 132: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 133: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 134: Hoare triple {98338#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L272 TraceCheckUtils]: 135: Hoare triple {98338#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 136: Hoare triple {98338#false} ~cond := #in~cond; {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 137: Hoare triple {98338#false} assume 0 == ~cond; {98338#false} is VALID [2022-04-15 12:23:08,166 INFO L290 TraceCheckUtils]: 138: Hoare triple {98338#false} assume !false; {98338#false} is VALID [2022-04-15 12:23:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:23:08,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:23:11,672 INFO L290 TraceCheckUtils]: 138: Hoare triple {98338#false} assume !false; {98338#false} is VALID [2022-04-15 12:23:11,672 INFO L290 TraceCheckUtils]: 137: Hoare triple {98338#false} assume 0 == ~cond; {98338#false} is VALID [2022-04-15 12:23:11,672 INFO L290 TraceCheckUtils]: 136: Hoare triple {98338#false} ~cond := #in~cond; {98338#false} is VALID [2022-04-15 12:23:11,672 INFO L272 TraceCheckUtils]: 135: Hoare triple {98338#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {98338#false} is VALID [2022-04-15 12:23:11,672 INFO L290 TraceCheckUtils]: 134: Hoare triple {98338#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 12:23:11,672 INFO L290 TraceCheckUtils]: 133: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 12:23:11,673 INFO L290 TraceCheckUtils]: 132: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 12:23:11,673 INFO L290 TraceCheckUtils]: 131: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-15 12:23:11,673 INFO L290 TraceCheckUtils]: 130: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 12:23:11,673 INFO L290 TraceCheckUtils]: 129: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 12:23:11,673 INFO L290 TraceCheckUtils]: 128: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 12:23:11,673 INFO L290 TraceCheckUtils]: 127: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-15 12:23:11,673 INFO L290 TraceCheckUtils]: 126: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 12:23:11,673 INFO L290 TraceCheckUtils]: 125: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 12:23:11,673 INFO L290 TraceCheckUtils]: 124: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 12:23:11,673 INFO L290 TraceCheckUtils]: 123: Hoare triple {98338#false} ~i~0 := 0; {98338#false} is VALID [2022-04-15 12:23:11,673 INFO L290 TraceCheckUtils]: 122: Hoare triple {98868#(< main_~i~0 1024)} assume !(~i~0 < 1024); {98338#false} is VALID [2022-04-15 12:23:11,674 INFO L290 TraceCheckUtils]: 121: Hoare triple {98872#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98868#(< main_~i~0 1024)} is VALID [2022-04-15 12:23:11,674 INFO L290 TraceCheckUtils]: 120: Hoare triple {98872#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98872#(< main_~i~0 1023)} is VALID [2022-04-15 12:23:11,674 INFO L290 TraceCheckUtils]: 119: Hoare triple {98879#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98872#(< main_~i~0 1023)} is VALID [2022-04-15 12:23:11,674 INFO L290 TraceCheckUtils]: 118: Hoare triple {98879#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98879#(< main_~i~0 1022)} is VALID [2022-04-15 12:23:11,675 INFO L290 TraceCheckUtils]: 117: Hoare triple {98886#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98879#(< main_~i~0 1022)} is VALID [2022-04-15 12:23:11,675 INFO L290 TraceCheckUtils]: 116: Hoare triple {98886#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98886#(< main_~i~0 1021)} is VALID [2022-04-15 12:23:11,675 INFO L290 TraceCheckUtils]: 115: Hoare triple {98893#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98886#(< main_~i~0 1021)} is VALID [2022-04-15 12:23:11,676 INFO L290 TraceCheckUtils]: 114: Hoare triple {98893#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98893#(< main_~i~0 1020)} is VALID [2022-04-15 12:23:11,676 INFO L290 TraceCheckUtils]: 113: Hoare triple {98900#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98893#(< main_~i~0 1020)} is VALID [2022-04-15 12:23:11,676 INFO L290 TraceCheckUtils]: 112: Hoare triple {98900#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98900#(< main_~i~0 1019)} is VALID [2022-04-15 12:23:11,676 INFO L290 TraceCheckUtils]: 111: Hoare triple {98907#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98900#(< main_~i~0 1019)} is VALID [2022-04-15 12:23:11,677 INFO L290 TraceCheckUtils]: 110: Hoare triple {98907#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98907#(< main_~i~0 1018)} is VALID [2022-04-15 12:23:11,677 INFO L290 TraceCheckUtils]: 109: Hoare triple {98914#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98907#(< main_~i~0 1018)} is VALID [2022-04-15 12:23:11,677 INFO L290 TraceCheckUtils]: 108: Hoare triple {98914#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98914#(< main_~i~0 1017)} is VALID [2022-04-15 12:23:11,678 INFO L290 TraceCheckUtils]: 107: Hoare triple {98921#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98914#(< main_~i~0 1017)} is VALID [2022-04-15 12:23:11,678 INFO L290 TraceCheckUtils]: 106: Hoare triple {98921#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98921#(< main_~i~0 1016)} is VALID [2022-04-15 12:23:11,678 INFO L290 TraceCheckUtils]: 105: Hoare triple {98928#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98921#(< main_~i~0 1016)} is VALID [2022-04-15 12:23:11,678 INFO L290 TraceCheckUtils]: 104: Hoare triple {98928#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98928#(< main_~i~0 1015)} is VALID [2022-04-15 12:23:11,679 INFO L290 TraceCheckUtils]: 103: Hoare triple {98935#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98928#(< main_~i~0 1015)} is VALID [2022-04-15 12:23:11,679 INFO L290 TraceCheckUtils]: 102: Hoare triple {98935#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98935#(< main_~i~0 1014)} is VALID [2022-04-15 12:23:11,679 INFO L290 TraceCheckUtils]: 101: Hoare triple {98942#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98935#(< main_~i~0 1014)} is VALID [2022-04-15 12:23:11,680 INFO L290 TraceCheckUtils]: 100: Hoare triple {98942#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98942#(< main_~i~0 1013)} is VALID [2022-04-15 12:23:11,680 INFO L290 TraceCheckUtils]: 99: Hoare triple {98949#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98942#(< main_~i~0 1013)} is VALID [2022-04-15 12:23:11,680 INFO L290 TraceCheckUtils]: 98: Hoare triple {98949#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98949#(< main_~i~0 1012)} is VALID [2022-04-15 12:23:11,680 INFO L290 TraceCheckUtils]: 97: Hoare triple {98956#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98949#(< main_~i~0 1012)} is VALID [2022-04-15 12:23:11,681 INFO L290 TraceCheckUtils]: 96: Hoare triple {98956#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98956#(< main_~i~0 1011)} is VALID [2022-04-15 12:23:11,681 INFO L290 TraceCheckUtils]: 95: Hoare triple {98963#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98956#(< main_~i~0 1011)} is VALID [2022-04-15 12:23:11,681 INFO L290 TraceCheckUtils]: 94: Hoare triple {98963#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98963#(< main_~i~0 1010)} is VALID [2022-04-15 12:23:11,682 INFO L290 TraceCheckUtils]: 93: Hoare triple {98970#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98963#(< main_~i~0 1010)} is VALID [2022-04-15 12:23:11,682 INFO L290 TraceCheckUtils]: 92: Hoare triple {98970#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98970#(< main_~i~0 1009)} is VALID [2022-04-15 12:23:11,682 INFO L290 TraceCheckUtils]: 91: Hoare triple {98977#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98970#(< main_~i~0 1009)} is VALID [2022-04-15 12:23:11,682 INFO L290 TraceCheckUtils]: 90: Hoare triple {98977#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98977#(< main_~i~0 1008)} is VALID [2022-04-15 12:23:11,683 INFO L290 TraceCheckUtils]: 89: Hoare triple {98984#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98977#(< main_~i~0 1008)} is VALID [2022-04-15 12:23:11,683 INFO L290 TraceCheckUtils]: 88: Hoare triple {98984#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98984#(< main_~i~0 1007)} is VALID [2022-04-15 12:23:11,683 INFO L290 TraceCheckUtils]: 87: Hoare triple {98991#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98984#(< main_~i~0 1007)} is VALID [2022-04-15 12:23:11,683 INFO L290 TraceCheckUtils]: 86: Hoare triple {98991#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98991#(< main_~i~0 1006)} is VALID [2022-04-15 12:23:11,684 INFO L290 TraceCheckUtils]: 85: Hoare triple {98998#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98991#(< main_~i~0 1006)} is VALID [2022-04-15 12:23:11,684 INFO L290 TraceCheckUtils]: 84: Hoare triple {98998#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98998#(< main_~i~0 1005)} is VALID [2022-04-15 12:23:11,684 INFO L290 TraceCheckUtils]: 83: Hoare triple {99005#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98998#(< main_~i~0 1005)} is VALID [2022-04-15 12:23:11,685 INFO L290 TraceCheckUtils]: 82: Hoare triple {99005#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99005#(< main_~i~0 1004)} is VALID [2022-04-15 12:23:11,685 INFO L290 TraceCheckUtils]: 81: Hoare triple {99012#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99005#(< main_~i~0 1004)} is VALID [2022-04-15 12:23:11,685 INFO L290 TraceCheckUtils]: 80: Hoare triple {99012#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99012#(< main_~i~0 1003)} is VALID [2022-04-15 12:23:11,686 INFO L290 TraceCheckUtils]: 79: Hoare triple {99019#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99012#(< main_~i~0 1003)} is VALID [2022-04-15 12:23:11,686 INFO L290 TraceCheckUtils]: 78: Hoare triple {99019#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99019#(< main_~i~0 1002)} is VALID [2022-04-15 12:23:11,686 INFO L290 TraceCheckUtils]: 77: Hoare triple {99026#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99019#(< main_~i~0 1002)} is VALID [2022-04-15 12:23:11,686 INFO L290 TraceCheckUtils]: 76: Hoare triple {99026#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99026#(< main_~i~0 1001)} is VALID [2022-04-15 12:23:11,687 INFO L290 TraceCheckUtils]: 75: Hoare triple {99033#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99026#(< main_~i~0 1001)} is VALID [2022-04-15 12:23:11,687 INFO L290 TraceCheckUtils]: 74: Hoare triple {99033#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99033#(< main_~i~0 1000)} is VALID [2022-04-15 12:23:11,687 INFO L290 TraceCheckUtils]: 73: Hoare triple {99040#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99033#(< main_~i~0 1000)} is VALID [2022-04-15 12:23:11,687 INFO L290 TraceCheckUtils]: 72: Hoare triple {99040#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99040#(< main_~i~0 999)} is VALID [2022-04-15 12:23:11,688 INFO L290 TraceCheckUtils]: 71: Hoare triple {99047#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99040#(< main_~i~0 999)} is VALID [2022-04-15 12:23:11,688 INFO L290 TraceCheckUtils]: 70: Hoare triple {99047#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99047#(< main_~i~0 998)} is VALID [2022-04-15 12:23:11,688 INFO L290 TraceCheckUtils]: 69: Hoare triple {99054#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99047#(< main_~i~0 998)} is VALID [2022-04-15 12:23:11,689 INFO L290 TraceCheckUtils]: 68: Hoare triple {99054#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99054#(< main_~i~0 997)} is VALID [2022-04-15 12:23:11,689 INFO L290 TraceCheckUtils]: 67: Hoare triple {99061#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99054#(< main_~i~0 997)} is VALID [2022-04-15 12:23:11,689 INFO L290 TraceCheckUtils]: 66: Hoare triple {99061#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99061#(< main_~i~0 996)} is VALID [2022-04-15 12:23:11,689 INFO L290 TraceCheckUtils]: 65: Hoare triple {99068#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99061#(< main_~i~0 996)} is VALID [2022-04-15 12:23:11,690 INFO L290 TraceCheckUtils]: 64: Hoare triple {99068#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99068#(< main_~i~0 995)} is VALID [2022-04-15 12:23:11,690 INFO L290 TraceCheckUtils]: 63: Hoare triple {99075#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99068#(< main_~i~0 995)} is VALID [2022-04-15 12:23:11,690 INFO L290 TraceCheckUtils]: 62: Hoare triple {99075#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99075#(< main_~i~0 994)} is VALID [2022-04-15 12:23:11,691 INFO L290 TraceCheckUtils]: 61: Hoare triple {99082#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99075#(< main_~i~0 994)} is VALID [2022-04-15 12:23:11,691 INFO L290 TraceCheckUtils]: 60: Hoare triple {99082#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99082#(< main_~i~0 993)} is VALID [2022-04-15 12:23:11,691 INFO L290 TraceCheckUtils]: 59: Hoare triple {99089#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99082#(< main_~i~0 993)} is VALID [2022-04-15 12:23:11,691 INFO L290 TraceCheckUtils]: 58: Hoare triple {99089#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99089#(< main_~i~0 992)} is VALID [2022-04-15 12:23:11,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {99096#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99089#(< main_~i~0 992)} is VALID [2022-04-15 12:23:11,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {99096#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99096#(< main_~i~0 991)} is VALID [2022-04-15 12:23:11,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {99103#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99096#(< main_~i~0 991)} is VALID [2022-04-15 12:23:11,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {99103#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99103#(< main_~i~0 990)} is VALID [2022-04-15 12:23:11,693 INFO L290 TraceCheckUtils]: 53: Hoare triple {99110#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99103#(< main_~i~0 990)} is VALID [2022-04-15 12:23:11,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {99110#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99110#(< main_~i~0 989)} is VALID [2022-04-15 12:23:11,693 INFO L290 TraceCheckUtils]: 51: Hoare triple {99117#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99110#(< main_~i~0 989)} is VALID [2022-04-15 12:23:11,694 INFO L290 TraceCheckUtils]: 50: Hoare triple {99117#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99117#(< main_~i~0 988)} is VALID [2022-04-15 12:23:11,694 INFO L290 TraceCheckUtils]: 49: Hoare triple {99124#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99117#(< main_~i~0 988)} is VALID [2022-04-15 12:23:11,694 INFO L290 TraceCheckUtils]: 48: Hoare triple {99124#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99124#(< main_~i~0 987)} is VALID [2022-04-15 12:23:11,694 INFO L290 TraceCheckUtils]: 47: Hoare triple {99131#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99124#(< main_~i~0 987)} is VALID [2022-04-15 12:23:11,695 INFO L290 TraceCheckUtils]: 46: Hoare triple {99131#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99131#(< main_~i~0 986)} is VALID [2022-04-15 12:23:11,695 INFO L290 TraceCheckUtils]: 45: Hoare triple {99138#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99131#(< main_~i~0 986)} is VALID [2022-04-15 12:23:11,695 INFO L290 TraceCheckUtils]: 44: Hoare triple {99138#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99138#(< main_~i~0 985)} is VALID [2022-04-15 12:23:11,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {99145#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99138#(< main_~i~0 985)} is VALID [2022-04-15 12:23:11,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {99145#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99145#(< main_~i~0 984)} is VALID [2022-04-15 12:23:11,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {99152#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99145#(< main_~i~0 984)} is VALID [2022-04-15 12:23:11,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {99152#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99152#(< main_~i~0 983)} is VALID [2022-04-15 12:23:11,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {99159#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99152#(< main_~i~0 983)} is VALID [2022-04-15 12:23:11,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {99159#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99159#(< main_~i~0 982)} is VALID [2022-04-15 12:23:11,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {99166#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99159#(< main_~i~0 982)} is VALID [2022-04-15 12:23:11,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {99166#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99166#(< main_~i~0 981)} is VALID [2022-04-15 12:23:11,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {99173#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99166#(< main_~i~0 981)} is VALID [2022-04-15 12:23:11,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {99173#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99173#(< main_~i~0 980)} is VALID [2022-04-15 12:23:11,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {99180#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99173#(< main_~i~0 980)} is VALID [2022-04-15 12:23:11,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {99180#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99180#(< main_~i~0 979)} is VALID [2022-04-15 12:23:11,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {99187#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99180#(< main_~i~0 979)} is VALID [2022-04-15 12:23:11,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {99187#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99187#(< main_~i~0 978)} is VALID [2022-04-15 12:23:11,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {99194#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99187#(< main_~i~0 978)} is VALID [2022-04-15 12:23:11,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {99194#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99194#(< main_~i~0 977)} is VALID [2022-04-15 12:23:11,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {99201#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99194#(< main_~i~0 977)} is VALID [2022-04-15 12:23:11,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {99201#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99201#(< main_~i~0 976)} is VALID [2022-04-15 12:23:11,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {99208#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99201#(< main_~i~0 976)} is VALID [2022-04-15 12:23:11,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {99208#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99208#(< main_~i~0 975)} is VALID [2022-04-15 12:23:11,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {99215#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99208#(< main_~i~0 975)} is VALID [2022-04-15 12:23:11,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {99215#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99215#(< main_~i~0 974)} is VALID [2022-04-15 12:23:11,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {99222#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99215#(< main_~i~0 974)} is VALID [2022-04-15 12:23:11,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {99222#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99222#(< main_~i~0 973)} is VALID [2022-04-15 12:23:11,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {99229#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99222#(< main_~i~0 973)} is VALID [2022-04-15 12:23:11,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {99229#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99229#(< main_~i~0 972)} is VALID [2022-04-15 12:23:11,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {99236#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99229#(< main_~i~0 972)} is VALID [2022-04-15 12:23:11,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {99236#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99236#(< main_~i~0 971)} is VALID [2022-04-15 12:23:11,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {99243#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99236#(< main_~i~0 971)} is VALID [2022-04-15 12:23:11,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {99243#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99243#(< main_~i~0 970)} is VALID [2022-04-15 12:23:11,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {99250#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99243#(< main_~i~0 970)} is VALID [2022-04-15 12:23:11,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {99250#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99250#(< main_~i~0 969)} is VALID [2022-04-15 12:23:11,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {99257#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99250#(< main_~i~0 969)} is VALID [2022-04-15 12:23:11,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {99257#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99257#(< main_~i~0 968)} is VALID [2022-04-15 12:23:11,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {99264#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99257#(< main_~i~0 968)} is VALID [2022-04-15 12:23:11,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {99264#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99264#(< main_~i~0 967)} is VALID [2022-04-15 12:23:11,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {99271#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99264#(< main_~i~0 967)} is VALID [2022-04-15 12:23:11,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {99271#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99271#(< main_~i~0 966)} is VALID [2022-04-15 12:23:11,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {98337#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {99271#(< main_~i~0 966)} is VALID [2022-04-15 12:23:11,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {98337#true} call #t~ret6 := main(); {98337#true} is VALID [2022-04-15 12:23:11,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98337#true} {98337#true} #64#return; {98337#true} is VALID [2022-04-15 12:23:11,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {98337#true} assume true; {98337#true} is VALID [2022-04-15 12:23:11,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {98337#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {98337#true} is VALID [2022-04-15 12:23:11,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {98337#true} call ULTIMATE.init(); {98337#true} is VALID [2022-04-15 12:23:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:23:11,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516406579] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:23:11,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:23:11,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 122 [2022-04-15 12:23:11,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:23:11,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1230875395] [2022-04-15 12:23:11,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1230875395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:23:11,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:23:11,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-15 12:23:11,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013606484] [2022-04-15 12:23:11,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:23:11,708 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-15 12:23:11,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:23:11,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:11,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:11,783 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-15 12:23:11,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:11,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-15 12:23:11,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7262, Invalid=7500, Unknown=0, NotChecked=0, Total=14762 [2022-04-15 12:23:11,784 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:25,539 INFO L93 Difference]: Finished difference Result 446 states and 568 transitions. [2022-04-15 12:23:25,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-15 12:23:25,540 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-15 12:23:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:23:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 559 transitions. [2022-04-15 12:23:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 559 transitions. [2022-04-15 12:23:25,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 559 transitions. [2022-04-15 12:23:25,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:25,907 INFO L225 Difference]: With dead ends: 446 [2022-04-15 12:23:25,907 INFO L226 Difference]: Without dead ends: 429 [2022-04-15 12:23:25,909 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=14402, Invalid=18178, Unknown=0, NotChecked=0, Total=32580 [2022-04-15 12:23:25,909 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1398 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:23:25,909 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1398 Valid, 42 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:23:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-04-15 12:23:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 142. [2022-04-15 12:23:26,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:23:26,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:26,760 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:26,760 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:26,767 INFO L93 Difference]: Finished difference Result 429 states and 547 transitions. [2022-04-15 12:23:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 547 transitions. [2022-04-15 12:23:26,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:26,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:26,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 429 states. [2022-04-15 12:23:26,767 INFO L87 Difference]: Start difference. First operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 429 states. [2022-04-15 12:23:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:26,774 INFO L93 Difference]: Finished difference Result 429 states and 547 transitions. [2022-04-15 12:23:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 547 transitions. [2022-04-15 12:23:26,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:26,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:26,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:23:26,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:23:26,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:26,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 146 transitions. [2022-04-15 12:23:26,776 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 146 transitions. Word has length 139 [2022-04-15 12:23:26,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:23:26,776 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 146 transitions. [2022-04-15 12:23:26,776 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:26,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 146 transitions. [2022-04-15 12:23:27,141 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:23:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2022-04-15 12:23:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-15 12:23:27,142 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:23:27,142 INFO L499 BasicCegarLoop]: trace histogram [59, 59, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:23:27,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-15 12:23:27,347 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:23:27,347 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:23:27,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:23:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1827862951, now seen corresponding path program 119 times [2022-04-15 12:23:27,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:27,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1005115237] [2022-04-15 12:23:27,351 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:23:27,351 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:23:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1827862951, now seen corresponding path program 120 times [2022-04-15 12:23:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:23:27,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164778493] [2022-04-15 12:23:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:23:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:23:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:28,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:23:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:28,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {101512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {101447#true} is VALID [2022-04-15 12:23:28,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {101447#true} assume true; {101447#true} is VALID [2022-04-15 12:23:28,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {101447#true} {101447#true} #64#return; {101447#true} is VALID [2022-04-15 12:23:28,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {101447#true} call ULTIMATE.init(); {101512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:23:28,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {101512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {101447#true} is VALID [2022-04-15 12:23:28,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {101447#true} assume true; {101447#true} is VALID [2022-04-15 12:23:28,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101447#true} {101447#true} #64#return; {101447#true} is VALID [2022-04-15 12:23:28,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {101447#true} call #t~ret6 := main(); {101447#true} is VALID [2022-04-15 12:23:28,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {101447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101452#(= main_~i~0 0)} is VALID [2022-04-15 12:23:28,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {101452#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101452#(= main_~i~0 0)} is VALID [2022-04-15 12:23:28,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {101452#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101453#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:28,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {101453#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101453#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:28,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {101453#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101454#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:28,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {101454#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101454#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:28,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {101454#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101455#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:28,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {101455#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101455#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:28,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {101455#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101456#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:28,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {101456#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101456#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:28,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {101456#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101457#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:28,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {101457#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101457#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:28,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {101457#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101458#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:28,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {101458#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101458#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:28,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {101458#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101459#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:28,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {101459#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101459#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:28,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {101459#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101460#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:28,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {101460#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101460#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:28,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {101460#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101461#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:28,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {101461#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101461#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:28,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {101461#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101462#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:28,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {101462#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101462#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:28,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {101462#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101463#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:28,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {101463#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101463#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:28,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {101463#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101464#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:28,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {101464#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101464#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:28,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {101464#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101465#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:28,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {101465#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101465#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:28,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {101465#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101466#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:28,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {101466#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101466#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:28,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {101466#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101467#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:28,529 INFO L290 TraceCheckUtils]: 36: Hoare triple {101467#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101467#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:28,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {101467#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101468#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:28,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {101468#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101468#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:28,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {101468#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101469#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:28,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {101469#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101469#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:28,530 INFO L290 TraceCheckUtils]: 41: Hoare triple {101469#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101470#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:28,530 INFO L290 TraceCheckUtils]: 42: Hoare triple {101470#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101470#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:28,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {101470#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101471#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:28,531 INFO L290 TraceCheckUtils]: 44: Hoare triple {101471#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101471#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:28,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {101471#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101472#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:28,531 INFO L290 TraceCheckUtils]: 46: Hoare triple {101472#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101472#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:28,532 INFO L290 TraceCheckUtils]: 47: Hoare triple {101472#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101473#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:28,532 INFO L290 TraceCheckUtils]: 48: Hoare triple {101473#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101473#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:28,532 INFO L290 TraceCheckUtils]: 49: Hoare triple {101473#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101474#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:28,533 INFO L290 TraceCheckUtils]: 50: Hoare triple {101474#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101474#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:28,533 INFO L290 TraceCheckUtils]: 51: Hoare triple {101474#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101475#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:28,533 INFO L290 TraceCheckUtils]: 52: Hoare triple {101475#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101475#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:28,533 INFO L290 TraceCheckUtils]: 53: Hoare triple {101475#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101476#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:28,534 INFO L290 TraceCheckUtils]: 54: Hoare triple {101476#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101476#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:28,534 INFO L290 TraceCheckUtils]: 55: Hoare triple {101476#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101477#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:28,534 INFO L290 TraceCheckUtils]: 56: Hoare triple {101477#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101477#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:28,534 INFO L290 TraceCheckUtils]: 57: Hoare triple {101477#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101478#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:28,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {101478#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101478#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:28,535 INFO L290 TraceCheckUtils]: 59: Hoare triple {101478#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101479#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:28,535 INFO L290 TraceCheckUtils]: 60: Hoare triple {101479#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101479#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:28,536 INFO L290 TraceCheckUtils]: 61: Hoare triple {101479#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101480#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:28,536 INFO L290 TraceCheckUtils]: 62: Hoare triple {101480#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101480#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:28,536 INFO L290 TraceCheckUtils]: 63: Hoare triple {101480#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101481#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:28,536 INFO L290 TraceCheckUtils]: 64: Hoare triple {101481#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101481#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:28,537 INFO L290 TraceCheckUtils]: 65: Hoare triple {101481#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101482#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:28,537 INFO L290 TraceCheckUtils]: 66: Hoare triple {101482#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101482#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:28,537 INFO L290 TraceCheckUtils]: 67: Hoare triple {101482#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101483#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:28,537 INFO L290 TraceCheckUtils]: 68: Hoare triple {101483#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101483#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:28,538 INFO L290 TraceCheckUtils]: 69: Hoare triple {101483#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101484#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:28,538 INFO L290 TraceCheckUtils]: 70: Hoare triple {101484#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101484#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:28,538 INFO L290 TraceCheckUtils]: 71: Hoare triple {101484#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101485#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:28,539 INFO L290 TraceCheckUtils]: 72: Hoare triple {101485#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101485#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:28,539 INFO L290 TraceCheckUtils]: 73: Hoare triple {101485#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101486#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:28,539 INFO L290 TraceCheckUtils]: 74: Hoare triple {101486#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101486#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:28,539 INFO L290 TraceCheckUtils]: 75: Hoare triple {101486#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101487#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:28,540 INFO L290 TraceCheckUtils]: 76: Hoare triple {101487#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101487#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:28,540 INFO L290 TraceCheckUtils]: 77: Hoare triple {101487#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101488#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:28,540 INFO L290 TraceCheckUtils]: 78: Hoare triple {101488#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101488#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:28,541 INFO L290 TraceCheckUtils]: 79: Hoare triple {101488#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101489#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:28,541 INFO L290 TraceCheckUtils]: 80: Hoare triple {101489#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101489#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:28,541 INFO L290 TraceCheckUtils]: 81: Hoare triple {101489#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101490#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:28,541 INFO L290 TraceCheckUtils]: 82: Hoare triple {101490#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101490#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:28,542 INFO L290 TraceCheckUtils]: 83: Hoare triple {101490#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101491#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:28,542 INFO L290 TraceCheckUtils]: 84: Hoare triple {101491#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101491#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:28,542 INFO L290 TraceCheckUtils]: 85: Hoare triple {101491#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101492#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:28,542 INFO L290 TraceCheckUtils]: 86: Hoare triple {101492#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101492#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:28,543 INFO L290 TraceCheckUtils]: 87: Hoare triple {101492#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101493#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:28,543 INFO L290 TraceCheckUtils]: 88: Hoare triple {101493#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101493#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:28,543 INFO L290 TraceCheckUtils]: 89: Hoare triple {101493#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101494#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:28,543 INFO L290 TraceCheckUtils]: 90: Hoare triple {101494#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101494#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:28,544 INFO L290 TraceCheckUtils]: 91: Hoare triple {101494#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101495#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:28,544 INFO L290 TraceCheckUtils]: 92: Hoare triple {101495#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101495#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:28,544 INFO L290 TraceCheckUtils]: 93: Hoare triple {101495#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101496#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:28,545 INFO L290 TraceCheckUtils]: 94: Hoare triple {101496#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101496#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:28,545 INFO L290 TraceCheckUtils]: 95: Hoare triple {101496#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101497#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:28,545 INFO L290 TraceCheckUtils]: 96: Hoare triple {101497#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101497#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:28,545 INFO L290 TraceCheckUtils]: 97: Hoare triple {101497#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101498#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:28,546 INFO L290 TraceCheckUtils]: 98: Hoare triple {101498#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101498#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:28,546 INFO L290 TraceCheckUtils]: 99: Hoare triple {101498#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101499#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:28,546 INFO L290 TraceCheckUtils]: 100: Hoare triple {101499#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101499#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:28,547 INFO L290 TraceCheckUtils]: 101: Hoare triple {101499#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101500#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:28,547 INFO L290 TraceCheckUtils]: 102: Hoare triple {101500#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101500#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:28,547 INFO L290 TraceCheckUtils]: 103: Hoare triple {101500#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101501#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:28,547 INFO L290 TraceCheckUtils]: 104: Hoare triple {101501#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101501#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:28,548 INFO L290 TraceCheckUtils]: 105: Hoare triple {101501#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101502#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:28,548 INFO L290 TraceCheckUtils]: 106: Hoare triple {101502#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101502#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:28,548 INFO L290 TraceCheckUtils]: 107: Hoare triple {101502#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101503#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:28,548 INFO L290 TraceCheckUtils]: 108: Hoare triple {101503#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101503#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:28,549 INFO L290 TraceCheckUtils]: 109: Hoare triple {101503#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101504#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:28,549 INFO L290 TraceCheckUtils]: 110: Hoare triple {101504#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101504#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:28,549 INFO L290 TraceCheckUtils]: 111: Hoare triple {101504#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101505#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:28,549 INFO L290 TraceCheckUtils]: 112: Hoare triple {101505#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101505#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:28,550 INFO L290 TraceCheckUtils]: 113: Hoare triple {101505#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101506#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:28,550 INFO L290 TraceCheckUtils]: 114: Hoare triple {101506#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101506#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:28,550 INFO L290 TraceCheckUtils]: 115: Hoare triple {101506#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101507#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:28,551 INFO L290 TraceCheckUtils]: 116: Hoare triple {101507#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101507#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:28,551 INFO L290 TraceCheckUtils]: 117: Hoare triple {101507#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101508#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:28,551 INFO L290 TraceCheckUtils]: 118: Hoare triple {101508#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101508#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:28,551 INFO L290 TraceCheckUtils]: 119: Hoare triple {101508#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101509#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:28,552 INFO L290 TraceCheckUtils]: 120: Hoare triple {101509#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101509#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:28,552 INFO L290 TraceCheckUtils]: 121: Hoare triple {101509#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101510#(<= main_~i~0 58)} is VALID [2022-04-15 12:23:28,552 INFO L290 TraceCheckUtils]: 122: Hoare triple {101510#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101510#(<= main_~i~0 58)} is VALID [2022-04-15 12:23:28,553 INFO L290 TraceCheckUtils]: 123: Hoare triple {101510#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101511#(<= main_~i~0 59)} is VALID [2022-04-15 12:23:28,553 INFO L290 TraceCheckUtils]: 124: Hoare triple {101511#(<= main_~i~0 59)} assume !(~i~0 < 1024); {101448#false} is VALID [2022-04-15 12:23:28,553 INFO L290 TraceCheckUtils]: 125: Hoare triple {101448#false} ~i~0 := 0; {101448#false} is VALID [2022-04-15 12:23:28,553 INFO L290 TraceCheckUtils]: 126: Hoare triple {101448#false} #t~short5 := ~i~0 < 1024; {101448#false} is VALID [2022-04-15 12:23:28,553 INFO L290 TraceCheckUtils]: 127: Hoare triple {101448#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101448#false} is VALID [2022-04-15 12:23:28,553 INFO L290 TraceCheckUtils]: 128: Hoare triple {101448#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101448#false} is VALID [2022-04-15 12:23:28,553 INFO L290 TraceCheckUtils]: 129: Hoare triple {101448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101448#false} is VALID [2022-04-15 12:23:28,553 INFO L290 TraceCheckUtils]: 130: Hoare triple {101448#false} #t~short5 := ~i~0 < 1024; {101448#false} is VALID [2022-04-15 12:23:28,553 INFO L290 TraceCheckUtils]: 131: Hoare triple {101448#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101448#false} is VALID [2022-04-15 12:23:28,553 INFO L290 TraceCheckUtils]: 132: Hoare triple {101448#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101448#false} is VALID [2022-04-15 12:23:28,553 INFO L290 TraceCheckUtils]: 133: Hoare triple {101448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101448#false} is VALID [2022-04-15 12:23:28,553 INFO L290 TraceCheckUtils]: 134: Hoare triple {101448#false} #t~short5 := ~i~0 < 1024; {101448#false} is VALID [2022-04-15 12:23:28,553 INFO L290 TraceCheckUtils]: 135: Hoare triple {101448#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101448#false} is VALID [2022-04-15 12:23:28,553 INFO L290 TraceCheckUtils]: 136: Hoare triple {101448#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {101448#false} is VALID [2022-04-15 12:23:28,553 INFO L272 TraceCheckUtils]: 137: Hoare triple {101448#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {101448#false} is VALID [2022-04-15 12:23:28,554 INFO L290 TraceCheckUtils]: 138: Hoare triple {101448#false} ~cond := #in~cond; {101448#false} is VALID [2022-04-15 12:23:28,554 INFO L290 TraceCheckUtils]: 139: Hoare triple {101448#false} assume 0 == ~cond; {101448#false} is VALID [2022-04-15 12:23:28,554 INFO L290 TraceCheckUtils]: 140: Hoare triple {101448#false} assume !false; {101448#false} is VALID [2022-04-15 12:23:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3491 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:23:28,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:23:28,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164778493] [2022-04-15 12:23:28,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164778493] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:23:28,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952426701] [2022-04-15 12:23:28,554 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:23:28,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:23:28,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:23:28,555 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:23:28,556 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:23:28,893 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:23:28,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:23:28,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:23:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:28,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:23:29,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {101447#true} call ULTIMATE.init(); {101447#true} is VALID [2022-04-15 12:23:29,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {101447#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {101447#true} is VALID [2022-04-15 12:23:29,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {101447#true} assume true; {101447#true} is VALID [2022-04-15 12:23:29,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101447#true} {101447#true} #64#return; {101447#true} is VALID [2022-04-15 12:23:29,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {101447#true} call #t~ret6 := main(); {101447#true} is VALID [2022-04-15 12:23:29,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {101447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101447#true} is VALID [2022-04-15 12:23:29,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,180 INFO L290 TraceCheckUtils]: 46: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 47: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 49: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 50: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 51: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 52: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 53: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 55: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 56: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 57: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 59: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 62: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 63: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 64: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 67: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 71: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 72: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 73: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 74: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 75: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 76: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 77: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 78: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 79: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 80: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 81: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 82: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 83: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,182 INFO L290 TraceCheckUtils]: 84: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 85: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 86: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 87: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 88: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 89: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 90: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 91: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 92: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 93: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 94: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 95: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 96: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 97: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 98: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 99: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 100: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 101: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 102: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 103: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,183 INFO L290 TraceCheckUtils]: 104: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 105: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 106: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 107: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 108: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 109: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 110: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 111: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 112: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 113: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 114: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 115: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 116: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 117: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 118: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 119: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 120: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 121: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 122: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 123: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,184 INFO L290 TraceCheckUtils]: 124: Hoare triple {101447#true} assume !(~i~0 < 1024); {101447#true} is VALID [2022-04-15 12:23:29,185 INFO L290 TraceCheckUtils]: 125: Hoare triple {101447#true} ~i~0 := 0; {101891#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:29,185 INFO L290 TraceCheckUtils]: 126: Hoare triple {101891#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {101891#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:29,185 INFO L290 TraceCheckUtils]: 127: Hoare triple {101891#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101891#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:29,185 INFO L290 TraceCheckUtils]: 128: Hoare triple {101891#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101891#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:29,186 INFO L290 TraceCheckUtils]: 129: Hoare triple {101891#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101453#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:29,186 INFO L290 TraceCheckUtils]: 130: Hoare triple {101453#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {101453#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:29,186 INFO L290 TraceCheckUtils]: 131: Hoare triple {101453#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101453#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:29,186 INFO L290 TraceCheckUtils]: 132: Hoare triple {101453#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101453#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:29,187 INFO L290 TraceCheckUtils]: 133: Hoare triple {101453#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101454#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:29,187 INFO L290 TraceCheckUtils]: 134: Hoare triple {101454#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {101454#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:29,187 INFO L290 TraceCheckUtils]: 135: Hoare triple {101454#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101454#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:29,188 INFO L290 TraceCheckUtils]: 136: Hoare triple {101454#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {101454#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:29,188 INFO L272 TraceCheckUtils]: 137: Hoare triple {101454#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {101928#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:23:29,188 INFO L290 TraceCheckUtils]: 138: Hoare triple {101928#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {101932#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:23:29,188 INFO L290 TraceCheckUtils]: 139: Hoare triple {101932#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {101448#false} is VALID [2022-04-15 12:23:29,189 INFO L290 TraceCheckUtils]: 140: Hoare triple {101448#false} assume !false; {101448#false} is VALID [2022-04-15 12:23:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3491 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2022-04-15 12:23:29,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:23:29,506 INFO L290 TraceCheckUtils]: 140: Hoare triple {101448#false} assume !false; {101448#false} is VALID [2022-04-15 12:23:29,506 INFO L290 TraceCheckUtils]: 139: Hoare triple {101932#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {101448#false} is VALID [2022-04-15 12:23:29,507 INFO L290 TraceCheckUtils]: 138: Hoare triple {101928#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {101932#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:23:29,507 INFO L272 TraceCheckUtils]: 137: Hoare triple {101948#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {101928#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:23:29,507 INFO L290 TraceCheckUtils]: 136: Hoare triple {101948#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {101948#(<= main_~i~0 512)} is VALID [2022-04-15 12:23:29,508 INFO L290 TraceCheckUtils]: 135: Hoare triple {101948#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101948#(<= main_~i~0 512)} is VALID [2022-04-15 12:23:29,508 INFO L290 TraceCheckUtils]: 134: Hoare triple {101948#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {101948#(<= main_~i~0 512)} is VALID [2022-04-15 12:23:29,508 INFO L290 TraceCheckUtils]: 133: Hoare triple {101961#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101948#(<= main_~i~0 512)} is VALID [2022-04-15 12:23:29,508 INFO L290 TraceCheckUtils]: 132: Hoare triple {101961#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101961#(<= main_~i~0 511)} is VALID [2022-04-15 12:23:29,509 INFO L290 TraceCheckUtils]: 131: Hoare triple {101961#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101961#(<= main_~i~0 511)} is VALID [2022-04-15 12:23:29,509 INFO L290 TraceCheckUtils]: 130: Hoare triple {101961#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {101961#(<= main_~i~0 511)} is VALID [2022-04-15 12:23:29,509 INFO L290 TraceCheckUtils]: 129: Hoare triple {101974#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101961#(<= main_~i~0 511)} is VALID [2022-04-15 12:23:29,509 INFO L290 TraceCheckUtils]: 128: Hoare triple {101974#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101974#(<= main_~i~0 510)} is VALID [2022-04-15 12:23:29,510 INFO L290 TraceCheckUtils]: 127: Hoare triple {101974#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101974#(<= main_~i~0 510)} is VALID [2022-04-15 12:23:29,510 INFO L290 TraceCheckUtils]: 126: Hoare triple {101974#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {101974#(<= main_~i~0 510)} is VALID [2022-04-15 12:23:29,510 INFO L290 TraceCheckUtils]: 125: Hoare triple {101447#true} ~i~0 := 0; {101974#(<= main_~i~0 510)} is VALID [2022-04-15 12:23:29,510 INFO L290 TraceCheckUtils]: 124: Hoare triple {101447#true} assume !(~i~0 < 1024); {101447#true} is VALID [2022-04-15 12:23:29,510 INFO L290 TraceCheckUtils]: 123: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,510 INFO L290 TraceCheckUtils]: 122: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,510 INFO L290 TraceCheckUtils]: 121: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,510 INFO L290 TraceCheckUtils]: 120: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,510 INFO L290 TraceCheckUtils]: 119: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,510 INFO L290 TraceCheckUtils]: 118: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 117: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 116: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 115: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 114: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 113: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 112: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 111: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 110: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 109: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 108: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 107: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 106: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 105: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 104: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 103: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 102: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 101: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 100: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 99: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,511 INFO L290 TraceCheckUtils]: 98: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 97: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 96: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 95: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 94: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 93: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 92: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 91: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 90: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 89: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 88: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 87: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 86: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 85: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 84: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 83: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 82: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 81: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 80: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 79: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,512 INFO L290 TraceCheckUtils]: 78: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 77: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 76: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 75: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 74: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 73: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 72: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 71: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 70: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 69: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 68: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 67: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 66: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 65: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 64: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 63: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 62: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 61: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 60: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 59: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,513 INFO L290 TraceCheckUtils]: 58: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 57: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 56: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 55: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 54: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 52: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 51: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 50: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {101447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {101447#true} call #t~ret6 := main(); {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101447#true} {101447#true} #64#return; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {101447#true} assume true; {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {101447#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {101447#true} is VALID [2022-04-15 12:23:29,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {101447#true} call ULTIMATE.init(); {101447#true} is VALID [2022-04-15 12:23:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3491 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2022-04-15 12:23:29,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952426701] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:23:29,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:23:29,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 7, 7] total 69 [2022-04-15 12:23:29,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:23:29,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1005115237] [2022-04-15 12:23:29,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1005115237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:23:29,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:23:29,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-15 12:23:29,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331894848] [2022-04-15 12:23:29,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:23:29,518 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2022-04-15 12:23:29,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:23:29,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:29,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:29,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-15 12:23:29,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:29,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-15 12:23:29,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2151, Invalid=2541, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 12:23:29,595 INFO L87 Difference]: Start difference. First operand 142 states and 146 transitions. Second operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:43,614 INFO L93 Difference]: Finished difference Result 453 states and 577 transitions. [2022-04-15 12:23:43,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 12:23:43,614 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2022-04-15 12:23:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:23:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 568 transitions. [2022-04-15 12:23:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 568 transitions. [2022-04-15 12:23:43,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 568 transitions. [2022-04-15 12:23:43,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 568 edges. 568 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:43,997 INFO L225 Difference]: With dead ends: 453 [2022-04-15 12:23:43,997 INFO L226 Difference]: Without dead ends: 436 [2022-04-15 12:23:43,998 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2192 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=6112, Invalid=10400, Unknown=0, NotChecked=0, Total=16512 [2022-04-15 12:23:43,998 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1423 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:23:43,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1423 Valid, 42 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:23:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-04-15 12:23:44,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 144. [2022-04-15 12:23:44,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:23:44,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 436 states. Second operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:44,884 INFO L74 IsIncluded]: Start isIncluded. First operand 436 states. Second operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:44,884 INFO L87 Difference]: Start difference. First operand 436 states. Second operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:44,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:44,891 INFO L93 Difference]: Finished difference Result 436 states and 556 transitions. [2022-04-15 12:23:44,891 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 556 transitions. [2022-04-15 12:23:44,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:44,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:44,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 436 states. [2022-04-15 12:23:44,892 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 436 states. [2022-04-15 12:23:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:44,898 INFO L93 Difference]: Finished difference Result 436 states and 556 transitions. [2022-04-15 12:23:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 556 transitions. [2022-04-15 12:23:44,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:44,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:44,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:23:44,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:23:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2022-04-15 12:23:44,900 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 141 [2022-04-15 12:23:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:23:44,901 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2022-04-15 12:23:44,901 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:44,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 148 transitions. [2022-04-15 12:23:45,286 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:23:45,286 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-15 12:23:45,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-15 12:23:45,286 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:23:45,287 INFO L499 BasicCegarLoop]: trace histogram [60, 60, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:23:45,305 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:23:45,495 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:23:45,495 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:23:45,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:23:45,496 INFO L85 PathProgramCache]: Analyzing trace with hash -680279227, now seen corresponding path program 121 times [2022-04-15 12:23:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:45,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1614120270] [2022-04-15 12:23:45,499 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:23:45,499 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:23:45,499 INFO L85 PathProgramCache]: Analyzing trace with hash -680279227, now seen corresponding path program 122 times [2022-04-15 12:23:45,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:23:45,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516593934] [2022-04-15 12:23:45,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:23:45,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:23:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:46,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:23:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:46,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {104616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {104550#true} is VALID [2022-04-15 12:23:46,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {104550#true} assume true; {104550#true} is VALID [2022-04-15 12:23:46,708 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104550#true} {104550#true} #64#return; {104550#true} is VALID [2022-04-15 12:23:46,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {104550#true} call ULTIMATE.init(); {104616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:23:46,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {104616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {104550#true} is VALID [2022-04-15 12:23:46,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {104550#true} assume true; {104550#true} is VALID [2022-04-15 12:23:46,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104550#true} {104550#true} #64#return; {104550#true} is VALID [2022-04-15 12:23:46,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {104550#true} call #t~ret6 := main(); {104550#true} is VALID [2022-04-15 12:23:46,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {104550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {104555#(= main_~i~0 0)} is VALID [2022-04-15 12:23:46,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {104555#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104555#(= main_~i~0 0)} is VALID [2022-04-15 12:23:46,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {104555#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104556#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:46,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {104556#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104556#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:46,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {104556#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104557#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:46,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {104557#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104557#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:46,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {104557#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104558#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:46,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {104558#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104558#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:46,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {104558#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104559#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:46,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {104559#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104559#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:46,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {104559#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104560#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:46,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {104560#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104560#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:46,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {104560#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104561#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:46,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {104561#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104561#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:46,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {104561#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104562#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:46,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {104562#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104562#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:46,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {104562#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104563#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:46,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {104563#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104563#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:46,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {104563#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104564#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:46,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {104564#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104564#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:46,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {104564#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104565#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:46,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {104565#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104565#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:46,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {104565#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104566#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:46,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {104566#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104566#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:46,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {104566#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104567#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:46,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {104567#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104567#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:46,716 INFO L290 TraceCheckUtils]: 31: Hoare triple {104567#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104568#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:46,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {104568#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104568#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:46,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {104568#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104569#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:46,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {104569#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104569#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:46,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {104569#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104570#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:46,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {104570#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104570#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:46,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {104570#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104571#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:46,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {104571#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104571#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:46,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {104571#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104572#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:46,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {104572#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104572#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:46,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {104572#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104573#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:46,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {104573#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104573#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:46,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {104573#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104574#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:46,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {104574#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104574#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:46,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {104574#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104575#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:46,720 INFO L290 TraceCheckUtils]: 46: Hoare triple {104575#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104575#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:46,720 INFO L290 TraceCheckUtils]: 47: Hoare triple {104575#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104576#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:46,720 INFO L290 TraceCheckUtils]: 48: Hoare triple {104576#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104576#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:46,721 INFO L290 TraceCheckUtils]: 49: Hoare triple {104576#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104577#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:46,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {104577#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104577#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:46,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {104577#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104578#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:46,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {104578#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104578#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:46,722 INFO L290 TraceCheckUtils]: 53: Hoare triple {104578#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104579#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:46,722 INFO L290 TraceCheckUtils]: 54: Hoare triple {104579#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104579#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:46,722 INFO L290 TraceCheckUtils]: 55: Hoare triple {104579#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104580#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:46,722 INFO L290 TraceCheckUtils]: 56: Hoare triple {104580#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104580#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:46,723 INFO L290 TraceCheckUtils]: 57: Hoare triple {104580#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104581#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:46,723 INFO L290 TraceCheckUtils]: 58: Hoare triple {104581#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104581#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:46,723 INFO L290 TraceCheckUtils]: 59: Hoare triple {104581#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104582#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:46,724 INFO L290 TraceCheckUtils]: 60: Hoare triple {104582#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104582#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:46,724 INFO L290 TraceCheckUtils]: 61: Hoare triple {104582#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104583#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:46,724 INFO L290 TraceCheckUtils]: 62: Hoare triple {104583#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104583#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:46,724 INFO L290 TraceCheckUtils]: 63: Hoare triple {104583#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104584#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:46,725 INFO L290 TraceCheckUtils]: 64: Hoare triple {104584#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104584#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:46,725 INFO L290 TraceCheckUtils]: 65: Hoare triple {104584#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104585#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:46,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {104585#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104585#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:46,726 INFO L290 TraceCheckUtils]: 67: Hoare triple {104585#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104586#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:46,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {104586#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104586#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:46,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {104586#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104587#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:46,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {104587#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104587#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:46,727 INFO L290 TraceCheckUtils]: 71: Hoare triple {104587#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104588#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:46,727 INFO L290 TraceCheckUtils]: 72: Hoare triple {104588#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104588#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:46,727 INFO L290 TraceCheckUtils]: 73: Hoare triple {104588#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104589#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:46,727 INFO L290 TraceCheckUtils]: 74: Hoare triple {104589#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104589#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:46,728 INFO L290 TraceCheckUtils]: 75: Hoare triple {104589#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104590#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:46,728 INFO L290 TraceCheckUtils]: 76: Hoare triple {104590#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104590#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:46,728 INFO L290 TraceCheckUtils]: 77: Hoare triple {104590#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104591#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:46,729 INFO L290 TraceCheckUtils]: 78: Hoare triple {104591#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104591#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:46,729 INFO L290 TraceCheckUtils]: 79: Hoare triple {104591#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104592#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:46,729 INFO L290 TraceCheckUtils]: 80: Hoare triple {104592#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104592#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:46,729 INFO L290 TraceCheckUtils]: 81: Hoare triple {104592#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104593#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:46,730 INFO L290 TraceCheckUtils]: 82: Hoare triple {104593#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104593#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:46,730 INFO L290 TraceCheckUtils]: 83: Hoare triple {104593#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104594#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:46,730 INFO L290 TraceCheckUtils]: 84: Hoare triple {104594#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104594#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:46,730 INFO L290 TraceCheckUtils]: 85: Hoare triple {104594#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104595#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:46,731 INFO L290 TraceCheckUtils]: 86: Hoare triple {104595#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104595#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:46,731 INFO L290 TraceCheckUtils]: 87: Hoare triple {104595#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104596#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:46,731 INFO L290 TraceCheckUtils]: 88: Hoare triple {104596#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104596#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:46,732 INFO L290 TraceCheckUtils]: 89: Hoare triple {104596#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104597#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:46,732 INFO L290 TraceCheckUtils]: 90: Hoare triple {104597#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104597#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:46,732 INFO L290 TraceCheckUtils]: 91: Hoare triple {104597#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104598#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:46,732 INFO L290 TraceCheckUtils]: 92: Hoare triple {104598#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104598#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:46,733 INFO L290 TraceCheckUtils]: 93: Hoare triple {104598#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104599#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:46,733 INFO L290 TraceCheckUtils]: 94: Hoare triple {104599#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104599#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:46,733 INFO L290 TraceCheckUtils]: 95: Hoare triple {104599#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104600#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:46,733 INFO L290 TraceCheckUtils]: 96: Hoare triple {104600#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104600#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:46,734 INFO L290 TraceCheckUtils]: 97: Hoare triple {104600#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104601#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:46,734 INFO L290 TraceCheckUtils]: 98: Hoare triple {104601#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104601#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:46,734 INFO L290 TraceCheckUtils]: 99: Hoare triple {104601#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104602#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:46,735 INFO L290 TraceCheckUtils]: 100: Hoare triple {104602#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104602#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:46,735 INFO L290 TraceCheckUtils]: 101: Hoare triple {104602#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104603#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:46,735 INFO L290 TraceCheckUtils]: 102: Hoare triple {104603#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104603#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:46,735 INFO L290 TraceCheckUtils]: 103: Hoare triple {104603#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104604#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:46,736 INFO L290 TraceCheckUtils]: 104: Hoare triple {104604#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104604#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:46,736 INFO L290 TraceCheckUtils]: 105: Hoare triple {104604#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104605#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:46,736 INFO L290 TraceCheckUtils]: 106: Hoare triple {104605#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104605#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:46,736 INFO L290 TraceCheckUtils]: 107: Hoare triple {104605#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104606#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:46,737 INFO L290 TraceCheckUtils]: 108: Hoare triple {104606#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104606#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:46,737 INFO L290 TraceCheckUtils]: 109: Hoare triple {104606#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104607#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:46,737 INFO L290 TraceCheckUtils]: 110: Hoare triple {104607#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104607#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:46,738 INFO L290 TraceCheckUtils]: 111: Hoare triple {104607#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104608#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:46,738 INFO L290 TraceCheckUtils]: 112: Hoare triple {104608#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104608#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:46,738 INFO L290 TraceCheckUtils]: 113: Hoare triple {104608#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104609#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:46,738 INFO L290 TraceCheckUtils]: 114: Hoare triple {104609#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104609#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:46,739 INFO L290 TraceCheckUtils]: 115: Hoare triple {104609#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104610#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:46,739 INFO L290 TraceCheckUtils]: 116: Hoare triple {104610#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104610#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:46,739 INFO L290 TraceCheckUtils]: 117: Hoare triple {104610#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104611#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:46,739 INFO L290 TraceCheckUtils]: 118: Hoare triple {104611#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104611#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:46,740 INFO L290 TraceCheckUtils]: 119: Hoare triple {104611#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104612#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:46,740 INFO L290 TraceCheckUtils]: 120: Hoare triple {104612#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104612#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:46,740 INFO L290 TraceCheckUtils]: 121: Hoare triple {104612#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104613#(<= main_~i~0 58)} is VALID [2022-04-15 12:23:46,741 INFO L290 TraceCheckUtils]: 122: Hoare triple {104613#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104613#(<= main_~i~0 58)} is VALID [2022-04-15 12:23:46,741 INFO L290 TraceCheckUtils]: 123: Hoare triple {104613#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104614#(<= main_~i~0 59)} is VALID [2022-04-15 12:23:46,741 INFO L290 TraceCheckUtils]: 124: Hoare triple {104614#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104614#(<= main_~i~0 59)} is VALID [2022-04-15 12:23:46,741 INFO L290 TraceCheckUtils]: 125: Hoare triple {104614#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104615#(<= main_~i~0 60)} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 126: Hoare triple {104615#(<= main_~i~0 60)} assume !(~i~0 < 1024); {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 127: Hoare triple {104551#false} ~i~0 := 0; {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 128: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 129: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 130: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 131: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 132: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 133: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 134: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 135: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 136: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 137: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 138: Hoare triple {104551#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L272 TraceCheckUtils]: 139: Hoare triple {104551#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 140: Hoare triple {104551#false} ~cond := #in~cond; {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 141: Hoare triple {104551#false} assume 0 == ~cond; {104551#false} is VALID [2022-04-15 12:23:46,742 INFO L290 TraceCheckUtils]: 142: Hoare triple {104551#false} assume !false; {104551#false} is VALID [2022-04-15 12:23:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3610 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:23:46,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:23:46,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516593934] [2022-04-15 12:23:46,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516593934] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:23:46,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995927493] [2022-04-15 12:23:46,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:23:46,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:23:46,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:23:46,744 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:23:46,745 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:23:47,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:23:47,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:23:47,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-15 12:23:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:47,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:23:47,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {104550#true} call ULTIMATE.init(); {104550#true} is VALID [2022-04-15 12:23:47,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {104550#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {104550#true} is VALID [2022-04-15 12:23:47,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {104550#true} assume true; {104550#true} is VALID [2022-04-15 12:23:47,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104550#true} {104550#true} #64#return; {104550#true} is VALID [2022-04-15 12:23:47,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {104550#true} call #t~ret6 := main(); {104550#true} is VALID [2022-04-15 12:23:47,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {104550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {104635#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:47,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {104635#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104635#(<= main_~i~0 0)} is VALID [2022-04-15 12:23:47,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {104635#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104556#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:47,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {104556#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104556#(<= main_~i~0 1)} is VALID [2022-04-15 12:23:47,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {104556#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104557#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:47,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {104557#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104557#(<= main_~i~0 2)} is VALID [2022-04-15 12:23:47,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {104557#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104558#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:47,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {104558#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104558#(<= main_~i~0 3)} is VALID [2022-04-15 12:23:47,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {104558#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104559#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:47,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {104559#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104559#(<= main_~i~0 4)} is VALID [2022-04-15 12:23:47,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {104559#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104560#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:47,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {104560#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104560#(<= main_~i~0 5)} is VALID [2022-04-15 12:23:47,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {104560#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104561#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:47,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {104561#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104561#(<= main_~i~0 6)} is VALID [2022-04-15 12:23:47,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {104561#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104562#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:47,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {104562#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104562#(<= main_~i~0 7)} is VALID [2022-04-15 12:23:47,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {104562#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104563#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:47,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {104563#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104563#(<= main_~i~0 8)} is VALID [2022-04-15 12:23:47,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {104563#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104564#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:47,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {104564#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104564#(<= main_~i~0 9)} is VALID [2022-04-15 12:23:47,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {104564#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104565#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:47,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {104565#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104565#(<= main_~i~0 10)} is VALID [2022-04-15 12:23:47,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {104565#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104566#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:47,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {104566#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104566#(<= main_~i~0 11)} is VALID [2022-04-15 12:23:47,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {104566#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104567#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:47,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {104567#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104567#(<= main_~i~0 12)} is VALID [2022-04-15 12:23:47,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {104567#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104568#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:47,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {104568#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104568#(<= main_~i~0 13)} is VALID [2022-04-15 12:23:47,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {104568#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104569#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:47,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {104569#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104569#(<= main_~i~0 14)} is VALID [2022-04-15 12:23:47,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {104569#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104570#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:47,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {104570#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104570#(<= main_~i~0 15)} is VALID [2022-04-15 12:23:47,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {104570#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104571#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:47,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {104571#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104571#(<= main_~i~0 16)} is VALID [2022-04-15 12:23:47,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {104571#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104572#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:47,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {104572#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104572#(<= main_~i~0 17)} is VALID [2022-04-15 12:23:47,830 INFO L290 TraceCheckUtils]: 41: Hoare triple {104572#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104573#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:47,830 INFO L290 TraceCheckUtils]: 42: Hoare triple {104573#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104573#(<= main_~i~0 18)} is VALID [2022-04-15 12:23:47,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {104573#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104574#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:47,831 INFO L290 TraceCheckUtils]: 44: Hoare triple {104574#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104574#(<= main_~i~0 19)} is VALID [2022-04-15 12:23:47,831 INFO L290 TraceCheckUtils]: 45: Hoare triple {104574#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104575#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:47,831 INFO L290 TraceCheckUtils]: 46: Hoare triple {104575#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104575#(<= main_~i~0 20)} is VALID [2022-04-15 12:23:47,831 INFO L290 TraceCheckUtils]: 47: Hoare triple {104575#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104576#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:47,832 INFO L290 TraceCheckUtils]: 48: Hoare triple {104576#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104576#(<= main_~i~0 21)} is VALID [2022-04-15 12:23:47,832 INFO L290 TraceCheckUtils]: 49: Hoare triple {104576#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104577#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:47,832 INFO L290 TraceCheckUtils]: 50: Hoare triple {104577#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104577#(<= main_~i~0 22)} is VALID [2022-04-15 12:23:47,833 INFO L290 TraceCheckUtils]: 51: Hoare triple {104577#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104578#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:47,833 INFO L290 TraceCheckUtils]: 52: Hoare triple {104578#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104578#(<= main_~i~0 23)} is VALID [2022-04-15 12:23:47,833 INFO L290 TraceCheckUtils]: 53: Hoare triple {104578#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104579#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:47,833 INFO L290 TraceCheckUtils]: 54: Hoare triple {104579#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104579#(<= main_~i~0 24)} is VALID [2022-04-15 12:23:47,834 INFO L290 TraceCheckUtils]: 55: Hoare triple {104579#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104580#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:47,834 INFO L290 TraceCheckUtils]: 56: Hoare triple {104580#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104580#(<= main_~i~0 25)} is VALID [2022-04-15 12:23:47,834 INFO L290 TraceCheckUtils]: 57: Hoare triple {104580#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104581#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:47,835 INFO L290 TraceCheckUtils]: 58: Hoare triple {104581#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104581#(<= main_~i~0 26)} is VALID [2022-04-15 12:23:47,835 INFO L290 TraceCheckUtils]: 59: Hoare triple {104581#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104582#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:47,835 INFO L290 TraceCheckUtils]: 60: Hoare triple {104582#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104582#(<= main_~i~0 27)} is VALID [2022-04-15 12:23:47,835 INFO L290 TraceCheckUtils]: 61: Hoare triple {104582#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104583#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:47,836 INFO L290 TraceCheckUtils]: 62: Hoare triple {104583#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104583#(<= main_~i~0 28)} is VALID [2022-04-15 12:23:47,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {104583#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104584#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:47,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {104584#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104584#(<= main_~i~0 29)} is VALID [2022-04-15 12:23:47,837 INFO L290 TraceCheckUtils]: 65: Hoare triple {104584#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104585#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:47,837 INFO L290 TraceCheckUtils]: 66: Hoare triple {104585#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104585#(<= main_~i~0 30)} is VALID [2022-04-15 12:23:47,837 INFO L290 TraceCheckUtils]: 67: Hoare triple {104585#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104586#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:47,837 INFO L290 TraceCheckUtils]: 68: Hoare triple {104586#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104586#(<= main_~i~0 31)} is VALID [2022-04-15 12:23:47,838 INFO L290 TraceCheckUtils]: 69: Hoare triple {104586#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104587#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:47,838 INFO L290 TraceCheckUtils]: 70: Hoare triple {104587#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104587#(<= main_~i~0 32)} is VALID [2022-04-15 12:23:47,838 INFO L290 TraceCheckUtils]: 71: Hoare triple {104587#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104588#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:47,839 INFO L290 TraceCheckUtils]: 72: Hoare triple {104588#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104588#(<= main_~i~0 33)} is VALID [2022-04-15 12:23:47,839 INFO L290 TraceCheckUtils]: 73: Hoare triple {104588#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104589#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:47,839 INFO L290 TraceCheckUtils]: 74: Hoare triple {104589#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104589#(<= main_~i~0 34)} is VALID [2022-04-15 12:23:47,839 INFO L290 TraceCheckUtils]: 75: Hoare triple {104589#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104590#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:47,840 INFO L290 TraceCheckUtils]: 76: Hoare triple {104590#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104590#(<= main_~i~0 35)} is VALID [2022-04-15 12:23:47,840 INFO L290 TraceCheckUtils]: 77: Hoare triple {104590#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104591#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:47,840 INFO L290 TraceCheckUtils]: 78: Hoare triple {104591#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104591#(<= main_~i~0 36)} is VALID [2022-04-15 12:23:47,841 INFO L290 TraceCheckUtils]: 79: Hoare triple {104591#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104592#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:47,841 INFO L290 TraceCheckUtils]: 80: Hoare triple {104592#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104592#(<= main_~i~0 37)} is VALID [2022-04-15 12:23:47,841 INFO L290 TraceCheckUtils]: 81: Hoare triple {104592#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104593#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:47,841 INFO L290 TraceCheckUtils]: 82: Hoare triple {104593#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104593#(<= main_~i~0 38)} is VALID [2022-04-15 12:23:47,842 INFO L290 TraceCheckUtils]: 83: Hoare triple {104593#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104594#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:47,842 INFO L290 TraceCheckUtils]: 84: Hoare triple {104594#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104594#(<= main_~i~0 39)} is VALID [2022-04-15 12:23:47,842 INFO L290 TraceCheckUtils]: 85: Hoare triple {104594#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104595#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:47,843 INFO L290 TraceCheckUtils]: 86: Hoare triple {104595#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104595#(<= main_~i~0 40)} is VALID [2022-04-15 12:23:47,843 INFO L290 TraceCheckUtils]: 87: Hoare triple {104595#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104596#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:47,843 INFO L290 TraceCheckUtils]: 88: Hoare triple {104596#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104596#(<= main_~i~0 41)} is VALID [2022-04-15 12:23:47,843 INFO L290 TraceCheckUtils]: 89: Hoare triple {104596#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104597#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:47,844 INFO L290 TraceCheckUtils]: 90: Hoare triple {104597#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104597#(<= main_~i~0 42)} is VALID [2022-04-15 12:23:47,844 INFO L290 TraceCheckUtils]: 91: Hoare triple {104597#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104598#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:47,844 INFO L290 TraceCheckUtils]: 92: Hoare triple {104598#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104598#(<= main_~i~0 43)} is VALID [2022-04-15 12:23:47,845 INFO L290 TraceCheckUtils]: 93: Hoare triple {104598#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104599#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:47,845 INFO L290 TraceCheckUtils]: 94: Hoare triple {104599#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104599#(<= main_~i~0 44)} is VALID [2022-04-15 12:23:47,845 INFO L290 TraceCheckUtils]: 95: Hoare triple {104599#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104600#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:47,845 INFO L290 TraceCheckUtils]: 96: Hoare triple {104600#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104600#(<= main_~i~0 45)} is VALID [2022-04-15 12:23:47,846 INFO L290 TraceCheckUtils]: 97: Hoare triple {104600#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104601#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:47,846 INFO L290 TraceCheckUtils]: 98: Hoare triple {104601#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104601#(<= main_~i~0 46)} is VALID [2022-04-15 12:23:47,846 INFO L290 TraceCheckUtils]: 99: Hoare triple {104601#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104602#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:47,847 INFO L290 TraceCheckUtils]: 100: Hoare triple {104602#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104602#(<= main_~i~0 47)} is VALID [2022-04-15 12:23:47,847 INFO L290 TraceCheckUtils]: 101: Hoare triple {104602#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104603#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:47,847 INFO L290 TraceCheckUtils]: 102: Hoare triple {104603#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104603#(<= main_~i~0 48)} is VALID [2022-04-15 12:23:47,848 INFO L290 TraceCheckUtils]: 103: Hoare triple {104603#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104604#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:47,848 INFO L290 TraceCheckUtils]: 104: Hoare triple {104604#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104604#(<= main_~i~0 49)} is VALID [2022-04-15 12:23:47,848 INFO L290 TraceCheckUtils]: 105: Hoare triple {104604#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104605#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:47,848 INFO L290 TraceCheckUtils]: 106: Hoare triple {104605#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104605#(<= main_~i~0 50)} is VALID [2022-04-15 12:23:47,849 INFO L290 TraceCheckUtils]: 107: Hoare triple {104605#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104606#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:47,849 INFO L290 TraceCheckUtils]: 108: Hoare triple {104606#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104606#(<= main_~i~0 51)} is VALID [2022-04-15 12:23:47,849 INFO L290 TraceCheckUtils]: 109: Hoare triple {104606#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104607#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:47,849 INFO L290 TraceCheckUtils]: 110: Hoare triple {104607#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104607#(<= main_~i~0 52)} is VALID [2022-04-15 12:23:47,850 INFO L290 TraceCheckUtils]: 111: Hoare triple {104607#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104608#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:47,850 INFO L290 TraceCheckUtils]: 112: Hoare triple {104608#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104608#(<= main_~i~0 53)} is VALID [2022-04-15 12:23:47,850 INFO L290 TraceCheckUtils]: 113: Hoare triple {104608#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104609#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:47,851 INFO L290 TraceCheckUtils]: 114: Hoare triple {104609#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104609#(<= main_~i~0 54)} is VALID [2022-04-15 12:23:47,851 INFO L290 TraceCheckUtils]: 115: Hoare triple {104609#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104610#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:47,851 INFO L290 TraceCheckUtils]: 116: Hoare triple {104610#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104610#(<= main_~i~0 55)} is VALID [2022-04-15 12:23:47,851 INFO L290 TraceCheckUtils]: 117: Hoare triple {104610#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104611#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:47,852 INFO L290 TraceCheckUtils]: 118: Hoare triple {104611#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104611#(<= main_~i~0 56)} is VALID [2022-04-15 12:23:47,852 INFO L290 TraceCheckUtils]: 119: Hoare triple {104611#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104612#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:47,852 INFO L290 TraceCheckUtils]: 120: Hoare triple {104612#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104612#(<= main_~i~0 57)} is VALID [2022-04-15 12:23:47,853 INFO L290 TraceCheckUtils]: 121: Hoare triple {104612#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104613#(<= main_~i~0 58)} is VALID [2022-04-15 12:23:47,853 INFO L290 TraceCheckUtils]: 122: Hoare triple {104613#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104613#(<= main_~i~0 58)} is VALID [2022-04-15 12:23:47,853 INFO L290 TraceCheckUtils]: 123: Hoare triple {104613#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104614#(<= main_~i~0 59)} is VALID [2022-04-15 12:23:47,853 INFO L290 TraceCheckUtils]: 124: Hoare triple {104614#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104614#(<= main_~i~0 59)} is VALID [2022-04-15 12:23:47,854 INFO L290 TraceCheckUtils]: 125: Hoare triple {104614#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104615#(<= main_~i~0 60)} is VALID [2022-04-15 12:23:47,854 INFO L290 TraceCheckUtils]: 126: Hoare triple {104615#(<= main_~i~0 60)} assume !(~i~0 < 1024); {104551#false} is VALID [2022-04-15 12:23:47,854 INFO L290 TraceCheckUtils]: 127: Hoare triple {104551#false} ~i~0 := 0; {104551#false} is VALID [2022-04-15 12:23:47,854 INFO L290 TraceCheckUtils]: 128: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 12:23:47,854 INFO L290 TraceCheckUtils]: 129: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 12:23:47,854 INFO L290 TraceCheckUtils]: 130: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 12:23:47,854 INFO L290 TraceCheckUtils]: 131: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-15 12:23:47,854 INFO L290 TraceCheckUtils]: 132: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 12:23:47,854 INFO L290 TraceCheckUtils]: 133: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 12:23:47,854 INFO L290 TraceCheckUtils]: 134: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 12:23:47,855 INFO L290 TraceCheckUtils]: 135: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-15 12:23:47,855 INFO L290 TraceCheckUtils]: 136: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 12:23:47,855 INFO L290 TraceCheckUtils]: 137: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 12:23:47,855 INFO L290 TraceCheckUtils]: 138: Hoare triple {104551#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 12:23:47,855 INFO L272 TraceCheckUtils]: 139: Hoare triple {104551#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {104551#false} is VALID [2022-04-15 12:23:47,855 INFO L290 TraceCheckUtils]: 140: Hoare triple {104551#false} ~cond := #in~cond; {104551#false} is VALID [2022-04-15 12:23:47,855 INFO L290 TraceCheckUtils]: 141: Hoare triple {104551#false} assume 0 == ~cond; {104551#false} is VALID [2022-04-15 12:23:47,855 INFO L290 TraceCheckUtils]: 142: Hoare triple {104551#false} assume !false; {104551#false} is VALID [2022-04-15 12:23:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3610 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:23:47,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:23:51,549 INFO L290 TraceCheckUtils]: 142: Hoare triple {104551#false} assume !false; {104551#false} is VALID [2022-04-15 12:23:51,549 INFO L290 TraceCheckUtils]: 141: Hoare triple {104551#false} assume 0 == ~cond; {104551#false} is VALID [2022-04-15 12:23:51,549 INFO L290 TraceCheckUtils]: 140: Hoare triple {104551#false} ~cond := #in~cond; {104551#false} is VALID [2022-04-15 12:23:51,549 INFO L272 TraceCheckUtils]: 139: Hoare triple {104551#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {104551#false} is VALID [2022-04-15 12:23:51,549 INFO L290 TraceCheckUtils]: 138: Hoare triple {104551#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 12:23:51,549 INFO L290 TraceCheckUtils]: 137: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 12:23:51,549 INFO L290 TraceCheckUtils]: 136: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 12:23:51,549 INFO L290 TraceCheckUtils]: 135: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-15 12:23:51,549 INFO L290 TraceCheckUtils]: 134: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 12:23:51,549 INFO L290 TraceCheckUtils]: 133: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 12:23:51,549 INFO L290 TraceCheckUtils]: 132: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 12:23:51,549 INFO L290 TraceCheckUtils]: 131: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-15 12:23:51,549 INFO L290 TraceCheckUtils]: 130: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 12:23:51,549 INFO L290 TraceCheckUtils]: 129: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 12:23:51,550 INFO L290 TraceCheckUtils]: 128: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 12:23:51,550 INFO L290 TraceCheckUtils]: 127: Hoare triple {104551#false} ~i~0 := 0; {104551#false} is VALID [2022-04-15 12:23:51,550 INFO L290 TraceCheckUtils]: 126: Hoare triple {105095#(< main_~i~0 1024)} assume !(~i~0 < 1024); {104551#false} is VALID [2022-04-15 12:23:51,550 INFO L290 TraceCheckUtils]: 125: Hoare triple {105099#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105095#(< main_~i~0 1024)} is VALID [2022-04-15 12:23:51,550 INFO L290 TraceCheckUtils]: 124: Hoare triple {105099#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105099#(< main_~i~0 1023)} is VALID [2022-04-15 12:23:51,551 INFO L290 TraceCheckUtils]: 123: Hoare triple {105106#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105099#(< main_~i~0 1023)} is VALID [2022-04-15 12:23:51,551 INFO L290 TraceCheckUtils]: 122: Hoare triple {105106#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105106#(< main_~i~0 1022)} is VALID [2022-04-15 12:23:51,551 INFO L290 TraceCheckUtils]: 121: Hoare triple {105113#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105106#(< main_~i~0 1022)} is VALID [2022-04-15 12:23:51,552 INFO L290 TraceCheckUtils]: 120: Hoare triple {105113#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105113#(< main_~i~0 1021)} is VALID [2022-04-15 12:23:51,552 INFO L290 TraceCheckUtils]: 119: Hoare triple {105120#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105113#(< main_~i~0 1021)} is VALID [2022-04-15 12:23:51,552 INFO L290 TraceCheckUtils]: 118: Hoare triple {105120#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105120#(< main_~i~0 1020)} is VALID [2022-04-15 12:23:51,552 INFO L290 TraceCheckUtils]: 117: Hoare triple {105127#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105120#(< main_~i~0 1020)} is VALID [2022-04-15 12:23:51,553 INFO L290 TraceCheckUtils]: 116: Hoare triple {105127#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105127#(< main_~i~0 1019)} is VALID [2022-04-15 12:23:51,553 INFO L290 TraceCheckUtils]: 115: Hoare triple {105134#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105127#(< main_~i~0 1019)} is VALID [2022-04-15 12:23:51,553 INFO L290 TraceCheckUtils]: 114: Hoare triple {105134#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105134#(< main_~i~0 1018)} is VALID [2022-04-15 12:23:51,554 INFO L290 TraceCheckUtils]: 113: Hoare triple {105141#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105134#(< main_~i~0 1018)} is VALID [2022-04-15 12:23:51,554 INFO L290 TraceCheckUtils]: 112: Hoare triple {105141#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105141#(< main_~i~0 1017)} is VALID [2022-04-15 12:23:51,554 INFO L290 TraceCheckUtils]: 111: Hoare triple {105148#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105141#(< main_~i~0 1017)} is VALID [2022-04-15 12:23:51,554 INFO L290 TraceCheckUtils]: 110: Hoare triple {105148#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105148#(< main_~i~0 1016)} is VALID [2022-04-15 12:23:51,555 INFO L290 TraceCheckUtils]: 109: Hoare triple {105155#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105148#(< main_~i~0 1016)} is VALID [2022-04-15 12:23:51,555 INFO L290 TraceCheckUtils]: 108: Hoare triple {105155#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105155#(< main_~i~0 1015)} is VALID [2022-04-15 12:23:51,555 INFO L290 TraceCheckUtils]: 107: Hoare triple {105162#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105155#(< main_~i~0 1015)} is VALID [2022-04-15 12:23:51,556 INFO L290 TraceCheckUtils]: 106: Hoare triple {105162#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105162#(< main_~i~0 1014)} is VALID [2022-04-15 12:23:51,556 INFO L290 TraceCheckUtils]: 105: Hoare triple {105169#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105162#(< main_~i~0 1014)} is VALID [2022-04-15 12:23:51,556 INFO L290 TraceCheckUtils]: 104: Hoare triple {105169#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105169#(< main_~i~0 1013)} is VALID [2022-04-15 12:23:51,556 INFO L290 TraceCheckUtils]: 103: Hoare triple {105176#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105169#(< main_~i~0 1013)} is VALID [2022-04-15 12:23:51,557 INFO L290 TraceCheckUtils]: 102: Hoare triple {105176#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105176#(< main_~i~0 1012)} is VALID [2022-04-15 12:23:51,557 INFO L290 TraceCheckUtils]: 101: Hoare triple {105183#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105176#(< main_~i~0 1012)} is VALID [2022-04-15 12:23:51,557 INFO L290 TraceCheckUtils]: 100: Hoare triple {105183#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105183#(< main_~i~0 1011)} is VALID [2022-04-15 12:23:51,558 INFO L290 TraceCheckUtils]: 99: Hoare triple {105190#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105183#(< main_~i~0 1011)} is VALID [2022-04-15 12:23:51,558 INFO L290 TraceCheckUtils]: 98: Hoare triple {105190#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105190#(< main_~i~0 1010)} is VALID [2022-04-15 12:23:51,558 INFO L290 TraceCheckUtils]: 97: Hoare triple {105197#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105190#(< main_~i~0 1010)} is VALID [2022-04-15 12:23:51,558 INFO L290 TraceCheckUtils]: 96: Hoare triple {105197#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105197#(< main_~i~0 1009)} is VALID [2022-04-15 12:23:51,559 INFO L290 TraceCheckUtils]: 95: Hoare triple {105204#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105197#(< main_~i~0 1009)} is VALID [2022-04-15 12:23:51,559 INFO L290 TraceCheckUtils]: 94: Hoare triple {105204#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105204#(< main_~i~0 1008)} is VALID [2022-04-15 12:23:51,559 INFO L290 TraceCheckUtils]: 93: Hoare triple {105211#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105204#(< main_~i~0 1008)} is VALID [2022-04-15 12:23:51,559 INFO L290 TraceCheckUtils]: 92: Hoare triple {105211#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105211#(< main_~i~0 1007)} is VALID [2022-04-15 12:23:51,560 INFO L290 TraceCheckUtils]: 91: Hoare triple {105218#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105211#(< main_~i~0 1007)} is VALID [2022-04-15 12:23:51,560 INFO L290 TraceCheckUtils]: 90: Hoare triple {105218#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105218#(< main_~i~0 1006)} is VALID [2022-04-15 12:23:51,560 INFO L290 TraceCheckUtils]: 89: Hoare triple {105225#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105218#(< main_~i~0 1006)} is VALID [2022-04-15 12:23:51,561 INFO L290 TraceCheckUtils]: 88: Hoare triple {105225#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105225#(< main_~i~0 1005)} is VALID [2022-04-15 12:23:51,561 INFO L290 TraceCheckUtils]: 87: Hoare triple {105232#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105225#(< main_~i~0 1005)} is VALID [2022-04-15 12:23:51,561 INFO L290 TraceCheckUtils]: 86: Hoare triple {105232#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105232#(< main_~i~0 1004)} is VALID [2022-04-15 12:23:51,561 INFO L290 TraceCheckUtils]: 85: Hoare triple {105239#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105232#(< main_~i~0 1004)} is VALID [2022-04-15 12:23:51,562 INFO L290 TraceCheckUtils]: 84: Hoare triple {105239#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105239#(< main_~i~0 1003)} is VALID [2022-04-15 12:23:51,562 INFO L290 TraceCheckUtils]: 83: Hoare triple {105246#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105239#(< main_~i~0 1003)} is VALID [2022-04-15 12:23:51,562 INFO L290 TraceCheckUtils]: 82: Hoare triple {105246#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105246#(< main_~i~0 1002)} is VALID [2022-04-15 12:23:51,563 INFO L290 TraceCheckUtils]: 81: Hoare triple {105253#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105246#(< main_~i~0 1002)} is VALID [2022-04-15 12:23:51,563 INFO L290 TraceCheckUtils]: 80: Hoare triple {105253#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105253#(< main_~i~0 1001)} is VALID [2022-04-15 12:23:51,563 INFO L290 TraceCheckUtils]: 79: Hoare triple {105260#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105253#(< main_~i~0 1001)} is VALID [2022-04-15 12:23:51,563 INFO L290 TraceCheckUtils]: 78: Hoare triple {105260#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105260#(< main_~i~0 1000)} is VALID [2022-04-15 12:23:51,564 INFO L290 TraceCheckUtils]: 77: Hoare triple {105267#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105260#(< main_~i~0 1000)} is VALID [2022-04-15 12:23:51,564 INFO L290 TraceCheckUtils]: 76: Hoare triple {105267#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105267#(< main_~i~0 999)} is VALID [2022-04-15 12:23:51,564 INFO L290 TraceCheckUtils]: 75: Hoare triple {105274#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105267#(< main_~i~0 999)} is VALID [2022-04-15 12:23:51,564 INFO L290 TraceCheckUtils]: 74: Hoare triple {105274#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105274#(< main_~i~0 998)} is VALID [2022-04-15 12:23:51,565 INFO L290 TraceCheckUtils]: 73: Hoare triple {105281#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105274#(< main_~i~0 998)} is VALID [2022-04-15 12:23:51,565 INFO L290 TraceCheckUtils]: 72: Hoare triple {105281#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105281#(< main_~i~0 997)} is VALID [2022-04-15 12:23:51,565 INFO L290 TraceCheckUtils]: 71: Hoare triple {105288#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105281#(< main_~i~0 997)} is VALID [2022-04-15 12:23:51,566 INFO L290 TraceCheckUtils]: 70: Hoare triple {105288#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105288#(< main_~i~0 996)} is VALID [2022-04-15 12:23:51,566 INFO L290 TraceCheckUtils]: 69: Hoare triple {105295#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105288#(< main_~i~0 996)} is VALID [2022-04-15 12:23:51,566 INFO L290 TraceCheckUtils]: 68: Hoare triple {105295#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105295#(< main_~i~0 995)} is VALID [2022-04-15 12:23:51,566 INFO L290 TraceCheckUtils]: 67: Hoare triple {105302#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105295#(< main_~i~0 995)} is VALID [2022-04-15 12:23:51,567 INFO L290 TraceCheckUtils]: 66: Hoare triple {105302#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105302#(< main_~i~0 994)} is VALID [2022-04-15 12:23:51,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {105309#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105302#(< main_~i~0 994)} is VALID [2022-04-15 12:23:51,567 INFO L290 TraceCheckUtils]: 64: Hoare triple {105309#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105309#(< main_~i~0 993)} is VALID [2022-04-15 12:23:51,568 INFO L290 TraceCheckUtils]: 63: Hoare triple {105316#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105309#(< main_~i~0 993)} is VALID [2022-04-15 12:23:51,568 INFO L290 TraceCheckUtils]: 62: Hoare triple {105316#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105316#(< main_~i~0 992)} is VALID [2022-04-15 12:23:51,568 INFO L290 TraceCheckUtils]: 61: Hoare triple {105323#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105316#(< main_~i~0 992)} is VALID [2022-04-15 12:23:51,568 INFO L290 TraceCheckUtils]: 60: Hoare triple {105323#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105323#(< main_~i~0 991)} is VALID [2022-04-15 12:23:51,569 INFO L290 TraceCheckUtils]: 59: Hoare triple {105330#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105323#(< main_~i~0 991)} is VALID [2022-04-15 12:23:51,569 INFO L290 TraceCheckUtils]: 58: Hoare triple {105330#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105330#(< main_~i~0 990)} is VALID [2022-04-15 12:23:51,569 INFO L290 TraceCheckUtils]: 57: Hoare triple {105337#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105330#(< main_~i~0 990)} is VALID [2022-04-15 12:23:51,569 INFO L290 TraceCheckUtils]: 56: Hoare triple {105337#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105337#(< main_~i~0 989)} is VALID [2022-04-15 12:23:51,570 INFO L290 TraceCheckUtils]: 55: Hoare triple {105344#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105337#(< main_~i~0 989)} is VALID [2022-04-15 12:23:51,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {105344#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105344#(< main_~i~0 988)} is VALID [2022-04-15 12:23:51,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {105351#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105344#(< main_~i~0 988)} is VALID [2022-04-15 12:23:51,571 INFO L290 TraceCheckUtils]: 52: Hoare triple {105351#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105351#(< main_~i~0 987)} is VALID [2022-04-15 12:23:51,571 INFO L290 TraceCheckUtils]: 51: Hoare triple {105358#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105351#(< main_~i~0 987)} is VALID [2022-04-15 12:23:51,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {105358#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105358#(< main_~i~0 986)} is VALID [2022-04-15 12:23:51,571 INFO L290 TraceCheckUtils]: 49: Hoare triple {105365#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105358#(< main_~i~0 986)} is VALID [2022-04-15 12:23:51,572 INFO L290 TraceCheckUtils]: 48: Hoare triple {105365#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105365#(< main_~i~0 985)} is VALID [2022-04-15 12:23:51,572 INFO L290 TraceCheckUtils]: 47: Hoare triple {105372#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105365#(< main_~i~0 985)} is VALID [2022-04-15 12:23:51,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {105372#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105372#(< main_~i~0 984)} is VALID [2022-04-15 12:23:51,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {105379#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105372#(< main_~i~0 984)} is VALID [2022-04-15 12:23:51,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {105379#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105379#(< main_~i~0 983)} is VALID [2022-04-15 12:23:51,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {105386#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105379#(< main_~i~0 983)} is VALID [2022-04-15 12:23:51,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {105386#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105386#(< main_~i~0 982)} is VALID [2022-04-15 12:23:51,574 INFO L290 TraceCheckUtils]: 41: Hoare triple {105393#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105386#(< main_~i~0 982)} is VALID [2022-04-15 12:23:51,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {105393#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105393#(< main_~i~0 981)} is VALID [2022-04-15 12:23:51,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {105400#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105393#(< main_~i~0 981)} is VALID [2022-04-15 12:23:51,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {105400#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105400#(< main_~i~0 980)} is VALID [2022-04-15 12:23:51,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {105407#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105400#(< main_~i~0 980)} is VALID [2022-04-15 12:23:51,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {105407#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105407#(< main_~i~0 979)} is VALID [2022-04-15 12:23:51,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {105414#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105407#(< main_~i~0 979)} is VALID [2022-04-15 12:23:51,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {105414#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105414#(< main_~i~0 978)} is VALID [2022-04-15 12:23:51,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {105421#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105414#(< main_~i~0 978)} is VALID [2022-04-15 12:23:51,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {105421#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105421#(< main_~i~0 977)} is VALID [2022-04-15 12:23:51,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {105428#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105421#(< main_~i~0 977)} is VALID [2022-04-15 12:23:51,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {105428#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105428#(< main_~i~0 976)} is VALID [2022-04-15 12:23:51,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {105435#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105428#(< main_~i~0 976)} is VALID [2022-04-15 12:23:51,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {105435#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105435#(< main_~i~0 975)} is VALID [2022-04-15 12:23:51,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {105442#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105435#(< main_~i~0 975)} is VALID [2022-04-15 12:23:51,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {105442#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105442#(< main_~i~0 974)} is VALID [2022-04-15 12:23:51,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {105449#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105442#(< main_~i~0 974)} is VALID [2022-04-15 12:23:51,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {105449#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105449#(< main_~i~0 973)} is VALID [2022-04-15 12:23:51,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {105456#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105449#(< main_~i~0 973)} is VALID [2022-04-15 12:23:51,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {105456#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105456#(< main_~i~0 972)} is VALID [2022-04-15 12:23:51,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {105463#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105456#(< main_~i~0 972)} is VALID [2022-04-15 12:23:51,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {105463#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105463#(< main_~i~0 971)} is VALID [2022-04-15 12:23:51,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {105470#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105463#(< main_~i~0 971)} is VALID [2022-04-15 12:23:51,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {105470#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105470#(< main_~i~0 970)} is VALID [2022-04-15 12:23:51,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {105477#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105470#(< main_~i~0 970)} is VALID [2022-04-15 12:23:51,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {105477#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105477#(< main_~i~0 969)} is VALID [2022-04-15 12:23:51,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {105484#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105477#(< main_~i~0 969)} is VALID [2022-04-15 12:23:51,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {105484#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105484#(< main_~i~0 968)} is VALID [2022-04-15 12:23:51,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {105491#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105484#(< main_~i~0 968)} is VALID [2022-04-15 12:23:51,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {105491#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105491#(< main_~i~0 967)} is VALID [2022-04-15 12:23:51,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {105498#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105491#(< main_~i~0 967)} is VALID [2022-04-15 12:23:51,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {105498#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105498#(< main_~i~0 966)} is VALID [2022-04-15 12:23:51,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {105505#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105498#(< main_~i~0 966)} is VALID [2022-04-15 12:23:51,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {105505#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105505#(< main_~i~0 965)} is VALID [2022-04-15 12:23:51,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {105512#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105505#(< main_~i~0 965)} is VALID [2022-04-15 12:23:51,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {105512#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105512#(< main_~i~0 964)} is VALID [2022-04-15 12:23:51,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {104550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {105512#(< main_~i~0 964)} is VALID [2022-04-15 12:23:51,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {104550#true} call #t~ret6 := main(); {104550#true} is VALID [2022-04-15 12:23:51,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104550#true} {104550#true} #64#return; {104550#true} is VALID [2022-04-15 12:23:51,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {104550#true} assume true; {104550#true} is VALID [2022-04-15 12:23:51,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {104550#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {104550#true} is VALID [2022-04-15 12:23:51,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {104550#true} call ULTIMATE.init(); {104550#true} is VALID [2022-04-15 12:23:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3610 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:23:51,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995927493] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:23:51,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:23:51,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 126 [2022-04-15 12:23:51,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:23:51,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1614120270] [2022-04-15 12:23:51,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1614120270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:23:51,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:23:51,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 12:23:51,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059108684] [2022-04-15 12:23:51,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:23:51,586 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2022-04-15 12:23:51,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:23:51,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:51,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:51,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-15 12:23:51,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:51,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-15 12:23:51,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7752, Invalid=7998, Unknown=0, NotChecked=0, Total=15750 [2022-04-15 12:23:51,666 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:06,877 INFO L93 Difference]: Finished difference Result 460 states and 586 transitions. [2022-04-15 12:24:06,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-15 12:24:06,877 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2022-04-15 12:24:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:24:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 577 transitions. [2022-04-15 12:24:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 577 transitions. [2022-04-15 12:24:06,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 577 transitions. [2022-04-15 12:24:07,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:24:07,257 INFO L225 Difference]: With dead ends: 460 [2022-04-15 12:24:07,257 INFO L226 Difference]: Without dead ends: 443 [2022-04-15 12:24:07,259 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=15378, Invalid=19404, Unknown=0, NotChecked=0, Total=34782 [2022-04-15 12:24:07,259 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1772 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1772 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:24:07,260 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1772 Valid, 42 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:24:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-04-15 12:24:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 146. [2022-04-15 12:24:08,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:24:08,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 443 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:08,166 INFO L74 IsIncluded]: Start isIncluded. First operand 443 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:08,166 INFO L87 Difference]: Start difference. First operand 443 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:08,173 INFO L93 Difference]: Finished difference Result 443 states and 565 transitions. [2022-04-15 12:24:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 565 transitions. [2022-04-15 12:24:08,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:08,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:08,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 443 states. [2022-04-15 12:24:08,174 INFO L87 Difference]: Start difference. First operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 443 states. [2022-04-15 12:24:08,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:08,181 INFO L93 Difference]: Finished difference Result 443 states and 565 transitions. [2022-04-15 12:24:08,181 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 565 transitions. [2022-04-15 12:24:08,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:08,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:08,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:24:08,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:24:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2022-04-15 12:24:08,183 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 143 [2022-04-15 12:24:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:24:08,183 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2022-04-15 12:24:08,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:08,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 150 transitions. [2022-04-15 12:24:08,571 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:24:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2022-04-15 12:24:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 12:24:08,572 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:24:08,572 INFO L499 BasicCegarLoop]: trace histogram [61, 61, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:24:08,590 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:08,772 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:08,772 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:24:08,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:24:08,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1528259229, now seen corresponding path program 123 times [2022-04-15 12:24:08,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:08,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1324371230] [2022-04-15 12:24:08,776 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:24:08,776 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:24:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1528259229, now seen corresponding path program 124 times [2022-04-15 12:24:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:24:08,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717164182] [2022-04-15 12:24:08,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:24:08,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:24:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:10,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:24:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:10,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {107823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {107756#true} is VALID [2022-04-15 12:24:10,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {107756#true} assume true; {107756#true} is VALID [2022-04-15 12:24:10,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107756#true} {107756#true} #64#return; {107756#true} is VALID [2022-04-15 12:24:10,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {107756#true} call ULTIMATE.init(); {107823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:24:10,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {107823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {107756#true} is VALID [2022-04-15 12:24:10,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {107756#true} assume true; {107756#true} is VALID [2022-04-15 12:24:10,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107756#true} {107756#true} #64#return; {107756#true} is VALID [2022-04-15 12:24:10,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {107756#true} call #t~ret6 := main(); {107756#true} is VALID [2022-04-15 12:24:10,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {107756#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {107761#(= main_~i~0 0)} is VALID [2022-04-15 12:24:10,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {107761#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107761#(= main_~i~0 0)} is VALID [2022-04-15 12:24:10,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {107761#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107762#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:10,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {107762#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107762#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:10,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {107762#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107763#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:10,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {107763#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107763#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:10,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {107763#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107764#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:10,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {107764#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107764#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:10,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {107764#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107765#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:10,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {107765#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107765#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:10,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {107765#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107766#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:10,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {107766#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107766#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:10,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {107766#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107767#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:10,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {107767#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107767#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:10,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {107767#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107768#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:10,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {107768#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107768#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:10,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {107768#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107769#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:10,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {107769#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107769#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:10,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {107769#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107770#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:10,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {107770#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107770#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:10,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {107770#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107771#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:10,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {107771#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107771#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:10,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {107771#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107772#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:10,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {107772#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107772#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:10,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {107772#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107773#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:10,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {107773#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107773#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:10,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {107773#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107774#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:10,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {107774#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107774#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:10,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {107774#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107775#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:10,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {107775#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107775#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:10,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {107775#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107776#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:10,034 INFO L290 TraceCheckUtils]: 36: Hoare triple {107776#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107776#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:10,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {107776#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107777#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:10,035 INFO L290 TraceCheckUtils]: 38: Hoare triple {107777#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107777#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:10,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {107777#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107778#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:10,035 INFO L290 TraceCheckUtils]: 40: Hoare triple {107778#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107778#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:10,036 INFO L290 TraceCheckUtils]: 41: Hoare triple {107778#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107779#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:10,036 INFO L290 TraceCheckUtils]: 42: Hoare triple {107779#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107779#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:10,036 INFO L290 TraceCheckUtils]: 43: Hoare triple {107779#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107780#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:10,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {107780#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107780#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:10,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {107780#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107781#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:10,037 INFO L290 TraceCheckUtils]: 46: Hoare triple {107781#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107781#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:10,037 INFO L290 TraceCheckUtils]: 47: Hoare triple {107781#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107782#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:10,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {107782#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107782#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:10,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {107782#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107783#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:10,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {107783#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107783#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:10,038 INFO L290 TraceCheckUtils]: 51: Hoare triple {107783#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107784#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:10,039 INFO L290 TraceCheckUtils]: 52: Hoare triple {107784#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107784#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:10,039 INFO L290 TraceCheckUtils]: 53: Hoare triple {107784#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107785#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:10,039 INFO L290 TraceCheckUtils]: 54: Hoare triple {107785#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107785#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:10,040 INFO L290 TraceCheckUtils]: 55: Hoare triple {107785#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107786#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:10,040 INFO L290 TraceCheckUtils]: 56: Hoare triple {107786#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107786#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:10,040 INFO L290 TraceCheckUtils]: 57: Hoare triple {107786#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107787#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:10,040 INFO L290 TraceCheckUtils]: 58: Hoare triple {107787#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107787#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:10,041 INFO L290 TraceCheckUtils]: 59: Hoare triple {107787#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107788#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:10,041 INFO L290 TraceCheckUtils]: 60: Hoare triple {107788#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107788#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:10,041 INFO L290 TraceCheckUtils]: 61: Hoare triple {107788#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107789#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:10,041 INFO L290 TraceCheckUtils]: 62: Hoare triple {107789#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107789#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:10,042 INFO L290 TraceCheckUtils]: 63: Hoare triple {107789#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107790#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:10,042 INFO L290 TraceCheckUtils]: 64: Hoare triple {107790#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107790#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:10,042 INFO L290 TraceCheckUtils]: 65: Hoare triple {107790#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107791#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:10,043 INFO L290 TraceCheckUtils]: 66: Hoare triple {107791#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107791#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:10,043 INFO L290 TraceCheckUtils]: 67: Hoare triple {107791#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107792#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:10,043 INFO L290 TraceCheckUtils]: 68: Hoare triple {107792#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107792#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:10,043 INFO L290 TraceCheckUtils]: 69: Hoare triple {107792#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107793#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:10,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {107793#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107793#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:10,044 INFO L290 TraceCheckUtils]: 71: Hoare triple {107793#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107794#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:10,044 INFO L290 TraceCheckUtils]: 72: Hoare triple {107794#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107794#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:10,044 INFO L290 TraceCheckUtils]: 73: Hoare triple {107794#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107795#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:10,045 INFO L290 TraceCheckUtils]: 74: Hoare triple {107795#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107795#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:10,045 INFO L290 TraceCheckUtils]: 75: Hoare triple {107795#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107796#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:10,045 INFO L290 TraceCheckUtils]: 76: Hoare triple {107796#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107796#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:10,046 INFO L290 TraceCheckUtils]: 77: Hoare triple {107796#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107797#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:10,046 INFO L290 TraceCheckUtils]: 78: Hoare triple {107797#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107797#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:10,046 INFO L290 TraceCheckUtils]: 79: Hoare triple {107797#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107798#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:10,046 INFO L290 TraceCheckUtils]: 80: Hoare triple {107798#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107798#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:10,047 INFO L290 TraceCheckUtils]: 81: Hoare triple {107798#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107799#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:10,047 INFO L290 TraceCheckUtils]: 82: Hoare triple {107799#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107799#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:10,047 INFO L290 TraceCheckUtils]: 83: Hoare triple {107799#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107800#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:10,047 INFO L290 TraceCheckUtils]: 84: Hoare triple {107800#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107800#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:10,048 INFO L290 TraceCheckUtils]: 85: Hoare triple {107800#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107801#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:10,048 INFO L290 TraceCheckUtils]: 86: Hoare triple {107801#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107801#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:10,048 INFO L290 TraceCheckUtils]: 87: Hoare triple {107801#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107802#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:10,049 INFO L290 TraceCheckUtils]: 88: Hoare triple {107802#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107802#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:10,049 INFO L290 TraceCheckUtils]: 89: Hoare triple {107802#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107803#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:10,049 INFO L290 TraceCheckUtils]: 90: Hoare triple {107803#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107803#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:10,049 INFO L290 TraceCheckUtils]: 91: Hoare triple {107803#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107804#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:10,050 INFO L290 TraceCheckUtils]: 92: Hoare triple {107804#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107804#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:10,050 INFO L290 TraceCheckUtils]: 93: Hoare triple {107804#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107805#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:10,050 INFO L290 TraceCheckUtils]: 94: Hoare triple {107805#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107805#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:10,050 INFO L290 TraceCheckUtils]: 95: Hoare triple {107805#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107806#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:10,051 INFO L290 TraceCheckUtils]: 96: Hoare triple {107806#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107806#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:10,051 INFO L290 TraceCheckUtils]: 97: Hoare triple {107806#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107807#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:10,051 INFO L290 TraceCheckUtils]: 98: Hoare triple {107807#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107807#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:10,052 INFO L290 TraceCheckUtils]: 99: Hoare triple {107807#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107808#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:10,052 INFO L290 TraceCheckUtils]: 100: Hoare triple {107808#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107808#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:10,052 INFO L290 TraceCheckUtils]: 101: Hoare triple {107808#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107809#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:10,052 INFO L290 TraceCheckUtils]: 102: Hoare triple {107809#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107809#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:10,053 INFO L290 TraceCheckUtils]: 103: Hoare triple {107809#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107810#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:10,053 INFO L290 TraceCheckUtils]: 104: Hoare triple {107810#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107810#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:10,053 INFO L290 TraceCheckUtils]: 105: Hoare triple {107810#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107811#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:10,053 INFO L290 TraceCheckUtils]: 106: Hoare triple {107811#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107811#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:10,054 INFO L290 TraceCheckUtils]: 107: Hoare triple {107811#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107812#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:10,054 INFO L290 TraceCheckUtils]: 108: Hoare triple {107812#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107812#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:10,054 INFO L290 TraceCheckUtils]: 109: Hoare triple {107812#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107813#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:10,054 INFO L290 TraceCheckUtils]: 110: Hoare triple {107813#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107813#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:10,055 INFO L290 TraceCheckUtils]: 111: Hoare triple {107813#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107814#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:10,055 INFO L290 TraceCheckUtils]: 112: Hoare triple {107814#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107814#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:10,055 INFO L290 TraceCheckUtils]: 113: Hoare triple {107814#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107815#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:10,056 INFO L290 TraceCheckUtils]: 114: Hoare triple {107815#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107815#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:10,056 INFO L290 TraceCheckUtils]: 115: Hoare triple {107815#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107816#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:10,056 INFO L290 TraceCheckUtils]: 116: Hoare triple {107816#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107816#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:10,056 INFO L290 TraceCheckUtils]: 117: Hoare triple {107816#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107817#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:10,057 INFO L290 TraceCheckUtils]: 118: Hoare triple {107817#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107817#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:10,057 INFO L290 TraceCheckUtils]: 119: Hoare triple {107817#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107818#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:10,057 INFO L290 TraceCheckUtils]: 120: Hoare triple {107818#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107818#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:10,058 INFO L290 TraceCheckUtils]: 121: Hoare triple {107818#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107819#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:10,058 INFO L290 TraceCheckUtils]: 122: Hoare triple {107819#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107819#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:10,058 INFO L290 TraceCheckUtils]: 123: Hoare triple {107819#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107820#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:10,058 INFO L290 TraceCheckUtils]: 124: Hoare triple {107820#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107820#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:10,059 INFO L290 TraceCheckUtils]: 125: Hoare triple {107820#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107821#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:10,059 INFO L290 TraceCheckUtils]: 126: Hoare triple {107821#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107821#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:10,059 INFO L290 TraceCheckUtils]: 127: Hoare triple {107821#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107822#(<= main_~i~0 61)} is VALID [2022-04-15 12:24:10,059 INFO L290 TraceCheckUtils]: 128: Hoare triple {107822#(<= main_~i~0 61)} assume !(~i~0 < 1024); {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 129: Hoare triple {107757#false} ~i~0 := 0; {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 130: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 131: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 132: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 133: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 134: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 135: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 136: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 137: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 138: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 139: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 140: Hoare triple {107757#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L272 TraceCheckUtils]: 141: Hoare triple {107757#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 142: Hoare triple {107757#false} ~cond := #in~cond; {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 143: Hoare triple {107757#false} assume 0 == ~cond; {107757#false} is VALID [2022-04-15 12:24:10,060 INFO L290 TraceCheckUtils]: 144: Hoare triple {107757#false} assume !false; {107757#false} is VALID [2022-04-15 12:24:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3731 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:24:10,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:24:10,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717164182] [2022-04-15 12:24:10,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717164182] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:24:10,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704103252] [2022-04-15 12:24:10,061 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:24:10,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:24:10,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:24:10,062 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:10,063 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:10,446 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:24:10,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:24:10,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 12:24:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:10,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:24:11,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {107756#true} call ULTIMATE.init(); {107756#true} is VALID [2022-04-15 12:24:11,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {107756#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {107756#true} is VALID [2022-04-15 12:24:11,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {107756#true} assume true; {107756#true} is VALID [2022-04-15 12:24:11,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107756#true} {107756#true} #64#return; {107756#true} is VALID [2022-04-15 12:24:11,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {107756#true} call #t~ret6 := main(); {107756#true} is VALID [2022-04-15 12:24:11,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {107756#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {107842#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:11,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {107842#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107842#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:11,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {107842#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107762#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:11,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {107762#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107762#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:11,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {107762#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107763#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:11,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {107763#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107763#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:11,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {107763#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107764#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:11,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {107764#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107764#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:11,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {107764#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107765#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:11,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {107765#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107765#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:11,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {107765#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107766#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:11,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {107766#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107766#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:11,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {107766#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107767#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:11,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {107767#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107767#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:11,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {107767#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107768#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:11,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {107768#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107768#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:11,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {107768#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107769#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:11,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {107769#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107769#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:11,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {107769#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107770#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:11,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {107770#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107770#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:11,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {107770#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107771#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:11,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {107771#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107771#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:11,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {107771#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107772#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:11,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {107772#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107772#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:11,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {107772#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107773#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:11,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {107773#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107773#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:11,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {107773#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107774#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:11,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {107774#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107774#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:11,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {107774#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107775#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:11,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {107775#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107775#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:11,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {107775#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107776#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:11,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {107776#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107776#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:11,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {107776#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107777#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:11,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {107777#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107777#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:11,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {107777#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107778#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:11,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {107778#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107778#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:11,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {107778#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107779#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:11,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {107779#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107779#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:11,196 INFO L290 TraceCheckUtils]: 43: Hoare triple {107779#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107780#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:11,196 INFO L290 TraceCheckUtils]: 44: Hoare triple {107780#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107780#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:11,197 INFO L290 TraceCheckUtils]: 45: Hoare triple {107780#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107781#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:11,197 INFO L290 TraceCheckUtils]: 46: Hoare triple {107781#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107781#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:11,197 INFO L290 TraceCheckUtils]: 47: Hoare triple {107781#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107782#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:11,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {107782#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107782#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:11,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {107782#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107783#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:11,198 INFO L290 TraceCheckUtils]: 50: Hoare triple {107783#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107783#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:11,198 INFO L290 TraceCheckUtils]: 51: Hoare triple {107783#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107784#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:11,199 INFO L290 TraceCheckUtils]: 52: Hoare triple {107784#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107784#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:11,199 INFO L290 TraceCheckUtils]: 53: Hoare triple {107784#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107785#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:11,199 INFO L290 TraceCheckUtils]: 54: Hoare triple {107785#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107785#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:11,200 INFO L290 TraceCheckUtils]: 55: Hoare triple {107785#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107786#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:11,200 INFO L290 TraceCheckUtils]: 56: Hoare triple {107786#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107786#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:11,200 INFO L290 TraceCheckUtils]: 57: Hoare triple {107786#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107787#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:11,200 INFO L290 TraceCheckUtils]: 58: Hoare triple {107787#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107787#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:11,201 INFO L290 TraceCheckUtils]: 59: Hoare triple {107787#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107788#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:11,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {107788#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107788#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:11,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {107788#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107789#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:11,201 INFO L290 TraceCheckUtils]: 62: Hoare triple {107789#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107789#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:11,202 INFO L290 TraceCheckUtils]: 63: Hoare triple {107789#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107790#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:11,202 INFO L290 TraceCheckUtils]: 64: Hoare triple {107790#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107790#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:11,202 INFO L290 TraceCheckUtils]: 65: Hoare triple {107790#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107791#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:11,202 INFO L290 TraceCheckUtils]: 66: Hoare triple {107791#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107791#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:11,203 INFO L290 TraceCheckUtils]: 67: Hoare triple {107791#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107792#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:11,203 INFO L290 TraceCheckUtils]: 68: Hoare triple {107792#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107792#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:11,203 INFO L290 TraceCheckUtils]: 69: Hoare triple {107792#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107793#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:11,204 INFO L290 TraceCheckUtils]: 70: Hoare triple {107793#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107793#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:11,204 INFO L290 TraceCheckUtils]: 71: Hoare triple {107793#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107794#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:11,204 INFO L290 TraceCheckUtils]: 72: Hoare triple {107794#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107794#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:11,204 INFO L290 TraceCheckUtils]: 73: Hoare triple {107794#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107795#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:11,205 INFO L290 TraceCheckUtils]: 74: Hoare triple {107795#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107795#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:11,205 INFO L290 TraceCheckUtils]: 75: Hoare triple {107795#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107796#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:11,205 INFO L290 TraceCheckUtils]: 76: Hoare triple {107796#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107796#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:11,206 INFO L290 TraceCheckUtils]: 77: Hoare triple {107796#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107797#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:11,206 INFO L290 TraceCheckUtils]: 78: Hoare triple {107797#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107797#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:11,206 INFO L290 TraceCheckUtils]: 79: Hoare triple {107797#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107798#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:11,206 INFO L290 TraceCheckUtils]: 80: Hoare triple {107798#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107798#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:11,207 INFO L290 TraceCheckUtils]: 81: Hoare triple {107798#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107799#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:11,207 INFO L290 TraceCheckUtils]: 82: Hoare triple {107799#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107799#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:11,207 INFO L290 TraceCheckUtils]: 83: Hoare triple {107799#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107800#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:11,207 INFO L290 TraceCheckUtils]: 84: Hoare triple {107800#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107800#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:11,208 INFO L290 TraceCheckUtils]: 85: Hoare triple {107800#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107801#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:11,208 INFO L290 TraceCheckUtils]: 86: Hoare triple {107801#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107801#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:11,208 INFO L290 TraceCheckUtils]: 87: Hoare triple {107801#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107802#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:11,209 INFO L290 TraceCheckUtils]: 88: Hoare triple {107802#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107802#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:11,209 INFO L290 TraceCheckUtils]: 89: Hoare triple {107802#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107803#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:11,209 INFO L290 TraceCheckUtils]: 90: Hoare triple {107803#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107803#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:11,209 INFO L290 TraceCheckUtils]: 91: Hoare triple {107803#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107804#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:11,210 INFO L290 TraceCheckUtils]: 92: Hoare triple {107804#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107804#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:11,210 INFO L290 TraceCheckUtils]: 93: Hoare triple {107804#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107805#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:11,210 INFO L290 TraceCheckUtils]: 94: Hoare triple {107805#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107805#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:11,211 INFO L290 TraceCheckUtils]: 95: Hoare triple {107805#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107806#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:11,211 INFO L290 TraceCheckUtils]: 96: Hoare triple {107806#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107806#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:11,211 INFO L290 TraceCheckUtils]: 97: Hoare triple {107806#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107807#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:11,211 INFO L290 TraceCheckUtils]: 98: Hoare triple {107807#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107807#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:11,212 INFO L290 TraceCheckUtils]: 99: Hoare triple {107807#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107808#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:11,212 INFO L290 TraceCheckUtils]: 100: Hoare triple {107808#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107808#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:11,212 INFO L290 TraceCheckUtils]: 101: Hoare triple {107808#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107809#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:11,212 INFO L290 TraceCheckUtils]: 102: Hoare triple {107809#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107809#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:11,213 INFO L290 TraceCheckUtils]: 103: Hoare triple {107809#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107810#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:11,213 INFO L290 TraceCheckUtils]: 104: Hoare triple {107810#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107810#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:11,213 INFO L290 TraceCheckUtils]: 105: Hoare triple {107810#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107811#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:11,214 INFO L290 TraceCheckUtils]: 106: Hoare triple {107811#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107811#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:11,214 INFO L290 TraceCheckUtils]: 107: Hoare triple {107811#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107812#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:11,214 INFO L290 TraceCheckUtils]: 108: Hoare triple {107812#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107812#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:11,214 INFO L290 TraceCheckUtils]: 109: Hoare triple {107812#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107813#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:11,215 INFO L290 TraceCheckUtils]: 110: Hoare triple {107813#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107813#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:11,215 INFO L290 TraceCheckUtils]: 111: Hoare triple {107813#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107814#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:11,215 INFO L290 TraceCheckUtils]: 112: Hoare triple {107814#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107814#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:11,216 INFO L290 TraceCheckUtils]: 113: Hoare triple {107814#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107815#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:11,216 INFO L290 TraceCheckUtils]: 114: Hoare triple {107815#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107815#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:11,216 INFO L290 TraceCheckUtils]: 115: Hoare triple {107815#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107816#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:11,216 INFO L290 TraceCheckUtils]: 116: Hoare triple {107816#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107816#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:11,217 INFO L290 TraceCheckUtils]: 117: Hoare triple {107816#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107817#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:11,217 INFO L290 TraceCheckUtils]: 118: Hoare triple {107817#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107817#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:11,217 INFO L290 TraceCheckUtils]: 119: Hoare triple {107817#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107818#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:11,217 INFO L290 TraceCheckUtils]: 120: Hoare triple {107818#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107818#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:11,218 INFO L290 TraceCheckUtils]: 121: Hoare triple {107818#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107819#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:11,218 INFO L290 TraceCheckUtils]: 122: Hoare triple {107819#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107819#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:11,218 INFO L290 TraceCheckUtils]: 123: Hoare triple {107819#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107820#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:11,219 INFO L290 TraceCheckUtils]: 124: Hoare triple {107820#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107820#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:11,219 INFO L290 TraceCheckUtils]: 125: Hoare triple {107820#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107821#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:11,219 INFO L290 TraceCheckUtils]: 126: Hoare triple {107821#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107821#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:11,219 INFO L290 TraceCheckUtils]: 127: Hoare triple {107821#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107822#(<= main_~i~0 61)} is VALID [2022-04-15 12:24:11,220 INFO L290 TraceCheckUtils]: 128: Hoare triple {107822#(<= main_~i~0 61)} assume !(~i~0 < 1024); {107757#false} is VALID [2022-04-15 12:24:11,220 INFO L290 TraceCheckUtils]: 129: Hoare triple {107757#false} ~i~0 := 0; {107757#false} is VALID [2022-04-15 12:24:11,220 INFO L290 TraceCheckUtils]: 130: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 12:24:11,220 INFO L290 TraceCheckUtils]: 131: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 12:24:11,220 INFO L290 TraceCheckUtils]: 132: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 12:24:11,220 INFO L290 TraceCheckUtils]: 133: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-15 12:24:11,220 INFO L290 TraceCheckUtils]: 134: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 12:24:11,220 INFO L290 TraceCheckUtils]: 135: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 12:24:11,220 INFO L290 TraceCheckUtils]: 136: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 12:24:11,220 INFO L290 TraceCheckUtils]: 137: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-15 12:24:11,220 INFO L290 TraceCheckUtils]: 138: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 12:24:11,220 INFO L290 TraceCheckUtils]: 139: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 12:24:11,220 INFO L290 TraceCheckUtils]: 140: Hoare triple {107757#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 12:24:11,220 INFO L272 TraceCheckUtils]: 141: Hoare triple {107757#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {107757#false} is VALID [2022-04-15 12:24:11,220 INFO L290 TraceCheckUtils]: 142: Hoare triple {107757#false} ~cond := #in~cond; {107757#false} is VALID [2022-04-15 12:24:11,221 INFO L290 TraceCheckUtils]: 143: Hoare triple {107757#false} assume 0 == ~cond; {107757#false} is VALID [2022-04-15 12:24:11,221 INFO L290 TraceCheckUtils]: 144: Hoare triple {107757#false} assume !false; {107757#false} is VALID [2022-04-15 12:24:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3731 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:24:11,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:24:15,038 INFO L290 TraceCheckUtils]: 144: Hoare triple {107757#false} assume !false; {107757#false} is VALID [2022-04-15 12:24:15,038 INFO L290 TraceCheckUtils]: 143: Hoare triple {107757#false} assume 0 == ~cond; {107757#false} is VALID [2022-04-15 12:24:15,038 INFO L290 TraceCheckUtils]: 142: Hoare triple {107757#false} ~cond := #in~cond; {107757#false} is VALID [2022-04-15 12:24:15,038 INFO L272 TraceCheckUtils]: 141: Hoare triple {107757#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {107757#false} is VALID [2022-04-15 12:24:15,038 INFO L290 TraceCheckUtils]: 140: Hoare triple {107757#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 12:24:15,038 INFO L290 TraceCheckUtils]: 139: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 12:24:15,038 INFO L290 TraceCheckUtils]: 138: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 12:24:15,038 INFO L290 TraceCheckUtils]: 137: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-15 12:24:15,038 INFO L290 TraceCheckUtils]: 136: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 12:24:15,039 INFO L290 TraceCheckUtils]: 135: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 12:24:15,039 INFO L290 TraceCheckUtils]: 134: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 12:24:15,039 INFO L290 TraceCheckUtils]: 133: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-15 12:24:15,039 INFO L290 TraceCheckUtils]: 132: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 12:24:15,039 INFO L290 TraceCheckUtils]: 131: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 12:24:15,039 INFO L290 TraceCheckUtils]: 130: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 12:24:15,039 INFO L290 TraceCheckUtils]: 129: Hoare triple {107757#false} ~i~0 := 0; {107757#false} is VALID [2022-04-15 12:24:15,039 INFO L290 TraceCheckUtils]: 128: Hoare triple {108308#(< main_~i~0 1024)} assume !(~i~0 < 1024); {107757#false} is VALID [2022-04-15 12:24:15,039 INFO L290 TraceCheckUtils]: 127: Hoare triple {108312#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108308#(< main_~i~0 1024)} is VALID [2022-04-15 12:24:15,040 INFO L290 TraceCheckUtils]: 126: Hoare triple {108312#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108312#(< main_~i~0 1023)} is VALID [2022-04-15 12:24:15,040 INFO L290 TraceCheckUtils]: 125: Hoare triple {108319#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108312#(< main_~i~0 1023)} is VALID [2022-04-15 12:24:15,040 INFO L290 TraceCheckUtils]: 124: Hoare triple {108319#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108319#(< main_~i~0 1022)} is VALID [2022-04-15 12:24:15,041 INFO L290 TraceCheckUtils]: 123: Hoare triple {108326#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108319#(< main_~i~0 1022)} is VALID [2022-04-15 12:24:15,041 INFO L290 TraceCheckUtils]: 122: Hoare triple {108326#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108326#(< main_~i~0 1021)} is VALID [2022-04-15 12:24:15,041 INFO L290 TraceCheckUtils]: 121: Hoare triple {108333#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108326#(< main_~i~0 1021)} is VALID [2022-04-15 12:24:15,041 INFO L290 TraceCheckUtils]: 120: Hoare triple {108333#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108333#(< main_~i~0 1020)} is VALID [2022-04-15 12:24:15,042 INFO L290 TraceCheckUtils]: 119: Hoare triple {108340#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108333#(< main_~i~0 1020)} is VALID [2022-04-15 12:24:15,042 INFO L290 TraceCheckUtils]: 118: Hoare triple {108340#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108340#(< main_~i~0 1019)} is VALID [2022-04-15 12:24:15,042 INFO L290 TraceCheckUtils]: 117: Hoare triple {108347#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108340#(< main_~i~0 1019)} is VALID [2022-04-15 12:24:15,043 INFO L290 TraceCheckUtils]: 116: Hoare triple {108347#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108347#(< main_~i~0 1018)} is VALID [2022-04-15 12:24:15,043 INFO L290 TraceCheckUtils]: 115: Hoare triple {108354#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108347#(< main_~i~0 1018)} is VALID [2022-04-15 12:24:15,043 INFO L290 TraceCheckUtils]: 114: Hoare triple {108354#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108354#(< main_~i~0 1017)} is VALID [2022-04-15 12:24:15,043 INFO L290 TraceCheckUtils]: 113: Hoare triple {108361#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108354#(< main_~i~0 1017)} is VALID [2022-04-15 12:24:15,044 INFO L290 TraceCheckUtils]: 112: Hoare triple {108361#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108361#(< main_~i~0 1016)} is VALID [2022-04-15 12:24:15,044 INFO L290 TraceCheckUtils]: 111: Hoare triple {108368#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108361#(< main_~i~0 1016)} is VALID [2022-04-15 12:24:15,044 INFO L290 TraceCheckUtils]: 110: Hoare triple {108368#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108368#(< main_~i~0 1015)} is VALID [2022-04-15 12:24:15,045 INFO L290 TraceCheckUtils]: 109: Hoare triple {108375#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108368#(< main_~i~0 1015)} is VALID [2022-04-15 12:24:15,045 INFO L290 TraceCheckUtils]: 108: Hoare triple {108375#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108375#(< main_~i~0 1014)} is VALID [2022-04-15 12:24:15,045 INFO L290 TraceCheckUtils]: 107: Hoare triple {108382#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108375#(< main_~i~0 1014)} is VALID [2022-04-15 12:24:15,045 INFO L290 TraceCheckUtils]: 106: Hoare triple {108382#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108382#(< main_~i~0 1013)} is VALID [2022-04-15 12:24:15,046 INFO L290 TraceCheckUtils]: 105: Hoare triple {108389#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108382#(< main_~i~0 1013)} is VALID [2022-04-15 12:24:15,046 INFO L290 TraceCheckUtils]: 104: Hoare triple {108389#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108389#(< main_~i~0 1012)} is VALID [2022-04-15 12:24:15,046 INFO L290 TraceCheckUtils]: 103: Hoare triple {108396#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108389#(< main_~i~0 1012)} is VALID [2022-04-15 12:24:15,046 INFO L290 TraceCheckUtils]: 102: Hoare triple {108396#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108396#(< main_~i~0 1011)} is VALID [2022-04-15 12:24:15,047 INFO L290 TraceCheckUtils]: 101: Hoare triple {108403#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108396#(< main_~i~0 1011)} is VALID [2022-04-15 12:24:15,047 INFO L290 TraceCheckUtils]: 100: Hoare triple {108403#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108403#(< main_~i~0 1010)} is VALID [2022-04-15 12:24:15,047 INFO L290 TraceCheckUtils]: 99: Hoare triple {108410#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108403#(< main_~i~0 1010)} is VALID [2022-04-15 12:24:15,048 INFO L290 TraceCheckUtils]: 98: Hoare triple {108410#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108410#(< main_~i~0 1009)} is VALID [2022-04-15 12:24:15,048 INFO L290 TraceCheckUtils]: 97: Hoare triple {108417#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108410#(< main_~i~0 1009)} is VALID [2022-04-15 12:24:15,048 INFO L290 TraceCheckUtils]: 96: Hoare triple {108417#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108417#(< main_~i~0 1008)} is VALID [2022-04-15 12:24:15,048 INFO L290 TraceCheckUtils]: 95: Hoare triple {108424#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108417#(< main_~i~0 1008)} is VALID [2022-04-15 12:24:15,049 INFO L290 TraceCheckUtils]: 94: Hoare triple {108424#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108424#(< main_~i~0 1007)} is VALID [2022-04-15 12:24:15,049 INFO L290 TraceCheckUtils]: 93: Hoare triple {108431#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108424#(< main_~i~0 1007)} is VALID [2022-04-15 12:24:15,049 INFO L290 TraceCheckUtils]: 92: Hoare triple {108431#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108431#(< main_~i~0 1006)} is VALID [2022-04-15 12:24:15,049 INFO L290 TraceCheckUtils]: 91: Hoare triple {108438#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108431#(< main_~i~0 1006)} is VALID [2022-04-15 12:24:15,050 INFO L290 TraceCheckUtils]: 90: Hoare triple {108438#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108438#(< main_~i~0 1005)} is VALID [2022-04-15 12:24:15,050 INFO L290 TraceCheckUtils]: 89: Hoare triple {108445#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108438#(< main_~i~0 1005)} is VALID [2022-04-15 12:24:15,050 INFO L290 TraceCheckUtils]: 88: Hoare triple {108445#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108445#(< main_~i~0 1004)} is VALID [2022-04-15 12:24:15,051 INFO L290 TraceCheckUtils]: 87: Hoare triple {108452#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108445#(< main_~i~0 1004)} is VALID [2022-04-15 12:24:15,051 INFO L290 TraceCheckUtils]: 86: Hoare triple {108452#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108452#(< main_~i~0 1003)} is VALID [2022-04-15 12:24:15,051 INFO L290 TraceCheckUtils]: 85: Hoare triple {108459#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108452#(< main_~i~0 1003)} is VALID [2022-04-15 12:24:15,051 INFO L290 TraceCheckUtils]: 84: Hoare triple {108459#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108459#(< main_~i~0 1002)} is VALID [2022-04-15 12:24:15,052 INFO L290 TraceCheckUtils]: 83: Hoare triple {108466#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108459#(< main_~i~0 1002)} is VALID [2022-04-15 12:24:15,052 INFO L290 TraceCheckUtils]: 82: Hoare triple {108466#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108466#(< main_~i~0 1001)} is VALID [2022-04-15 12:24:15,052 INFO L290 TraceCheckUtils]: 81: Hoare triple {108473#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108466#(< main_~i~0 1001)} is VALID [2022-04-15 12:24:15,053 INFO L290 TraceCheckUtils]: 80: Hoare triple {108473#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108473#(< main_~i~0 1000)} is VALID [2022-04-15 12:24:15,053 INFO L290 TraceCheckUtils]: 79: Hoare triple {108480#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108473#(< main_~i~0 1000)} is VALID [2022-04-15 12:24:15,053 INFO L290 TraceCheckUtils]: 78: Hoare triple {108480#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108480#(< main_~i~0 999)} is VALID [2022-04-15 12:24:15,053 INFO L290 TraceCheckUtils]: 77: Hoare triple {108487#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108480#(< main_~i~0 999)} is VALID [2022-04-15 12:24:15,054 INFO L290 TraceCheckUtils]: 76: Hoare triple {108487#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108487#(< main_~i~0 998)} is VALID [2022-04-15 12:24:15,054 INFO L290 TraceCheckUtils]: 75: Hoare triple {108494#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108487#(< main_~i~0 998)} is VALID [2022-04-15 12:24:15,054 INFO L290 TraceCheckUtils]: 74: Hoare triple {108494#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108494#(< main_~i~0 997)} is VALID [2022-04-15 12:24:15,055 INFO L290 TraceCheckUtils]: 73: Hoare triple {108501#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108494#(< main_~i~0 997)} is VALID [2022-04-15 12:24:15,055 INFO L290 TraceCheckUtils]: 72: Hoare triple {108501#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108501#(< main_~i~0 996)} is VALID [2022-04-15 12:24:15,055 INFO L290 TraceCheckUtils]: 71: Hoare triple {108508#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108501#(< main_~i~0 996)} is VALID [2022-04-15 12:24:15,055 INFO L290 TraceCheckUtils]: 70: Hoare triple {108508#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108508#(< main_~i~0 995)} is VALID [2022-04-15 12:24:15,056 INFO L290 TraceCheckUtils]: 69: Hoare triple {108515#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108508#(< main_~i~0 995)} is VALID [2022-04-15 12:24:15,056 INFO L290 TraceCheckUtils]: 68: Hoare triple {108515#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108515#(< main_~i~0 994)} is VALID [2022-04-15 12:24:15,056 INFO L290 TraceCheckUtils]: 67: Hoare triple {108522#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108515#(< main_~i~0 994)} is VALID [2022-04-15 12:24:15,056 INFO L290 TraceCheckUtils]: 66: Hoare triple {108522#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108522#(< main_~i~0 993)} is VALID [2022-04-15 12:24:15,057 INFO L290 TraceCheckUtils]: 65: Hoare triple {108529#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108522#(< main_~i~0 993)} is VALID [2022-04-15 12:24:15,057 INFO L290 TraceCheckUtils]: 64: Hoare triple {108529#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108529#(< main_~i~0 992)} is VALID [2022-04-15 12:24:15,057 INFO L290 TraceCheckUtils]: 63: Hoare triple {108536#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108529#(< main_~i~0 992)} is VALID [2022-04-15 12:24:15,058 INFO L290 TraceCheckUtils]: 62: Hoare triple {108536#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108536#(< main_~i~0 991)} is VALID [2022-04-15 12:24:15,058 INFO L290 TraceCheckUtils]: 61: Hoare triple {108543#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108536#(< main_~i~0 991)} is VALID [2022-04-15 12:24:15,058 INFO L290 TraceCheckUtils]: 60: Hoare triple {108543#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108543#(< main_~i~0 990)} is VALID [2022-04-15 12:24:15,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {108550#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108543#(< main_~i~0 990)} is VALID [2022-04-15 12:24:15,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {108550#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108550#(< main_~i~0 989)} is VALID [2022-04-15 12:24:15,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {108557#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108550#(< main_~i~0 989)} is VALID [2022-04-15 12:24:15,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {108557#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108557#(< main_~i~0 988)} is VALID [2022-04-15 12:24:15,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {108564#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108557#(< main_~i~0 988)} is VALID [2022-04-15 12:24:15,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {108564#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108564#(< main_~i~0 987)} is VALID [2022-04-15 12:24:15,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {108571#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108564#(< main_~i~0 987)} is VALID [2022-04-15 12:24:15,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {108571#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108571#(< main_~i~0 986)} is VALID [2022-04-15 12:24:15,061 INFO L290 TraceCheckUtils]: 51: Hoare triple {108578#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108571#(< main_~i~0 986)} is VALID [2022-04-15 12:24:15,061 INFO L290 TraceCheckUtils]: 50: Hoare triple {108578#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108578#(< main_~i~0 985)} is VALID [2022-04-15 12:24:15,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {108585#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108578#(< main_~i~0 985)} is VALID [2022-04-15 12:24:15,061 INFO L290 TraceCheckUtils]: 48: Hoare triple {108585#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108585#(< main_~i~0 984)} is VALID [2022-04-15 12:24:15,062 INFO L290 TraceCheckUtils]: 47: Hoare triple {108592#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108585#(< main_~i~0 984)} is VALID [2022-04-15 12:24:15,062 INFO L290 TraceCheckUtils]: 46: Hoare triple {108592#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108592#(< main_~i~0 983)} is VALID [2022-04-15 12:24:15,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {108599#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108592#(< main_~i~0 983)} is VALID [2022-04-15 12:24:15,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {108599#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108599#(< main_~i~0 982)} is VALID [2022-04-15 12:24:15,063 INFO L290 TraceCheckUtils]: 43: Hoare triple {108606#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108599#(< main_~i~0 982)} is VALID [2022-04-15 12:24:15,063 INFO L290 TraceCheckUtils]: 42: Hoare triple {108606#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108606#(< main_~i~0 981)} is VALID [2022-04-15 12:24:15,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {108613#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108606#(< main_~i~0 981)} is VALID [2022-04-15 12:24:15,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {108613#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108613#(< main_~i~0 980)} is VALID [2022-04-15 12:24:15,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {108620#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108613#(< main_~i~0 980)} is VALID [2022-04-15 12:24:15,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {108620#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108620#(< main_~i~0 979)} is VALID [2022-04-15 12:24:15,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {108627#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108620#(< main_~i~0 979)} is VALID [2022-04-15 12:24:15,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {108627#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108627#(< main_~i~0 978)} is VALID [2022-04-15 12:24:15,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {108634#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108627#(< main_~i~0 978)} is VALID [2022-04-15 12:24:15,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {108634#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108634#(< main_~i~0 977)} is VALID [2022-04-15 12:24:15,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {108641#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108634#(< main_~i~0 977)} is VALID [2022-04-15 12:24:15,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {108641#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108641#(< main_~i~0 976)} is VALID [2022-04-15 12:24:15,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {108648#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108641#(< main_~i~0 976)} is VALID [2022-04-15 12:24:15,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {108648#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108648#(< main_~i~0 975)} is VALID [2022-04-15 12:24:15,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {108655#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108648#(< main_~i~0 975)} is VALID [2022-04-15 12:24:15,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {108655#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108655#(< main_~i~0 974)} is VALID [2022-04-15 12:24:15,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {108662#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108655#(< main_~i~0 974)} is VALID [2022-04-15 12:24:15,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {108662#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108662#(< main_~i~0 973)} is VALID [2022-04-15 12:24:15,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {108669#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108662#(< main_~i~0 973)} is VALID [2022-04-15 12:24:15,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {108669#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108669#(< main_~i~0 972)} is VALID [2022-04-15 12:24:15,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {108676#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108669#(< main_~i~0 972)} is VALID [2022-04-15 12:24:15,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {108676#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108676#(< main_~i~0 971)} is VALID [2022-04-15 12:24:15,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {108683#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108676#(< main_~i~0 971)} is VALID [2022-04-15 12:24:15,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {108683#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108683#(< main_~i~0 970)} is VALID [2022-04-15 12:24:15,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {108690#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108683#(< main_~i~0 970)} is VALID [2022-04-15 12:24:15,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {108690#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108690#(< main_~i~0 969)} is VALID [2022-04-15 12:24:15,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {108697#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108690#(< main_~i~0 969)} is VALID [2022-04-15 12:24:15,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {108697#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108697#(< main_~i~0 968)} is VALID [2022-04-15 12:24:15,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {108704#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108697#(< main_~i~0 968)} is VALID [2022-04-15 12:24:15,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {108704#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108704#(< main_~i~0 967)} is VALID [2022-04-15 12:24:15,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {108711#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108704#(< main_~i~0 967)} is VALID [2022-04-15 12:24:15,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {108711#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108711#(< main_~i~0 966)} is VALID [2022-04-15 12:24:15,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {108718#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108711#(< main_~i~0 966)} is VALID [2022-04-15 12:24:15,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {108718#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108718#(< main_~i~0 965)} is VALID [2022-04-15 12:24:15,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {108725#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108718#(< main_~i~0 965)} is VALID [2022-04-15 12:24:15,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {108725#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108725#(< main_~i~0 964)} is VALID [2022-04-15 12:24:15,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {108732#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108725#(< main_~i~0 964)} is VALID [2022-04-15 12:24:15,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {108732#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108732#(< main_~i~0 963)} is VALID [2022-04-15 12:24:15,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {107756#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {108732#(< main_~i~0 963)} is VALID [2022-04-15 12:24:15,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {107756#true} call #t~ret6 := main(); {107756#true} is VALID [2022-04-15 12:24:15,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107756#true} {107756#true} #64#return; {107756#true} is VALID [2022-04-15 12:24:15,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {107756#true} assume true; {107756#true} is VALID [2022-04-15 12:24:15,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {107756#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {107756#true} is VALID [2022-04-15 12:24:15,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {107756#true} call ULTIMATE.init(); {107756#true} is VALID [2022-04-15 12:24:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3731 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:24:15,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704103252] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:24:15,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:24:15,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 64, 64] total 128 [2022-04-15 12:24:15,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:24:15,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1324371230] [2022-04-15 12:24:15,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1324371230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:24:15,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:24:15,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-15 12:24:15,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284217006] [2022-04-15 12:24:15,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:24:15,075 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 12:24:15,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:24:15,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:15,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:24:15,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-15 12:24:15,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:15,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-15 12:24:15,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8003, Invalid=8253, Unknown=0, NotChecked=0, Total=16256 [2022-04-15 12:24:15,154 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:30,752 INFO L93 Difference]: Finished difference Result 467 states and 595 transitions. [2022-04-15 12:24:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-15 12:24:30,753 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 12:24:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:24:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 586 transitions. [2022-04-15 12:24:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 586 transitions. [2022-04-15 12:24:30,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 586 transitions. [2022-04-15 12:24:31,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:24:31,131 INFO L225 Difference]: With dead ends: 467 [2022-04-15 12:24:31,131 INFO L226 Difference]: Without dead ends: 450 [2022-04-15 12:24:31,133 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=15878, Invalid=20032, Unknown=0, NotChecked=0, Total=35910 [2022-04-15 12:24:31,133 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1670 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:24:31,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1670 Valid, 52 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:24:31,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-04-15 12:24:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 148. [2022-04-15 12:24:32,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:24:32,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 450 states. Second operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:32,131 INFO L74 IsIncluded]: Start isIncluded. First operand 450 states. Second operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:32,131 INFO L87 Difference]: Start difference. First operand 450 states. Second operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:32,138 INFO L93 Difference]: Finished difference Result 450 states and 574 transitions. [2022-04-15 12:24:32,138 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 574 transitions. [2022-04-15 12:24:32,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:32,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:32,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 450 states. [2022-04-15 12:24:32,139 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 450 states. [2022-04-15 12:24:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:32,146 INFO L93 Difference]: Finished difference Result 450 states and 574 transitions. [2022-04-15 12:24:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 574 transitions. [2022-04-15 12:24:32,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:32,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:32,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:24:32,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:24:32,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2022-04-15 12:24:32,148 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 145 [2022-04-15 12:24:32,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:24:32,148 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2022-04-15 12:24:32,148 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:32,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 152 transitions. [2022-04-15 12:24:32,550 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:24:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2022-04-15 12:24:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 12:24:32,551 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:24:32,551 INFO L499 BasicCegarLoop]: trace histogram [62, 62, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:24:32,569 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:24:32,751 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:24:32,751 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:24:32,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:24:32,752 INFO L85 PathProgramCache]: Analyzing trace with hash -393254911, now seen corresponding path program 125 times [2022-04-15 12:24:32,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:32,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [619489115] [2022-04-15 12:24:32,755 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:24:32,755 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:24:32,755 INFO L85 PathProgramCache]: Analyzing trace with hash -393254911, now seen corresponding path program 126 times [2022-04-15 12:24:32,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:24:32,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055938051] [2022-04-15 12:24:32,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:24:32,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:24:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:34,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:24:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:34,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {111078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {111010#true} is VALID [2022-04-15 12:24:34,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {111010#true} assume true; {111010#true} is VALID [2022-04-15 12:24:34,023 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111010#true} {111010#true} #64#return; {111010#true} is VALID [2022-04-15 12:24:34,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {111010#true} call ULTIMATE.init(); {111078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:24:34,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {111078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {111010#true} is VALID [2022-04-15 12:24:34,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {111010#true} assume true; {111010#true} is VALID [2022-04-15 12:24:34,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111010#true} {111010#true} #64#return; {111010#true} is VALID [2022-04-15 12:24:34,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {111010#true} call #t~ret6 := main(); {111010#true} is VALID [2022-04-15 12:24:34,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {111010#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {111015#(= main_~i~0 0)} is VALID [2022-04-15 12:24:34,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {111015#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111015#(= main_~i~0 0)} is VALID [2022-04-15 12:24:34,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {111015#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111016#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:34,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {111016#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111016#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:34,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {111016#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111017#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:34,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {111017#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111017#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:34,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {111017#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111018#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:34,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {111018#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111018#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:34,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {111018#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111019#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:34,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {111019#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111019#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:34,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {111019#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111020#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:34,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {111020#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111020#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:34,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {111020#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111021#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:34,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {111021#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111021#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:34,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {111021#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111022#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:34,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {111022#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111022#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:34,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {111022#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111023#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:34,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {111023#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111023#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:34,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {111023#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111024#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:34,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {111024#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111024#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:34,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {111024#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111025#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:34,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {111025#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111025#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:34,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {111025#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111026#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:34,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {111026#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111026#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:34,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {111026#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111027#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:34,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {111027#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111027#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:34,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {111027#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111028#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:34,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {111028#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111028#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:34,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {111028#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111029#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:34,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {111029#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111029#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:34,033 INFO L290 TraceCheckUtils]: 35: Hoare triple {111029#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111030#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:34,033 INFO L290 TraceCheckUtils]: 36: Hoare triple {111030#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111030#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:34,033 INFO L290 TraceCheckUtils]: 37: Hoare triple {111030#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111031#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:34,034 INFO L290 TraceCheckUtils]: 38: Hoare triple {111031#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111031#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:34,034 INFO L290 TraceCheckUtils]: 39: Hoare triple {111031#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111032#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:34,034 INFO L290 TraceCheckUtils]: 40: Hoare triple {111032#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111032#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:34,034 INFO L290 TraceCheckUtils]: 41: Hoare triple {111032#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111033#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:34,035 INFO L290 TraceCheckUtils]: 42: Hoare triple {111033#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111033#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:34,035 INFO L290 TraceCheckUtils]: 43: Hoare triple {111033#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111034#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:34,035 INFO L290 TraceCheckUtils]: 44: Hoare triple {111034#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111034#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:34,035 INFO L290 TraceCheckUtils]: 45: Hoare triple {111034#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111035#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:34,036 INFO L290 TraceCheckUtils]: 46: Hoare triple {111035#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111035#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:34,036 INFO L290 TraceCheckUtils]: 47: Hoare triple {111035#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111036#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:34,036 INFO L290 TraceCheckUtils]: 48: Hoare triple {111036#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111036#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:34,037 INFO L290 TraceCheckUtils]: 49: Hoare triple {111036#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111037#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:34,037 INFO L290 TraceCheckUtils]: 50: Hoare triple {111037#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111037#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:34,037 INFO L290 TraceCheckUtils]: 51: Hoare triple {111037#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111038#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:34,037 INFO L290 TraceCheckUtils]: 52: Hoare triple {111038#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111038#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:34,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {111038#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111039#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:34,038 INFO L290 TraceCheckUtils]: 54: Hoare triple {111039#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111039#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:34,038 INFO L290 TraceCheckUtils]: 55: Hoare triple {111039#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111040#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:34,038 INFO L290 TraceCheckUtils]: 56: Hoare triple {111040#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111040#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:34,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {111040#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111041#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:34,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {111041#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111041#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:34,039 INFO L290 TraceCheckUtils]: 59: Hoare triple {111041#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111042#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:34,040 INFO L290 TraceCheckUtils]: 60: Hoare triple {111042#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111042#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:34,040 INFO L290 TraceCheckUtils]: 61: Hoare triple {111042#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111043#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:34,040 INFO L290 TraceCheckUtils]: 62: Hoare triple {111043#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111043#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:34,040 INFO L290 TraceCheckUtils]: 63: Hoare triple {111043#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111044#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:34,041 INFO L290 TraceCheckUtils]: 64: Hoare triple {111044#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111044#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:34,041 INFO L290 TraceCheckUtils]: 65: Hoare triple {111044#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111045#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:34,041 INFO L290 TraceCheckUtils]: 66: Hoare triple {111045#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111045#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:34,041 INFO L290 TraceCheckUtils]: 67: Hoare triple {111045#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111046#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:34,042 INFO L290 TraceCheckUtils]: 68: Hoare triple {111046#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111046#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:34,042 INFO L290 TraceCheckUtils]: 69: Hoare triple {111046#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111047#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:34,042 INFO L290 TraceCheckUtils]: 70: Hoare triple {111047#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111047#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:34,043 INFO L290 TraceCheckUtils]: 71: Hoare triple {111047#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111048#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:34,043 INFO L290 TraceCheckUtils]: 72: Hoare triple {111048#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111048#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:34,043 INFO L290 TraceCheckUtils]: 73: Hoare triple {111048#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111049#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:34,043 INFO L290 TraceCheckUtils]: 74: Hoare triple {111049#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111049#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:34,044 INFO L290 TraceCheckUtils]: 75: Hoare triple {111049#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111050#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:34,044 INFO L290 TraceCheckUtils]: 76: Hoare triple {111050#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111050#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:34,044 INFO L290 TraceCheckUtils]: 77: Hoare triple {111050#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111051#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:34,044 INFO L290 TraceCheckUtils]: 78: Hoare triple {111051#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111051#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:34,045 INFO L290 TraceCheckUtils]: 79: Hoare triple {111051#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111052#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:34,045 INFO L290 TraceCheckUtils]: 80: Hoare triple {111052#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111052#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:34,045 INFO L290 TraceCheckUtils]: 81: Hoare triple {111052#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111053#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:34,046 INFO L290 TraceCheckUtils]: 82: Hoare triple {111053#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111053#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:34,046 INFO L290 TraceCheckUtils]: 83: Hoare triple {111053#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111054#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:34,046 INFO L290 TraceCheckUtils]: 84: Hoare triple {111054#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111054#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:34,046 INFO L290 TraceCheckUtils]: 85: Hoare triple {111054#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111055#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:34,047 INFO L290 TraceCheckUtils]: 86: Hoare triple {111055#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111055#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:34,047 INFO L290 TraceCheckUtils]: 87: Hoare triple {111055#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111056#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:34,047 INFO L290 TraceCheckUtils]: 88: Hoare triple {111056#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111056#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:34,047 INFO L290 TraceCheckUtils]: 89: Hoare triple {111056#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111057#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:34,048 INFO L290 TraceCheckUtils]: 90: Hoare triple {111057#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111057#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:34,048 INFO L290 TraceCheckUtils]: 91: Hoare triple {111057#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111058#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:34,048 INFO L290 TraceCheckUtils]: 92: Hoare triple {111058#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111058#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:34,049 INFO L290 TraceCheckUtils]: 93: Hoare triple {111058#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111059#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:34,049 INFO L290 TraceCheckUtils]: 94: Hoare triple {111059#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111059#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:34,049 INFO L290 TraceCheckUtils]: 95: Hoare triple {111059#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111060#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:34,049 INFO L290 TraceCheckUtils]: 96: Hoare triple {111060#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111060#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:34,050 INFO L290 TraceCheckUtils]: 97: Hoare triple {111060#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111061#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:34,050 INFO L290 TraceCheckUtils]: 98: Hoare triple {111061#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111061#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:34,050 INFO L290 TraceCheckUtils]: 99: Hoare triple {111061#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111062#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:34,050 INFO L290 TraceCheckUtils]: 100: Hoare triple {111062#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111062#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:34,051 INFO L290 TraceCheckUtils]: 101: Hoare triple {111062#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111063#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:34,051 INFO L290 TraceCheckUtils]: 102: Hoare triple {111063#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111063#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:34,051 INFO L290 TraceCheckUtils]: 103: Hoare triple {111063#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111064#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:34,052 INFO L290 TraceCheckUtils]: 104: Hoare triple {111064#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111064#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:34,052 INFO L290 TraceCheckUtils]: 105: Hoare triple {111064#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111065#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:34,052 INFO L290 TraceCheckUtils]: 106: Hoare triple {111065#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111065#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:34,052 INFO L290 TraceCheckUtils]: 107: Hoare triple {111065#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111066#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:34,053 INFO L290 TraceCheckUtils]: 108: Hoare triple {111066#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111066#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:34,053 INFO L290 TraceCheckUtils]: 109: Hoare triple {111066#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111067#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:34,053 INFO L290 TraceCheckUtils]: 110: Hoare triple {111067#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111067#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:34,053 INFO L290 TraceCheckUtils]: 111: Hoare triple {111067#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111068#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:34,054 INFO L290 TraceCheckUtils]: 112: Hoare triple {111068#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111068#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:34,054 INFO L290 TraceCheckUtils]: 113: Hoare triple {111068#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111069#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:34,054 INFO L290 TraceCheckUtils]: 114: Hoare triple {111069#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111069#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:34,055 INFO L290 TraceCheckUtils]: 115: Hoare triple {111069#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111070#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:34,055 INFO L290 TraceCheckUtils]: 116: Hoare triple {111070#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111070#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:34,055 INFO L290 TraceCheckUtils]: 117: Hoare triple {111070#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111071#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:34,055 INFO L290 TraceCheckUtils]: 118: Hoare triple {111071#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111071#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:34,056 INFO L290 TraceCheckUtils]: 119: Hoare triple {111071#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111072#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:34,056 INFO L290 TraceCheckUtils]: 120: Hoare triple {111072#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111072#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:34,056 INFO L290 TraceCheckUtils]: 121: Hoare triple {111072#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111073#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:34,056 INFO L290 TraceCheckUtils]: 122: Hoare triple {111073#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111073#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:34,057 INFO L290 TraceCheckUtils]: 123: Hoare triple {111073#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111074#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:34,057 INFO L290 TraceCheckUtils]: 124: Hoare triple {111074#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111074#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:34,057 INFO L290 TraceCheckUtils]: 125: Hoare triple {111074#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111075#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:34,057 INFO L290 TraceCheckUtils]: 126: Hoare triple {111075#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111075#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:34,058 INFO L290 TraceCheckUtils]: 127: Hoare triple {111075#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111076#(<= main_~i~0 61)} is VALID [2022-04-15 12:24:34,058 INFO L290 TraceCheckUtils]: 128: Hoare triple {111076#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111076#(<= main_~i~0 61)} is VALID [2022-04-15 12:24:34,058 INFO L290 TraceCheckUtils]: 129: Hoare triple {111076#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111077#(<= main_~i~0 62)} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 130: Hoare triple {111077#(<= main_~i~0 62)} assume !(~i~0 < 1024); {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 131: Hoare triple {111011#false} ~i~0 := 0; {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 132: Hoare triple {111011#false} #t~short5 := ~i~0 < 1024; {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 133: Hoare triple {111011#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 134: Hoare triple {111011#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 135: Hoare triple {111011#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 136: Hoare triple {111011#false} #t~short5 := ~i~0 < 1024; {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 137: Hoare triple {111011#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 138: Hoare triple {111011#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 139: Hoare triple {111011#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 140: Hoare triple {111011#false} #t~short5 := ~i~0 < 1024; {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 141: Hoare triple {111011#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 142: Hoare triple {111011#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L272 TraceCheckUtils]: 143: Hoare triple {111011#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 144: Hoare triple {111011#false} ~cond := #in~cond; {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 145: Hoare triple {111011#false} assume 0 == ~cond; {111011#false} is VALID [2022-04-15 12:24:34,059 INFO L290 TraceCheckUtils]: 146: Hoare triple {111011#false} assume !false; {111011#false} is VALID [2022-04-15 12:24:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3854 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:24:34,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:24:34,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055938051] [2022-04-15 12:24:34,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055938051] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:24:34,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062401857] [2022-04-15 12:24:34,060 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:24:34,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:24:34,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:24:34,061 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:24:34,062 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:24:34,421 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:24:34,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:24:34,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:24:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:34,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:24:34,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {111010#true} call ULTIMATE.init(); {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {111010#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {111010#true} assume true; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111010#true} {111010#true} #64#return; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {111010#true} call #t~ret6 := main(); {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {111010#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 51: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 52: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 53: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 54: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 55: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,719 INFO L290 TraceCheckUtils]: 59: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 60: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 61: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 65: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 66: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 67: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 68: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 69: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 70: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 71: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 72: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 73: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 74: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 75: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 76: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 77: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 78: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,720 INFO L290 TraceCheckUtils]: 79: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 80: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 81: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 82: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 83: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 84: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 85: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 86: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 87: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 88: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 89: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 90: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 91: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 92: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 93: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 94: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 95: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 96: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 97: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 98: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,721 INFO L290 TraceCheckUtils]: 99: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 100: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 101: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 102: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 103: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 104: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 105: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 106: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 107: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 108: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 109: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 110: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 111: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 112: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 113: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 114: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 115: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 116: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 117: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 118: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,722 INFO L290 TraceCheckUtils]: 119: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,723 INFO L290 TraceCheckUtils]: 120: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,723 INFO L290 TraceCheckUtils]: 121: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,723 INFO L290 TraceCheckUtils]: 122: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,723 INFO L290 TraceCheckUtils]: 123: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,723 INFO L290 TraceCheckUtils]: 124: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,723 INFO L290 TraceCheckUtils]: 125: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,723 INFO L290 TraceCheckUtils]: 126: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,723 INFO L290 TraceCheckUtils]: 127: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,723 INFO L290 TraceCheckUtils]: 128: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:34,723 INFO L290 TraceCheckUtils]: 129: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:34,723 INFO L290 TraceCheckUtils]: 130: Hoare triple {111010#true} assume !(~i~0 < 1024); {111010#true} is VALID [2022-04-15 12:24:34,723 INFO L290 TraceCheckUtils]: 131: Hoare triple {111010#true} ~i~0 := 0; {111475#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:34,724 INFO L290 TraceCheckUtils]: 132: Hoare triple {111475#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {111475#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:34,724 INFO L290 TraceCheckUtils]: 133: Hoare triple {111475#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111475#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:34,724 INFO L290 TraceCheckUtils]: 134: Hoare triple {111475#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111475#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:34,724 INFO L290 TraceCheckUtils]: 135: Hoare triple {111475#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111016#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:34,725 INFO L290 TraceCheckUtils]: 136: Hoare triple {111016#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {111016#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:34,725 INFO L290 TraceCheckUtils]: 137: Hoare triple {111016#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111016#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:34,725 INFO L290 TraceCheckUtils]: 138: Hoare triple {111016#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111016#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:34,725 INFO L290 TraceCheckUtils]: 139: Hoare triple {111016#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111017#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:34,726 INFO L290 TraceCheckUtils]: 140: Hoare triple {111017#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {111017#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:34,726 INFO L290 TraceCheckUtils]: 141: Hoare triple {111017#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111017#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:34,726 INFO L290 TraceCheckUtils]: 142: Hoare triple {111017#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {111017#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:34,727 INFO L272 TraceCheckUtils]: 143: Hoare triple {111017#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {111512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:24:34,727 INFO L290 TraceCheckUtils]: 144: Hoare triple {111512#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {111516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:24:34,727 INFO L290 TraceCheckUtils]: 145: Hoare triple {111516#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {111011#false} is VALID [2022-04-15 12:24:34,727 INFO L290 TraceCheckUtils]: 146: Hoare triple {111011#false} assume !false; {111011#false} is VALID [2022-04-15 12:24:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3854 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3844 trivial. 0 not checked. [2022-04-15 12:24:34,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:24:35,053 INFO L290 TraceCheckUtils]: 146: Hoare triple {111011#false} assume !false; {111011#false} is VALID [2022-04-15 12:24:35,053 INFO L290 TraceCheckUtils]: 145: Hoare triple {111516#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {111011#false} is VALID [2022-04-15 12:24:35,054 INFO L290 TraceCheckUtils]: 144: Hoare triple {111512#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {111516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:24:35,054 INFO L272 TraceCheckUtils]: 143: Hoare triple {111532#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {111512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:24:35,054 INFO L290 TraceCheckUtils]: 142: Hoare triple {111532#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {111532#(<= main_~i~0 512)} is VALID [2022-04-15 12:24:35,054 INFO L290 TraceCheckUtils]: 141: Hoare triple {111532#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111532#(<= main_~i~0 512)} is VALID [2022-04-15 12:24:35,055 INFO L290 TraceCheckUtils]: 140: Hoare triple {111532#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {111532#(<= main_~i~0 512)} is VALID [2022-04-15 12:24:35,055 INFO L290 TraceCheckUtils]: 139: Hoare triple {111545#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111532#(<= main_~i~0 512)} is VALID [2022-04-15 12:24:35,055 INFO L290 TraceCheckUtils]: 138: Hoare triple {111545#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111545#(<= main_~i~0 511)} is VALID [2022-04-15 12:24:35,056 INFO L290 TraceCheckUtils]: 137: Hoare triple {111545#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111545#(<= main_~i~0 511)} is VALID [2022-04-15 12:24:35,056 INFO L290 TraceCheckUtils]: 136: Hoare triple {111545#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {111545#(<= main_~i~0 511)} is VALID [2022-04-15 12:24:35,056 INFO L290 TraceCheckUtils]: 135: Hoare triple {111558#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111545#(<= main_~i~0 511)} is VALID [2022-04-15 12:24:35,056 INFO L290 TraceCheckUtils]: 134: Hoare triple {111558#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111558#(<= main_~i~0 510)} is VALID [2022-04-15 12:24:35,057 INFO L290 TraceCheckUtils]: 133: Hoare triple {111558#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111558#(<= main_~i~0 510)} is VALID [2022-04-15 12:24:35,057 INFO L290 TraceCheckUtils]: 132: Hoare triple {111558#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {111558#(<= main_~i~0 510)} is VALID [2022-04-15 12:24:35,057 INFO L290 TraceCheckUtils]: 131: Hoare triple {111010#true} ~i~0 := 0; {111558#(<= main_~i~0 510)} is VALID [2022-04-15 12:24:35,057 INFO L290 TraceCheckUtils]: 130: Hoare triple {111010#true} assume !(~i~0 < 1024); {111010#true} is VALID [2022-04-15 12:24:35,057 INFO L290 TraceCheckUtils]: 129: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,057 INFO L290 TraceCheckUtils]: 128: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,057 INFO L290 TraceCheckUtils]: 127: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,057 INFO L290 TraceCheckUtils]: 126: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,057 INFO L290 TraceCheckUtils]: 125: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,057 INFO L290 TraceCheckUtils]: 124: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,057 INFO L290 TraceCheckUtils]: 123: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 122: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 121: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 120: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 119: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 118: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 117: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 116: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 115: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 114: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 113: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 112: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 111: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 110: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 109: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 108: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 107: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 106: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 105: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,058 INFO L290 TraceCheckUtils]: 104: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 103: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 102: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 101: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 100: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 99: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 98: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 97: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 96: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 95: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 94: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 93: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 92: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 91: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 90: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 89: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 88: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 87: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 86: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 85: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,059 INFO L290 TraceCheckUtils]: 84: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 83: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 82: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 81: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 80: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 79: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 78: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 77: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 76: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 75: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 74: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 73: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 72: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 71: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 70: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 69: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 68: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 67: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 66: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,060 INFO L290 TraceCheckUtils]: 64: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 63: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 59: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 57: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 56: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 55: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 54: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 53: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 51: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 50: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 48: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 47: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 45: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 43: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 42: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {111010#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {111010#true} is VALID [2022-04-15 12:24:35,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {111010#true} call #t~ret6 := main(); {111010#true} is VALID [2022-04-15 12:24:35,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111010#true} {111010#true} #64#return; {111010#true} is VALID [2022-04-15 12:24:35,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {111010#true} assume true; {111010#true} is VALID [2022-04-15 12:24:35,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {111010#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {111010#true} is VALID [2022-04-15 12:24:35,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {111010#true} call ULTIMATE.init(); {111010#true} is VALID [2022-04-15 12:24:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3854 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3844 trivial. 0 not checked. [2022-04-15 12:24:35,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062401857] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:24:35,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:24:35,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 7, 7] total 72 [2022-04-15 12:24:35,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:24:35,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [619489115] [2022-04-15 12:24:35,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [619489115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:24:35,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:24:35,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-15 12:24:35,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732919811] [2022-04-15 12:24:35,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:24:35,065 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-15 12:24:35,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:24:35,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:35,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:24:35,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-15 12:24:35,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:35,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-15 12:24:35,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2352, Invalid=2760, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 12:24:35,146 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:50,959 INFO L93 Difference]: Finished difference Result 474 states and 604 transitions. [2022-04-15 12:24:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-15 12:24:50,959 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-15 12:24:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:24:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 595 transitions. [2022-04-15 12:24:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 595 transitions. [2022-04-15 12:24:50,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 595 transitions. [2022-04-15 12:24:51,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:24:51,352 INFO L225 Difference]: With dead ends: 474 [2022-04-15 12:24:51,352 INFO L226 Difference]: Without dead ends: 457 [2022-04-15 12:24:51,353 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2396 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=6700, Invalid=11390, Unknown=0, NotChecked=0, Total=18090 [2022-04-15 12:24:51,353 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1402 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:24:51,354 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1402 Valid, 42 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:24:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-04-15 12:24:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 150. [2022-04-15 12:24:52,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:24:52,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 457 states. Second operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:52,334 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:52,334 INFO L87 Difference]: Start difference. First operand 457 states. Second operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:52,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:52,342 INFO L93 Difference]: Finished difference Result 457 states and 583 transitions. [2022-04-15 12:24:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 583 transitions. [2022-04-15 12:24:52,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:52,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:52,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 457 states. [2022-04-15 12:24:52,342 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 457 states. [2022-04-15 12:24:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:52,349 INFO L93 Difference]: Finished difference Result 457 states and 583 transitions. [2022-04-15 12:24:52,349 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 583 transitions. [2022-04-15 12:24:52,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:52,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:52,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:24:52,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:24:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2022-04-15 12:24:52,351 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 147 [2022-04-15 12:24:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:24:52,352 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2022-04-15 12:24:52,352 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:52,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 154 transitions. [2022-04-15 12:24:52,763 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:24:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2022-04-15 12:24:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-15 12:24:52,764 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:24:52,764 INFO L499 BasicCegarLoop]: trace histogram [63, 63, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:24:52,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-04-15 12:24:52,971 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:24:52,971 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:24:52,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:24:52,971 INFO L85 PathProgramCache]: Analyzing trace with hash -575798497, now seen corresponding path program 127 times [2022-04-15 12:24:52,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:52,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [588510055] [2022-04-15 12:24:52,975 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:24:52,975 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:24:52,975 INFO L85 PathProgramCache]: Analyzing trace with hash -575798497, now seen corresponding path program 128 times [2022-04-15 12:24:52,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:24:52,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669653559] [2022-04-15 12:24:52,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:24:52,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:24:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:54,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:24:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:54,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {114323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {114254#true} is VALID [2022-04-15 12:24:54,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {114254#true} assume true; {114254#true} is VALID [2022-04-15 12:24:54,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {114254#true} {114254#true} #64#return; {114254#true} is VALID [2022-04-15 12:24:54,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {114254#true} call ULTIMATE.init(); {114323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:24:54,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {114323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {114254#true} is VALID [2022-04-15 12:24:54,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {114254#true} assume true; {114254#true} is VALID [2022-04-15 12:24:54,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114254#true} {114254#true} #64#return; {114254#true} is VALID [2022-04-15 12:24:54,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {114254#true} call #t~ret6 := main(); {114254#true} is VALID [2022-04-15 12:24:54,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {114254#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {114259#(= main_~i~0 0)} is VALID [2022-04-15 12:24:54,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {114259#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114259#(= main_~i~0 0)} is VALID [2022-04-15 12:24:54,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {114259#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114260#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:54,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {114260#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114260#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:54,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {114260#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114261#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:54,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {114261#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114261#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:54,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {114261#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114262#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:54,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {114262#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114262#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:54,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {114262#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114263#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:54,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {114263#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114263#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:54,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {114263#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114264#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:54,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {114264#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114264#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:54,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {114264#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114265#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:54,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {114265#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114265#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:54,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {114265#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114266#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:54,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {114266#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114266#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:54,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {114266#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114267#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:54,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {114267#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114267#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:54,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {114267#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114268#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:54,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {114268#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114268#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:54,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {114268#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114269#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:54,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {114269#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114269#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:54,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {114269#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114270#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:54,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {114270#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114270#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:54,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {114270#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114271#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:54,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {114271#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114271#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:54,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {114271#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114272#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:54,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {114272#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114272#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:54,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {114272#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114273#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:54,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {114273#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114273#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:54,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {114273#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114274#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:54,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {114274#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114274#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:54,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {114274#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114275#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:54,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {114275#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114275#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:54,318 INFO L290 TraceCheckUtils]: 39: Hoare triple {114275#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114276#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:54,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {114276#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114276#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:54,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {114276#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114277#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:54,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {114277#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114277#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:54,319 INFO L290 TraceCheckUtils]: 43: Hoare triple {114277#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114278#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:54,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {114278#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114278#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:54,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {114278#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114279#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:54,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {114279#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114279#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:54,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {114279#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114280#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:54,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {114280#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114280#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:54,321 INFO L290 TraceCheckUtils]: 49: Hoare triple {114280#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114281#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:54,321 INFO L290 TraceCheckUtils]: 50: Hoare triple {114281#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114281#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:54,322 INFO L290 TraceCheckUtils]: 51: Hoare triple {114281#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114282#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:54,322 INFO L290 TraceCheckUtils]: 52: Hoare triple {114282#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114282#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:54,322 INFO L290 TraceCheckUtils]: 53: Hoare triple {114282#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114283#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:54,323 INFO L290 TraceCheckUtils]: 54: Hoare triple {114283#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114283#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:54,323 INFO L290 TraceCheckUtils]: 55: Hoare triple {114283#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114284#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:54,323 INFO L290 TraceCheckUtils]: 56: Hoare triple {114284#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114284#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:54,324 INFO L290 TraceCheckUtils]: 57: Hoare triple {114284#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114285#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:54,324 INFO L290 TraceCheckUtils]: 58: Hoare triple {114285#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114285#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:54,324 INFO L290 TraceCheckUtils]: 59: Hoare triple {114285#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114286#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:54,325 INFO L290 TraceCheckUtils]: 60: Hoare triple {114286#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114286#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:54,325 INFO L290 TraceCheckUtils]: 61: Hoare triple {114286#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114287#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:54,325 INFO L290 TraceCheckUtils]: 62: Hoare triple {114287#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114287#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:54,326 INFO L290 TraceCheckUtils]: 63: Hoare triple {114287#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114288#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:54,326 INFO L290 TraceCheckUtils]: 64: Hoare triple {114288#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114288#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:54,326 INFO L290 TraceCheckUtils]: 65: Hoare triple {114288#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114289#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:54,327 INFO L290 TraceCheckUtils]: 66: Hoare triple {114289#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114289#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:54,327 INFO L290 TraceCheckUtils]: 67: Hoare triple {114289#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114290#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:54,327 INFO L290 TraceCheckUtils]: 68: Hoare triple {114290#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114290#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:54,328 INFO L290 TraceCheckUtils]: 69: Hoare triple {114290#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114291#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:54,328 INFO L290 TraceCheckUtils]: 70: Hoare triple {114291#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114291#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:54,328 INFO L290 TraceCheckUtils]: 71: Hoare triple {114291#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114292#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:54,329 INFO L290 TraceCheckUtils]: 72: Hoare triple {114292#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114292#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:54,329 INFO L290 TraceCheckUtils]: 73: Hoare triple {114292#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114293#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:54,329 INFO L290 TraceCheckUtils]: 74: Hoare triple {114293#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114293#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:54,330 INFO L290 TraceCheckUtils]: 75: Hoare triple {114293#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114294#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:54,330 INFO L290 TraceCheckUtils]: 76: Hoare triple {114294#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114294#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:54,330 INFO L290 TraceCheckUtils]: 77: Hoare triple {114294#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114295#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:54,330 INFO L290 TraceCheckUtils]: 78: Hoare triple {114295#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114295#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:54,331 INFO L290 TraceCheckUtils]: 79: Hoare triple {114295#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114296#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:54,331 INFO L290 TraceCheckUtils]: 80: Hoare triple {114296#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114296#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:54,331 INFO L290 TraceCheckUtils]: 81: Hoare triple {114296#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114297#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:54,332 INFO L290 TraceCheckUtils]: 82: Hoare triple {114297#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114297#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:54,332 INFO L290 TraceCheckUtils]: 83: Hoare triple {114297#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114298#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:54,332 INFO L290 TraceCheckUtils]: 84: Hoare triple {114298#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114298#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:54,333 INFO L290 TraceCheckUtils]: 85: Hoare triple {114298#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114299#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:54,333 INFO L290 TraceCheckUtils]: 86: Hoare triple {114299#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114299#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:54,333 INFO L290 TraceCheckUtils]: 87: Hoare triple {114299#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114300#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:54,334 INFO L290 TraceCheckUtils]: 88: Hoare triple {114300#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114300#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:54,334 INFO L290 TraceCheckUtils]: 89: Hoare triple {114300#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114301#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:54,334 INFO L290 TraceCheckUtils]: 90: Hoare triple {114301#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114301#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:54,335 INFO L290 TraceCheckUtils]: 91: Hoare triple {114301#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114302#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:54,335 INFO L290 TraceCheckUtils]: 92: Hoare triple {114302#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114302#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:54,335 INFO L290 TraceCheckUtils]: 93: Hoare triple {114302#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114303#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:54,336 INFO L290 TraceCheckUtils]: 94: Hoare triple {114303#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114303#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:54,336 INFO L290 TraceCheckUtils]: 95: Hoare triple {114303#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114304#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:54,336 INFO L290 TraceCheckUtils]: 96: Hoare triple {114304#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114304#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:54,337 INFO L290 TraceCheckUtils]: 97: Hoare triple {114304#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114305#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:54,337 INFO L290 TraceCheckUtils]: 98: Hoare triple {114305#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114305#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:54,337 INFO L290 TraceCheckUtils]: 99: Hoare triple {114305#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114306#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:54,337 INFO L290 TraceCheckUtils]: 100: Hoare triple {114306#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114306#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:54,338 INFO L290 TraceCheckUtils]: 101: Hoare triple {114306#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114307#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:54,338 INFO L290 TraceCheckUtils]: 102: Hoare triple {114307#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114307#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:54,338 INFO L290 TraceCheckUtils]: 103: Hoare triple {114307#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114308#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:54,339 INFO L290 TraceCheckUtils]: 104: Hoare triple {114308#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114308#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:54,339 INFO L290 TraceCheckUtils]: 105: Hoare triple {114308#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114309#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:54,339 INFO L290 TraceCheckUtils]: 106: Hoare triple {114309#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114309#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:54,340 INFO L290 TraceCheckUtils]: 107: Hoare triple {114309#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114310#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:54,340 INFO L290 TraceCheckUtils]: 108: Hoare triple {114310#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114310#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:54,340 INFO L290 TraceCheckUtils]: 109: Hoare triple {114310#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114311#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:54,341 INFO L290 TraceCheckUtils]: 110: Hoare triple {114311#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114311#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:54,341 INFO L290 TraceCheckUtils]: 111: Hoare triple {114311#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114312#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:54,341 INFO L290 TraceCheckUtils]: 112: Hoare triple {114312#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114312#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:54,342 INFO L290 TraceCheckUtils]: 113: Hoare triple {114312#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114313#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:54,342 INFO L290 TraceCheckUtils]: 114: Hoare triple {114313#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114313#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:54,342 INFO L290 TraceCheckUtils]: 115: Hoare triple {114313#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114314#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:54,343 INFO L290 TraceCheckUtils]: 116: Hoare triple {114314#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114314#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:54,343 INFO L290 TraceCheckUtils]: 117: Hoare triple {114314#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114315#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:54,343 INFO L290 TraceCheckUtils]: 118: Hoare triple {114315#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114315#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:54,344 INFO L290 TraceCheckUtils]: 119: Hoare triple {114315#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114316#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:54,344 INFO L290 TraceCheckUtils]: 120: Hoare triple {114316#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114316#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:54,344 INFO L290 TraceCheckUtils]: 121: Hoare triple {114316#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114317#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:54,344 INFO L290 TraceCheckUtils]: 122: Hoare triple {114317#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114317#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:54,345 INFO L290 TraceCheckUtils]: 123: Hoare triple {114317#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114318#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:54,345 INFO L290 TraceCheckUtils]: 124: Hoare triple {114318#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114318#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:54,345 INFO L290 TraceCheckUtils]: 125: Hoare triple {114318#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114319#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:54,346 INFO L290 TraceCheckUtils]: 126: Hoare triple {114319#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114319#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:54,346 INFO L290 TraceCheckUtils]: 127: Hoare triple {114319#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114320#(<= main_~i~0 61)} is VALID [2022-04-15 12:24:54,346 INFO L290 TraceCheckUtils]: 128: Hoare triple {114320#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114320#(<= main_~i~0 61)} is VALID [2022-04-15 12:24:54,347 INFO L290 TraceCheckUtils]: 129: Hoare triple {114320#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114321#(<= main_~i~0 62)} is VALID [2022-04-15 12:24:54,347 INFO L290 TraceCheckUtils]: 130: Hoare triple {114321#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114321#(<= main_~i~0 62)} is VALID [2022-04-15 12:24:54,347 INFO L290 TraceCheckUtils]: 131: Hoare triple {114321#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114322#(<= main_~i~0 63)} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 132: Hoare triple {114322#(<= main_~i~0 63)} assume !(~i~0 < 1024); {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 133: Hoare triple {114255#false} ~i~0 := 0; {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 134: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 135: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 136: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 137: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 138: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 139: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 140: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 141: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 142: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 143: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 144: Hoare triple {114255#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L272 TraceCheckUtils]: 145: Hoare triple {114255#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 146: Hoare triple {114255#false} ~cond := #in~cond; {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 147: Hoare triple {114255#false} assume 0 == ~cond; {114255#false} is VALID [2022-04-15 12:24:54,348 INFO L290 TraceCheckUtils]: 148: Hoare triple {114255#false} assume !false; {114255#false} is VALID [2022-04-15 12:24:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3979 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:24:54,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:24:54,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669653559] [2022-04-15 12:24:54,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669653559] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:24:54,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916217163] [2022-04-15 12:24:54,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:24:54,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:24:54,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:24:54,350 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:24:54,351 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:24:54,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:24:54,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:24:54,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-15 12:24:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:54,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:24:55,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {114254#true} call ULTIMATE.init(); {114254#true} is VALID [2022-04-15 12:24:55,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {114254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {114254#true} is VALID [2022-04-15 12:24:55,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {114254#true} assume true; {114254#true} is VALID [2022-04-15 12:24:55,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114254#true} {114254#true} #64#return; {114254#true} is VALID [2022-04-15 12:24:55,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {114254#true} call #t~ret6 := main(); {114254#true} is VALID [2022-04-15 12:24:55,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {114254#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {114342#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:55,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {114342#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114342#(<= main_~i~0 0)} is VALID [2022-04-15 12:24:55,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {114342#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114260#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:55,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {114260#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114260#(<= main_~i~0 1)} is VALID [2022-04-15 12:24:55,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {114260#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114261#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:55,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {114261#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114261#(<= main_~i~0 2)} is VALID [2022-04-15 12:24:55,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {114261#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114262#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:55,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {114262#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114262#(<= main_~i~0 3)} is VALID [2022-04-15 12:24:55,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {114262#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114263#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:55,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {114263#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114263#(<= main_~i~0 4)} is VALID [2022-04-15 12:24:55,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {114263#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114264#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:55,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {114264#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114264#(<= main_~i~0 5)} is VALID [2022-04-15 12:24:55,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {114264#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114265#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:55,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {114265#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114265#(<= main_~i~0 6)} is VALID [2022-04-15 12:24:55,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {114265#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114266#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:55,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {114266#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114266#(<= main_~i~0 7)} is VALID [2022-04-15 12:24:55,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {114266#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114267#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:55,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {114267#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114267#(<= main_~i~0 8)} is VALID [2022-04-15 12:24:55,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {114267#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114268#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:55,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {114268#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114268#(<= main_~i~0 9)} is VALID [2022-04-15 12:24:55,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {114268#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114269#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:55,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {114269#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114269#(<= main_~i~0 10)} is VALID [2022-04-15 12:24:55,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {114269#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114270#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:55,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {114270#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114270#(<= main_~i~0 11)} is VALID [2022-04-15 12:24:55,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {114270#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114271#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:55,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {114271#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114271#(<= main_~i~0 12)} is VALID [2022-04-15 12:24:55,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {114271#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114272#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:55,643 INFO L290 TraceCheckUtils]: 32: Hoare triple {114272#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114272#(<= main_~i~0 13)} is VALID [2022-04-15 12:24:55,643 INFO L290 TraceCheckUtils]: 33: Hoare triple {114272#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114273#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:55,643 INFO L290 TraceCheckUtils]: 34: Hoare triple {114273#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114273#(<= main_~i~0 14)} is VALID [2022-04-15 12:24:55,643 INFO L290 TraceCheckUtils]: 35: Hoare triple {114273#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114274#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:55,644 INFO L290 TraceCheckUtils]: 36: Hoare triple {114274#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114274#(<= main_~i~0 15)} is VALID [2022-04-15 12:24:55,644 INFO L290 TraceCheckUtils]: 37: Hoare triple {114274#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114275#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:55,644 INFO L290 TraceCheckUtils]: 38: Hoare triple {114275#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114275#(<= main_~i~0 16)} is VALID [2022-04-15 12:24:55,645 INFO L290 TraceCheckUtils]: 39: Hoare triple {114275#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114276#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:55,645 INFO L290 TraceCheckUtils]: 40: Hoare triple {114276#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114276#(<= main_~i~0 17)} is VALID [2022-04-15 12:24:55,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {114276#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114277#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:55,645 INFO L290 TraceCheckUtils]: 42: Hoare triple {114277#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114277#(<= main_~i~0 18)} is VALID [2022-04-15 12:24:55,646 INFO L290 TraceCheckUtils]: 43: Hoare triple {114277#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114278#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:55,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {114278#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114278#(<= main_~i~0 19)} is VALID [2022-04-15 12:24:55,646 INFO L290 TraceCheckUtils]: 45: Hoare triple {114278#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114279#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:55,646 INFO L290 TraceCheckUtils]: 46: Hoare triple {114279#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114279#(<= main_~i~0 20)} is VALID [2022-04-15 12:24:55,647 INFO L290 TraceCheckUtils]: 47: Hoare triple {114279#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114280#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:55,647 INFO L290 TraceCheckUtils]: 48: Hoare triple {114280#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114280#(<= main_~i~0 21)} is VALID [2022-04-15 12:24:55,647 INFO L290 TraceCheckUtils]: 49: Hoare triple {114280#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114281#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:55,648 INFO L290 TraceCheckUtils]: 50: Hoare triple {114281#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114281#(<= main_~i~0 22)} is VALID [2022-04-15 12:24:55,648 INFO L290 TraceCheckUtils]: 51: Hoare triple {114281#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114282#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:55,648 INFO L290 TraceCheckUtils]: 52: Hoare triple {114282#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114282#(<= main_~i~0 23)} is VALID [2022-04-15 12:24:55,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {114282#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114283#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:55,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {114283#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114283#(<= main_~i~0 24)} is VALID [2022-04-15 12:24:55,649 INFO L290 TraceCheckUtils]: 55: Hoare triple {114283#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114284#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:55,649 INFO L290 TraceCheckUtils]: 56: Hoare triple {114284#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114284#(<= main_~i~0 25)} is VALID [2022-04-15 12:24:55,650 INFO L290 TraceCheckUtils]: 57: Hoare triple {114284#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114285#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:55,650 INFO L290 TraceCheckUtils]: 58: Hoare triple {114285#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114285#(<= main_~i~0 26)} is VALID [2022-04-15 12:24:55,650 INFO L290 TraceCheckUtils]: 59: Hoare triple {114285#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114286#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:55,650 INFO L290 TraceCheckUtils]: 60: Hoare triple {114286#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114286#(<= main_~i~0 27)} is VALID [2022-04-15 12:24:55,651 INFO L290 TraceCheckUtils]: 61: Hoare triple {114286#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114287#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:55,651 INFO L290 TraceCheckUtils]: 62: Hoare triple {114287#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114287#(<= main_~i~0 28)} is VALID [2022-04-15 12:24:55,651 INFO L290 TraceCheckUtils]: 63: Hoare triple {114287#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114288#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:55,651 INFO L290 TraceCheckUtils]: 64: Hoare triple {114288#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114288#(<= main_~i~0 29)} is VALID [2022-04-15 12:24:55,652 INFO L290 TraceCheckUtils]: 65: Hoare triple {114288#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114289#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:55,652 INFO L290 TraceCheckUtils]: 66: Hoare triple {114289#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114289#(<= main_~i~0 30)} is VALID [2022-04-15 12:24:55,652 INFO L290 TraceCheckUtils]: 67: Hoare triple {114289#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114290#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:55,653 INFO L290 TraceCheckUtils]: 68: Hoare triple {114290#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114290#(<= main_~i~0 31)} is VALID [2022-04-15 12:24:55,653 INFO L290 TraceCheckUtils]: 69: Hoare triple {114290#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114291#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:55,653 INFO L290 TraceCheckUtils]: 70: Hoare triple {114291#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114291#(<= main_~i~0 32)} is VALID [2022-04-15 12:24:55,653 INFO L290 TraceCheckUtils]: 71: Hoare triple {114291#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114292#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:55,654 INFO L290 TraceCheckUtils]: 72: Hoare triple {114292#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114292#(<= main_~i~0 33)} is VALID [2022-04-15 12:24:55,654 INFO L290 TraceCheckUtils]: 73: Hoare triple {114292#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114293#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:55,654 INFO L290 TraceCheckUtils]: 74: Hoare triple {114293#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114293#(<= main_~i~0 34)} is VALID [2022-04-15 12:24:55,655 INFO L290 TraceCheckUtils]: 75: Hoare triple {114293#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114294#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:55,655 INFO L290 TraceCheckUtils]: 76: Hoare triple {114294#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114294#(<= main_~i~0 35)} is VALID [2022-04-15 12:24:55,655 INFO L290 TraceCheckUtils]: 77: Hoare triple {114294#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114295#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:55,655 INFO L290 TraceCheckUtils]: 78: Hoare triple {114295#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114295#(<= main_~i~0 36)} is VALID [2022-04-15 12:24:55,656 INFO L290 TraceCheckUtils]: 79: Hoare triple {114295#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114296#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:55,656 INFO L290 TraceCheckUtils]: 80: Hoare triple {114296#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114296#(<= main_~i~0 37)} is VALID [2022-04-15 12:24:55,656 INFO L290 TraceCheckUtils]: 81: Hoare triple {114296#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114297#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:55,656 INFO L290 TraceCheckUtils]: 82: Hoare triple {114297#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114297#(<= main_~i~0 38)} is VALID [2022-04-15 12:24:55,657 INFO L290 TraceCheckUtils]: 83: Hoare triple {114297#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114298#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:55,657 INFO L290 TraceCheckUtils]: 84: Hoare triple {114298#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114298#(<= main_~i~0 39)} is VALID [2022-04-15 12:24:55,657 INFO L290 TraceCheckUtils]: 85: Hoare triple {114298#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114299#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:55,658 INFO L290 TraceCheckUtils]: 86: Hoare triple {114299#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114299#(<= main_~i~0 40)} is VALID [2022-04-15 12:24:55,658 INFO L290 TraceCheckUtils]: 87: Hoare triple {114299#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114300#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:55,658 INFO L290 TraceCheckUtils]: 88: Hoare triple {114300#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114300#(<= main_~i~0 41)} is VALID [2022-04-15 12:24:55,658 INFO L290 TraceCheckUtils]: 89: Hoare triple {114300#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114301#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:55,659 INFO L290 TraceCheckUtils]: 90: Hoare triple {114301#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114301#(<= main_~i~0 42)} is VALID [2022-04-15 12:24:55,659 INFO L290 TraceCheckUtils]: 91: Hoare triple {114301#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114302#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:55,659 INFO L290 TraceCheckUtils]: 92: Hoare triple {114302#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114302#(<= main_~i~0 43)} is VALID [2022-04-15 12:24:55,660 INFO L290 TraceCheckUtils]: 93: Hoare triple {114302#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114303#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:55,660 INFO L290 TraceCheckUtils]: 94: Hoare triple {114303#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114303#(<= main_~i~0 44)} is VALID [2022-04-15 12:24:55,660 INFO L290 TraceCheckUtils]: 95: Hoare triple {114303#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114304#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:55,660 INFO L290 TraceCheckUtils]: 96: Hoare triple {114304#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114304#(<= main_~i~0 45)} is VALID [2022-04-15 12:24:55,661 INFO L290 TraceCheckUtils]: 97: Hoare triple {114304#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114305#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:55,661 INFO L290 TraceCheckUtils]: 98: Hoare triple {114305#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114305#(<= main_~i~0 46)} is VALID [2022-04-15 12:24:55,661 INFO L290 TraceCheckUtils]: 99: Hoare triple {114305#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114306#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:55,661 INFO L290 TraceCheckUtils]: 100: Hoare triple {114306#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114306#(<= main_~i~0 47)} is VALID [2022-04-15 12:24:55,662 INFO L290 TraceCheckUtils]: 101: Hoare triple {114306#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114307#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:55,662 INFO L290 TraceCheckUtils]: 102: Hoare triple {114307#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114307#(<= main_~i~0 48)} is VALID [2022-04-15 12:24:55,662 INFO L290 TraceCheckUtils]: 103: Hoare triple {114307#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114308#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:55,663 INFO L290 TraceCheckUtils]: 104: Hoare triple {114308#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114308#(<= main_~i~0 49)} is VALID [2022-04-15 12:24:55,663 INFO L290 TraceCheckUtils]: 105: Hoare triple {114308#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114309#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:55,663 INFO L290 TraceCheckUtils]: 106: Hoare triple {114309#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114309#(<= main_~i~0 50)} is VALID [2022-04-15 12:24:55,663 INFO L290 TraceCheckUtils]: 107: Hoare triple {114309#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114310#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:55,664 INFO L290 TraceCheckUtils]: 108: Hoare triple {114310#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114310#(<= main_~i~0 51)} is VALID [2022-04-15 12:24:55,664 INFO L290 TraceCheckUtils]: 109: Hoare triple {114310#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114311#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:55,664 INFO L290 TraceCheckUtils]: 110: Hoare triple {114311#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114311#(<= main_~i~0 52)} is VALID [2022-04-15 12:24:55,664 INFO L290 TraceCheckUtils]: 111: Hoare triple {114311#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114312#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:55,665 INFO L290 TraceCheckUtils]: 112: Hoare triple {114312#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114312#(<= main_~i~0 53)} is VALID [2022-04-15 12:24:55,665 INFO L290 TraceCheckUtils]: 113: Hoare triple {114312#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114313#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:55,665 INFO L290 TraceCheckUtils]: 114: Hoare triple {114313#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114313#(<= main_~i~0 54)} is VALID [2022-04-15 12:24:55,666 INFO L290 TraceCheckUtils]: 115: Hoare triple {114313#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114314#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:55,666 INFO L290 TraceCheckUtils]: 116: Hoare triple {114314#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114314#(<= main_~i~0 55)} is VALID [2022-04-15 12:24:55,666 INFO L290 TraceCheckUtils]: 117: Hoare triple {114314#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114315#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:55,666 INFO L290 TraceCheckUtils]: 118: Hoare triple {114315#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114315#(<= main_~i~0 56)} is VALID [2022-04-15 12:24:55,667 INFO L290 TraceCheckUtils]: 119: Hoare triple {114315#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114316#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:55,667 INFO L290 TraceCheckUtils]: 120: Hoare triple {114316#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114316#(<= main_~i~0 57)} is VALID [2022-04-15 12:24:55,667 INFO L290 TraceCheckUtils]: 121: Hoare triple {114316#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114317#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:55,667 INFO L290 TraceCheckUtils]: 122: Hoare triple {114317#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114317#(<= main_~i~0 58)} is VALID [2022-04-15 12:24:55,668 INFO L290 TraceCheckUtils]: 123: Hoare triple {114317#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114318#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:55,668 INFO L290 TraceCheckUtils]: 124: Hoare triple {114318#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114318#(<= main_~i~0 59)} is VALID [2022-04-15 12:24:55,668 INFO L290 TraceCheckUtils]: 125: Hoare triple {114318#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114319#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:55,669 INFO L290 TraceCheckUtils]: 126: Hoare triple {114319#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114319#(<= main_~i~0 60)} is VALID [2022-04-15 12:24:55,669 INFO L290 TraceCheckUtils]: 127: Hoare triple {114319#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114320#(<= main_~i~0 61)} is VALID [2022-04-15 12:24:55,669 INFO L290 TraceCheckUtils]: 128: Hoare triple {114320#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114320#(<= main_~i~0 61)} is VALID [2022-04-15 12:24:55,669 INFO L290 TraceCheckUtils]: 129: Hoare triple {114320#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114321#(<= main_~i~0 62)} is VALID [2022-04-15 12:24:55,670 INFO L290 TraceCheckUtils]: 130: Hoare triple {114321#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114321#(<= main_~i~0 62)} is VALID [2022-04-15 12:24:55,670 INFO L290 TraceCheckUtils]: 131: Hoare triple {114321#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114322#(<= main_~i~0 63)} is VALID [2022-04-15 12:24:55,670 INFO L290 TraceCheckUtils]: 132: Hoare triple {114322#(<= main_~i~0 63)} assume !(~i~0 < 1024); {114255#false} is VALID [2022-04-15 12:24:55,670 INFO L290 TraceCheckUtils]: 133: Hoare triple {114255#false} ~i~0 := 0; {114255#false} is VALID [2022-04-15 12:24:55,670 INFO L290 TraceCheckUtils]: 134: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 12:24:55,670 INFO L290 TraceCheckUtils]: 135: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 12:24:55,671 INFO L290 TraceCheckUtils]: 136: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 12:24:55,671 INFO L290 TraceCheckUtils]: 137: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-15 12:24:55,671 INFO L290 TraceCheckUtils]: 138: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 12:24:55,671 INFO L290 TraceCheckUtils]: 139: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 12:24:55,671 INFO L290 TraceCheckUtils]: 140: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 12:24:55,671 INFO L290 TraceCheckUtils]: 141: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-15 12:24:55,671 INFO L290 TraceCheckUtils]: 142: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 12:24:55,671 INFO L290 TraceCheckUtils]: 143: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 12:24:55,671 INFO L290 TraceCheckUtils]: 144: Hoare triple {114255#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 12:24:55,671 INFO L272 TraceCheckUtils]: 145: Hoare triple {114255#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {114255#false} is VALID [2022-04-15 12:24:55,671 INFO L290 TraceCheckUtils]: 146: Hoare triple {114255#false} ~cond := #in~cond; {114255#false} is VALID [2022-04-15 12:24:55,671 INFO L290 TraceCheckUtils]: 147: Hoare triple {114255#false} assume 0 == ~cond; {114255#false} is VALID [2022-04-15 12:24:55,671 INFO L290 TraceCheckUtils]: 148: Hoare triple {114255#false} assume !false; {114255#false} is VALID [2022-04-15 12:24:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3979 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:24:55,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:24:59,682 INFO L290 TraceCheckUtils]: 148: Hoare triple {114255#false} assume !false; {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L290 TraceCheckUtils]: 147: Hoare triple {114255#false} assume 0 == ~cond; {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L290 TraceCheckUtils]: 146: Hoare triple {114255#false} ~cond := #in~cond; {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L272 TraceCheckUtils]: 145: Hoare triple {114255#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L290 TraceCheckUtils]: 144: Hoare triple {114255#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L290 TraceCheckUtils]: 143: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L290 TraceCheckUtils]: 142: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L290 TraceCheckUtils]: 141: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L290 TraceCheckUtils]: 140: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L290 TraceCheckUtils]: 139: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L290 TraceCheckUtils]: 138: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L290 TraceCheckUtils]: 137: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L290 TraceCheckUtils]: 136: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L290 TraceCheckUtils]: 135: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L290 TraceCheckUtils]: 134: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 12:24:59,683 INFO L290 TraceCheckUtils]: 133: Hoare triple {114255#false} ~i~0 := 0; {114255#false} is VALID [2022-04-15 12:24:59,684 INFO L290 TraceCheckUtils]: 132: Hoare triple {114820#(< main_~i~0 1024)} assume !(~i~0 < 1024); {114255#false} is VALID [2022-04-15 12:24:59,684 INFO L290 TraceCheckUtils]: 131: Hoare triple {114824#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114820#(< main_~i~0 1024)} is VALID [2022-04-15 12:24:59,684 INFO L290 TraceCheckUtils]: 130: Hoare triple {114824#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114824#(< main_~i~0 1023)} is VALID [2022-04-15 12:24:59,685 INFO L290 TraceCheckUtils]: 129: Hoare triple {114831#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114824#(< main_~i~0 1023)} is VALID [2022-04-15 12:24:59,685 INFO L290 TraceCheckUtils]: 128: Hoare triple {114831#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114831#(< main_~i~0 1022)} is VALID [2022-04-15 12:24:59,685 INFO L290 TraceCheckUtils]: 127: Hoare triple {114838#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114831#(< main_~i~0 1022)} is VALID [2022-04-15 12:24:59,685 INFO L290 TraceCheckUtils]: 126: Hoare triple {114838#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114838#(< main_~i~0 1021)} is VALID [2022-04-15 12:24:59,686 INFO L290 TraceCheckUtils]: 125: Hoare triple {114845#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114838#(< main_~i~0 1021)} is VALID [2022-04-15 12:24:59,686 INFO L290 TraceCheckUtils]: 124: Hoare triple {114845#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114845#(< main_~i~0 1020)} is VALID [2022-04-15 12:24:59,686 INFO L290 TraceCheckUtils]: 123: Hoare triple {114852#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114845#(< main_~i~0 1020)} is VALID [2022-04-15 12:24:59,686 INFO L290 TraceCheckUtils]: 122: Hoare triple {114852#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114852#(< main_~i~0 1019)} is VALID [2022-04-15 12:24:59,687 INFO L290 TraceCheckUtils]: 121: Hoare triple {114859#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114852#(< main_~i~0 1019)} is VALID [2022-04-15 12:24:59,687 INFO L290 TraceCheckUtils]: 120: Hoare triple {114859#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114859#(< main_~i~0 1018)} is VALID [2022-04-15 12:24:59,687 INFO L290 TraceCheckUtils]: 119: Hoare triple {114866#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114859#(< main_~i~0 1018)} is VALID [2022-04-15 12:24:59,688 INFO L290 TraceCheckUtils]: 118: Hoare triple {114866#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114866#(< main_~i~0 1017)} is VALID [2022-04-15 12:24:59,688 INFO L290 TraceCheckUtils]: 117: Hoare triple {114873#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114866#(< main_~i~0 1017)} is VALID [2022-04-15 12:24:59,688 INFO L290 TraceCheckUtils]: 116: Hoare triple {114873#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114873#(< main_~i~0 1016)} is VALID [2022-04-15 12:24:59,688 INFO L290 TraceCheckUtils]: 115: Hoare triple {114880#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114873#(< main_~i~0 1016)} is VALID [2022-04-15 12:24:59,689 INFO L290 TraceCheckUtils]: 114: Hoare triple {114880#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114880#(< main_~i~0 1015)} is VALID [2022-04-15 12:24:59,689 INFO L290 TraceCheckUtils]: 113: Hoare triple {114887#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114880#(< main_~i~0 1015)} is VALID [2022-04-15 12:24:59,689 INFO L290 TraceCheckUtils]: 112: Hoare triple {114887#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114887#(< main_~i~0 1014)} is VALID [2022-04-15 12:24:59,690 INFO L290 TraceCheckUtils]: 111: Hoare triple {114894#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114887#(< main_~i~0 1014)} is VALID [2022-04-15 12:24:59,690 INFO L290 TraceCheckUtils]: 110: Hoare triple {114894#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114894#(< main_~i~0 1013)} is VALID [2022-04-15 12:24:59,690 INFO L290 TraceCheckUtils]: 109: Hoare triple {114901#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114894#(< main_~i~0 1013)} is VALID [2022-04-15 12:24:59,690 INFO L290 TraceCheckUtils]: 108: Hoare triple {114901#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114901#(< main_~i~0 1012)} is VALID [2022-04-15 12:24:59,691 INFO L290 TraceCheckUtils]: 107: Hoare triple {114908#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114901#(< main_~i~0 1012)} is VALID [2022-04-15 12:24:59,691 INFO L290 TraceCheckUtils]: 106: Hoare triple {114908#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114908#(< main_~i~0 1011)} is VALID [2022-04-15 12:24:59,691 INFO L290 TraceCheckUtils]: 105: Hoare triple {114915#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114908#(< main_~i~0 1011)} is VALID [2022-04-15 12:24:59,692 INFO L290 TraceCheckUtils]: 104: Hoare triple {114915#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114915#(< main_~i~0 1010)} is VALID [2022-04-15 12:24:59,692 INFO L290 TraceCheckUtils]: 103: Hoare triple {114922#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114915#(< main_~i~0 1010)} is VALID [2022-04-15 12:24:59,692 INFO L290 TraceCheckUtils]: 102: Hoare triple {114922#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114922#(< main_~i~0 1009)} is VALID [2022-04-15 12:24:59,692 INFO L290 TraceCheckUtils]: 101: Hoare triple {114929#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114922#(< main_~i~0 1009)} is VALID [2022-04-15 12:24:59,693 INFO L290 TraceCheckUtils]: 100: Hoare triple {114929#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114929#(< main_~i~0 1008)} is VALID [2022-04-15 12:24:59,693 INFO L290 TraceCheckUtils]: 99: Hoare triple {114936#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114929#(< main_~i~0 1008)} is VALID [2022-04-15 12:24:59,693 INFO L290 TraceCheckUtils]: 98: Hoare triple {114936#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114936#(< main_~i~0 1007)} is VALID [2022-04-15 12:24:59,694 INFO L290 TraceCheckUtils]: 97: Hoare triple {114943#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114936#(< main_~i~0 1007)} is VALID [2022-04-15 12:24:59,694 INFO L290 TraceCheckUtils]: 96: Hoare triple {114943#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114943#(< main_~i~0 1006)} is VALID [2022-04-15 12:24:59,694 INFO L290 TraceCheckUtils]: 95: Hoare triple {114950#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114943#(< main_~i~0 1006)} is VALID [2022-04-15 12:24:59,694 INFO L290 TraceCheckUtils]: 94: Hoare triple {114950#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114950#(< main_~i~0 1005)} is VALID [2022-04-15 12:24:59,695 INFO L290 TraceCheckUtils]: 93: Hoare triple {114957#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114950#(< main_~i~0 1005)} is VALID [2022-04-15 12:24:59,695 INFO L290 TraceCheckUtils]: 92: Hoare triple {114957#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114957#(< main_~i~0 1004)} is VALID [2022-04-15 12:24:59,695 INFO L290 TraceCheckUtils]: 91: Hoare triple {114964#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114957#(< main_~i~0 1004)} is VALID [2022-04-15 12:24:59,695 INFO L290 TraceCheckUtils]: 90: Hoare triple {114964#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114964#(< main_~i~0 1003)} is VALID [2022-04-15 12:24:59,696 INFO L290 TraceCheckUtils]: 89: Hoare triple {114971#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114964#(< main_~i~0 1003)} is VALID [2022-04-15 12:24:59,696 INFO L290 TraceCheckUtils]: 88: Hoare triple {114971#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114971#(< main_~i~0 1002)} is VALID [2022-04-15 12:24:59,696 INFO L290 TraceCheckUtils]: 87: Hoare triple {114978#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114971#(< main_~i~0 1002)} is VALID [2022-04-15 12:24:59,697 INFO L290 TraceCheckUtils]: 86: Hoare triple {114978#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114978#(< main_~i~0 1001)} is VALID [2022-04-15 12:24:59,697 INFO L290 TraceCheckUtils]: 85: Hoare triple {114985#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114978#(< main_~i~0 1001)} is VALID [2022-04-15 12:24:59,697 INFO L290 TraceCheckUtils]: 84: Hoare triple {114985#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114985#(< main_~i~0 1000)} is VALID [2022-04-15 12:24:59,697 INFO L290 TraceCheckUtils]: 83: Hoare triple {114992#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114985#(< main_~i~0 1000)} is VALID [2022-04-15 12:24:59,698 INFO L290 TraceCheckUtils]: 82: Hoare triple {114992#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114992#(< main_~i~0 999)} is VALID [2022-04-15 12:24:59,698 INFO L290 TraceCheckUtils]: 81: Hoare triple {114999#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114992#(< main_~i~0 999)} is VALID [2022-04-15 12:24:59,698 INFO L290 TraceCheckUtils]: 80: Hoare triple {114999#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114999#(< main_~i~0 998)} is VALID [2022-04-15 12:24:59,699 INFO L290 TraceCheckUtils]: 79: Hoare triple {115006#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114999#(< main_~i~0 998)} is VALID [2022-04-15 12:24:59,699 INFO L290 TraceCheckUtils]: 78: Hoare triple {115006#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115006#(< main_~i~0 997)} is VALID [2022-04-15 12:24:59,699 INFO L290 TraceCheckUtils]: 77: Hoare triple {115013#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115006#(< main_~i~0 997)} is VALID [2022-04-15 12:24:59,699 INFO L290 TraceCheckUtils]: 76: Hoare triple {115013#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115013#(< main_~i~0 996)} is VALID [2022-04-15 12:24:59,700 INFO L290 TraceCheckUtils]: 75: Hoare triple {115020#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115013#(< main_~i~0 996)} is VALID [2022-04-15 12:24:59,700 INFO L290 TraceCheckUtils]: 74: Hoare triple {115020#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115020#(< main_~i~0 995)} is VALID [2022-04-15 12:24:59,700 INFO L290 TraceCheckUtils]: 73: Hoare triple {115027#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115020#(< main_~i~0 995)} is VALID [2022-04-15 12:24:59,700 INFO L290 TraceCheckUtils]: 72: Hoare triple {115027#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115027#(< main_~i~0 994)} is VALID [2022-04-15 12:24:59,701 INFO L290 TraceCheckUtils]: 71: Hoare triple {115034#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115027#(< main_~i~0 994)} is VALID [2022-04-15 12:24:59,701 INFO L290 TraceCheckUtils]: 70: Hoare triple {115034#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115034#(< main_~i~0 993)} is VALID [2022-04-15 12:24:59,701 INFO L290 TraceCheckUtils]: 69: Hoare triple {115041#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115034#(< main_~i~0 993)} is VALID [2022-04-15 12:24:59,702 INFO L290 TraceCheckUtils]: 68: Hoare triple {115041#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115041#(< main_~i~0 992)} is VALID [2022-04-15 12:24:59,702 INFO L290 TraceCheckUtils]: 67: Hoare triple {115048#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115041#(< main_~i~0 992)} is VALID [2022-04-15 12:24:59,702 INFO L290 TraceCheckUtils]: 66: Hoare triple {115048#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115048#(< main_~i~0 991)} is VALID [2022-04-15 12:24:59,702 INFO L290 TraceCheckUtils]: 65: Hoare triple {115055#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115048#(< main_~i~0 991)} is VALID [2022-04-15 12:24:59,703 INFO L290 TraceCheckUtils]: 64: Hoare triple {115055#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115055#(< main_~i~0 990)} is VALID [2022-04-15 12:24:59,703 INFO L290 TraceCheckUtils]: 63: Hoare triple {115062#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115055#(< main_~i~0 990)} is VALID [2022-04-15 12:24:59,703 INFO L290 TraceCheckUtils]: 62: Hoare triple {115062#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115062#(< main_~i~0 989)} is VALID [2022-04-15 12:24:59,704 INFO L290 TraceCheckUtils]: 61: Hoare triple {115069#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115062#(< main_~i~0 989)} is VALID [2022-04-15 12:24:59,704 INFO L290 TraceCheckUtils]: 60: Hoare triple {115069#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115069#(< main_~i~0 988)} is VALID [2022-04-15 12:24:59,704 INFO L290 TraceCheckUtils]: 59: Hoare triple {115076#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115069#(< main_~i~0 988)} is VALID [2022-04-15 12:24:59,704 INFO L290 TraceCheckUtils]: 58: Hoare triple {115076#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115076#(< main_~i~0 987)} is VALID [2022-04-15 12:24:59,705 INFO L290 TraceCheckUtils]: 57: Hoare triple {115083#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115076#(< main_~i~0 987)} is VALID [2022-04-15 12:24:59,705 INFO L290 TraceCheckUtils]: 56: Hoare triple {115083#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115083#(< main_~i~0 986)} is VALID [2022-04-15 12:24:59,705 INFO L290 TraceCheckUtils]: 55: Hoare triple {115090#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115083#(< main_~i~0 986)} is VALID [2022-04-15 12:24:59,705 INFO L290 TraceCheckUtils]: 54: Hoare triple {115090#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115090#(< main_~i~0 985)} is VALID [2022-04-15 12:24:59,706 INFO L290 TraceCheckUtils]: 53: Hoare triple {115097#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115090#(< main_~i~0 985)} is VALID [2022-04-15 12:24:59,706 INFO L290 TraceCheckUtils]: 52: Hoare triple {115097#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115097#(< main_~i~0 984)} is VALID [2022-04-15 12:24:59,706 INFO L290 TraceCheckUtils]: 51: Hoare triple {115104#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115097#(< main_~i~0 984)} is VALID [2022-04-15 12:24:59,707 INFO L290 TraceCheckUtils]: 50: Hoare triple {115104#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115104#(< main_~i~0 983)} is VALID [2022-04-15 12:24:59,707 INFO L290 TraceCheckUtils]: 49: Hoare triple {115111#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115104#(< main_~i~0 983)} is VALID [2022-04-15 12:24:59,707 INFO L290 TraceCheckUtils]: 48: Hoare triple {115111#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115111#(< main_~i~0 982)} is VALID [2022-04-15 12:24:59,707 INFO L290 TraceCheckUtils]: 47: Hoare triple {115118#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115111#(< main_~i~0 982)} is VALID [2022-04-15 12:24:59,708 INFO L290 TraceCheckUtils]: 46: Hoare triple {115118#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115118#(< main_~i~0 981)} is VALID [2022-04-15 12:24:59,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {115125#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115118#(< main_~i~0 981)} is VALID [2022-04-15 12:24:59,708 INFO L290 TraceCheckUtils]: 44: Hoare triple {115125#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115125#(< main_~i~0 980)} is VALID [2022-04-15 12:24:59,709 INFO L290 TraceCheckUtils]: 43: Hoare triple {115132#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115125#(< main_~i~0 980)} is VALID [2022-04-15 12:24:59,709 INFO L290 TraceCheckUtils]: 42: Hoare triple {115132#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115132#(< main_~i~0 979)} is VALID [2022-04-15 12:24:59,709 INFO L290 TraceCheckUtils]: 41: Hoare triple {115139#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115132#(< main_~i~0 979)} is VALID [2022-04-15 12:24:59,709 INFO L290 TraceCheckUtils]: 40: Hoare triple {115139#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115139#(< main_~i~0 978)} is VALID [2022-04-15 12:24:59,710 INFO L290 TraceCheckUtils]: 39: Hoare triple {115146#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115139#(< main_~i~0 978)} is VALID [2022-04-15 12:24:59,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {115146#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115146#(< main_~i~0 977)} is VALID [2022-04-15 12:24:59,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {115153#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115146#(< main_~i~0 977)} is VALID [2022-04-15 12:24:59,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {115153#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115153#(< main_~i~0 976)} is VALID [2022-04-15 12:24:59,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {115160#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115153#(< main_~i~0 976)} is VALID [2022-04-15 12:24:59,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {115160#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115160#(< main_~i~0 975)} is VALID [2022-04-15 12:24:59,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {115167#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115160#(< main_~i~0 975)} is VALID [2022-04-15 12:24:59,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {115167#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115167#(< main_~i~0 974)} is VALID [2022-04-15 12:24:59,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {115174#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115167#(< main_~i~0 974)} is VALID [2022-04-15 12:24:59,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {115174#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115174#(< main_~i~0 973)} is VALID [2022-04-15 12:24:59,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {115181#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115174#(< main_~i~0 973)} is VALID [2022-04-15 12:24:59,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {115181#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115181#(< main_~i~0 972)} is VALID [2022-04-15 12:24:59,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {115188#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115181#(< main_~i~0 972)} is VALID [2022-04-15 12:24:59,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {115188#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115188#(< main_~i~0 971)} is VALID [2022-04-15 12:24:59,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {115195#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115188#(< main_~i~0 971)} is VALID [2022-04-15 12:24:59,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {115195#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115195#(< main_~i~0 970)} is VALID [2022-04-15 12:24:59,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {115202#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115195#(< main_~i~0 970)} is VALID [2022-04-15 12:24:59,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {115202#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115202#(< main_~i~0 969)} is VALID [2022-04-15 12:24:59,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {115209#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115202#(< main_~i~0 969)} is VALID [2022-04-15 12:24:59,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {115209#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115209#(< main_~i~0 968)} is VALID [2022-04-15 12:24:59,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {115216#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115209#(< main_~i~0 968)} is VALID [2022-04-15 12:24:59,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {115216#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115216#(< main_~i~0 967)} is VALID [2022-04-15 12:24:59,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {115223#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115216#(< main_~i~0 967)} is VALID [2022-04-15 12:24:59,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {115223#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115223#(< main_~i~0 966)} is VALID [2022-04-15 12:24:59,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {115230#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115223#(< main_~i~0 966)} is VALID [2022-04-15 12:24:59,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {115230#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115230#(< main_~i~0 965)} is VALID [2022-04-15 12:24:59,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {115237#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115230#(< main_~i~0 965)} is VALID [2022-04-15 12:24:59,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {115237#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115237#(< main_~i~0 964)} is VALID [2022-04-15 12:24:59,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {115244#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115237#(< main_~i~0 964)} is VALID [2022-04-15 12:24:59,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {115244#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115244#(< main_~i~0 963)} is VALID [2022-04-15 12:24:59,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {115251#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115244#(< main_~i~0 963)} is VALID [2022-04-15 12:24:59,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {115251#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115251#(< main_~i~0 962)} is VALID [2022-04-15 12:24:59,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {115258#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115251#(< main_~i~0 962)} is VALID [2022-04-15 12:24:59,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {115258#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115258#(< main_~i~0 961)} is VALID [2022-04-15 12:24:59,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {114254#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {115258#(< main_~i~0 961)} is VALID [2022-04-15 12:24:59,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {114254#true} call #t~ret6 := main(); {114254#true} is VALID [2022-04-15 12:24:59,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114254#true} {114254#true} #64#return; {114254#true} is VALID [2022-04-15 12:24:59,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {114254#true} assume true; {114254#true} is VALID [2022-04-15 12:24:59,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {114254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {114254#true} is VALID [2022-04-15 12:24:59,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {114254#true} call ULTIMATE.init(); {114254#true} is VALID [2022-04-15 12:24:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3979 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:24:59,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916217163] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:24:59,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:24:59,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 132 [2022-04-15 12:24:59,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:24:59,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [588510055] [2022-04-15 12:24:59,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [588510055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:24:59,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:24:59,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-15 12:24:59,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258442088] [2022-04-15 12:24:59,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:24:59,732 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-15 12:24:59,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:24:59,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:24:59,815 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:24:59,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-15 12:24:59,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:59,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-15 12:24:59,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8517, Invalid=8775, Unknown=0, NotChecked=0, Total=17292 [2022-04-15 12:24:59,818 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:16,816 INFO L93 Difference]: Finished difference Result 481 states and 613 transitions. [2022-04-15 12:25:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-15 12:25:16,816 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-15 12:25:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:25:16,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 604 transitions. [2022-04-15 12:25:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 604 transitions. [2022-04-15 12:25:16,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 604 transitions. [2022-04-15 12:25:17,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 604 edges. 604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:17,207 INFO L225 Difference]: With dead ends: 481 [2022-04-15 12:25:17,207 INFO L226 Difference]: Without dead ends: 464 [2022-04-15 12:25:17,209 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2393 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=16902, Invalid=21318, Unknown=0, NotChecked=0, Total=38220 [2022-04-15 12:25:17,209 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1526 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:25:17,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1526 Valid, 47 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:25:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-04-15 12:25:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 152. [2022-04-15 12:25:18,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:25:18,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 464 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:18,186 INFO L74 IsIncluded]: Start isIncluded. First operand 464 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:18,186 INFO L87 Difference]: Start difference. First operand 464 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:18,193 INFO L93 Difference]: Finished difference Result 464 states and 592 transitions. [2022-04-15 12:25:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 592 transitions. [2022-04-15 12:25:18,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:18,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:18,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 464 states. [2022-04-15 12:25:18,194 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 464 states. [2022-04-15 12:25:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:18,201 INFO L93 Difference]: Finished difference Result 464 states and 592 transitions. [2022-04-15 12:25:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 592 transitions. [2022-04-15 12:25:18,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:18,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:18,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:25:18,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:25:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2022-04-15 12:25:18,203 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 149 [2022-04-15 12:25:18,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:25:18,204 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2022-04-15 12:25:18,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:18,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 156 transitions. [2022-04-15 12:25:18,627 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:25:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2022-04-15 12:25:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-15 12:25:18,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:25:18,628 INFO L499 BasicCegarLoop]: trace histogram [64, 64, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:25:18,646 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:18,828 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:18,829 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:25:18,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:25:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash 93474493, now seen corresponding path program 129 times [2022-04-15 12:25:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:18,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [461108638] [2022-04-15 12:25:18,832 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:25:18,832 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:25:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash 93474493, now seen corresponding path program 130 times [2022-04-15 12:25:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:25:18,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303376636] [2022-04-15 12:25:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:25:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:25:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:20,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:25:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:20,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {117674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {117604#true} is VALID [2022-04-15 12:25:20,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {117604#true} assume true; {117604#true} is VALID [2022-04-15 12:25:20,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {117604#true} {117604#true} #64#return; {117604#true} is VALID [2022-04-15 12:25:20,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {117604#true} call ULTIMATE.init(); {117674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:25:20,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {117674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {117604#true} is VALID [2022-04-15 12:25:20,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {117604#true} assume true; {117604#true} is VALID [2022-04-15 12:25:20,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117604#true} {117604#true} #64#return; {117604#true} is VALID [2022-04-15 12:25:20,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {117604#true} call #t~ret6 := main(); {117604#true} is VALID [2022-04-15 12:25:20,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {117604#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {117609#(= main_~i~0 0)} is VALID [2022-04-15 12:25:20,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {117609#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117609#(= main_~i~0 0)} is VALID [2022-04-15 12:25:20,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {117609#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117610#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:20,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {117610#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117610#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:20,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {117610#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117611#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:20,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {117611#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117611#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:20,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {117611#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117612#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:20,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {117612#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117612#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:20,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {117612#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117613#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:20,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {117613#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117613#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:20,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {117613#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117614#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:20,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {117614#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117614#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:20,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {117614#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117615#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:20,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {117615#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117615#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:20,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {117615#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117616#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:20,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {117616#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117616#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:20,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {117616#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117617#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:20,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {117617#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117617#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:20,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {117617#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117618#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:20,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {117618#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117618#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:20,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {117618#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117619#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:20,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {117619#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117619#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:20,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {117619#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117620#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:20,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {117620#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117620#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:20,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {117620#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117621#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:20,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {117621#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117621#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:20,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {117621#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117622#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:20,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {117622#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117622#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:20,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {117622#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117623#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:20,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {117623#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117623#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:20,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {117623#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117624#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:20,182 INFO L290 TraceCheckUtils]: 36: Hoare triple {117624#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117624#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:20,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {117624#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117625#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:20,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {117625#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117625#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:20,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {117625#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117626#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:20,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {117626#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117626#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:20,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {117626#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117627#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:20,184 INFO L290 TraceCheckUtils]: 42: Hoare triple {117627#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117627#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:20,184 INFO L290 TraceCheckUtils]: 43: Hoare triple {117627#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117628#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:20,184 INFO L290 TraceCheckUtils]: 44: Hoare triple {117628#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117628#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:20,184 INFO L290 TraceCheckUtils]: 45: Hoare triple {117628#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117629#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:20,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {117629#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117629#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:20,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {117629#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117630#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:20,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {117630#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117630#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:20,186 INFO L290 TraceCheckUtils]: 49: Hoare triple {117630#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117631#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:20,186 INFO L290 TraceCheckUtils]: 50: Hoare triple {117631#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117631#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:20,186 INFO L290 TraceCheckUtils]: 51: Hoare triple {117631#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117632#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:20,186 INFO L290 TraceCheckUtils]: 52: Hoare triple {117632#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117632#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:20,187 INFO L290 TraceCheckUtils]: 53: Hoare triple {117632#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117633#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:20,187 INFO L290 TraceCheckUtils]: 54: Hoare triple {117633#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117633#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:20,187 INFO L290 TraceCheckUtils]: 55: Hoare triple {117633#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117634#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:20,187 INFO L290 TraceCheckUtils]: 56: Hoare triple {117634#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117634#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:20,188 INFO L290 TraceCheckUtils]: 57: Hoare triple {117634#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117635#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:20,188 INFO L290 TraceCheckUtils]: 58: Hoare triple {117635#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117635#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:20,188 INFO L290 TraceCheckUtils]: 59: Hoare triple {117635#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117636#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:20,188 INFO L290 TraceCheckUtils]: 60: Hoare triple {117636#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117636#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:20,189 INFO L290 TraceCheckUtils]: 61: Hoare triple {117636#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117637#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:20,189 INFO L290 TraceCheckUtils]: 62: Hoare triple {117637#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117637#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:20,189 INFO L290 TraceCheckUtils]: 63: Hoare triple {117637#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117638#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:20,190 INFO L290 TraceCheckUtils]: 64: Hoare triple {117638#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117638#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:20,190 INFO L290 TraceCheckUtils]: 65: Hoare triple {117638#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117639#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:20,190 INFO L290 TraceCheckUtils]: 66: Hoare triple {117639#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117639#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:20,190 INFO L290 TraceCheckUtils]: 67: Hoare triple {117639#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117640#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:20,191 INFO L290 TraceCheckUtils]: 68: Hoare triple {117640#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117640#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:20,191 INFO L290 TraceCheckUtils]: 69: Hoare triple {117640#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117641#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:20,191 INFO L290 TraceCheckUtils]: 70: Hoare triple {117641#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117641#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:20,192 INFO L290 TraceCheckUtils]: 71: Hoare triple {117641#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117642#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:20,192 INFO L290 TraceCheckUtils]: 72: Hoare triple {117642#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117642#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:20,192 INFO L290 TraceCheckUtils]: 73: Hoare triple {117642#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117643#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:20,192 INFO L290 TraceCheckUtils]: 74: Hoare triple {117643#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117643#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:20,193 INFO L290 TraceCheckUtils]: 75: Hoare triple {117643#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117644#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:20,193 INFO L290 TraceCheckUtils]: 76: Hoare triple {117644#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117644#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:20,193 INFO L290 TraceCheckUtils]: 77: Hoare triple {117644#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117645#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:20,193 INFO L290 TraceCheckUtils]: 78: Hoare triple {117645#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117645#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:20,194 INFO L290 TraceCheckUtils]: 79: Hoare triple {117645#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117646#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:20,194 INFO L290 TraceCheckUtils]: 80: Hoare triple {117646#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117646#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:20,194 INFO L290 TraceCheckUtils]: 81: Hoare triple {117646#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117647#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:20,194 INFO L290 TraceCheckUtils]: 82: Hoare triple {117647#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117647#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:20,195 INFO L290 TraceCheckUtils]: 83: Hoare triple {117647#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117648#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:20,195 INFO L290 TraceCheckUtils]: 84: Hoare triple {117648#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117648#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:20,195 INFO L290 TraceCheckUtils]: 85: Hoare triple {117648#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117649#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:20,195 INFO L290 TraceCheckUtils]: 86: Hoare triple {117649#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117649#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:20,196 INFO L290 TraceCheckUtils]: 87: Hoare triple {117649#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117650#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:20,196 INFO L290 TraceCheckUtils]: 88: Hoare triple {117650#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117650#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:20,196 INFO L290 TraceCheckUtils]: 89: Hoare triple {117650#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117651#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:20,197 INFO L290 TraceCheckUtils]: 90: Hoare triple {117651#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117651#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:20,197 INFO L290 TraceCheckUtils]: 91: Hoare triple {117651#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117652#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:20,197 INFO L290 TraceCheckUtils]: 92: Hoare triple {117652#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117652#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:20,197 INFO L290 TraceCheckUtils]: 93: Hoare triple {117652#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117653#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:20,198 INFO L290 TraceCheckUtils]: 94: Hoare triple {117653#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117653#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:20,198 INFO L290 TraceCheckUtils]: 95: Hoare triple {117653#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117654#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:20,198 INFO L290 TraceCheckUtils]: 96: Hoare triple {117654#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117654#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:20,199 INFO L290 TraceCheckUtils]: 97: Hoare triple {117654#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117655#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:20,199 INFO L290 TraceCheckUtils]: 98: Hoare triple {117655#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117655#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:20,199 INFO L290 TraceCheckUtils]: 99: Hoare triple {117655#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117656#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:20,199 INFO L290 TraceCheckUtils]: 100: Hoare triple {117656#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117656#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:20,200 INFO L290 TraceCheckUtils]: 101: Hoare triple {117656#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117657#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:20,200 INFO L290 TraceCheckUtils]: 102: Hoare triple {117657#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117657#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:20,200 INFO L290 TraceCheckUtils]: 103: Hoare triple {117657#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117658#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:20,200 INFO L290 TraceCheckUtils]: 104: Hoare triple {117658#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117658#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:20,201 INFO L290 TraceCheckUtils]: 105: Hoare triple {117658#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117659#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:20,201 INFO L290 TraceCheckUtils]: 106: Hoare triple {117659#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117659#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:20,201 INFO L290 TraceCheckUtils]: 107: Hoare triple {117659#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117660#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:20,201 INFO L290 TraceCheckUtils]: 108: Hoare triple {117660#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117660#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:20,202 INFO L290 TraceCheckUtils]: 109: Hoare triple {117660#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117661#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:20,202 INFO L290 TraceCheckUtils]: 110: Hoare triple {117661#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117661#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:20,202 INFO L290 TraceCheckUtils]: 111: Hoare triple {117661#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117662#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:20,203 INFO L290 TraceCheckUtils]: 112: Hoare triple {117662#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117662#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:20,203 INFO L290 TraceCheckUtils]: 113: Hoare triple {117662#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117663#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:20,203 INFO L290 TraceCheckUtils]: 114: Hoare triple {117663#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117663#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:20,203 INFO L290 TraceCheckUtils]: 115: Hoare triple {117663#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117664#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:20,204 INFO L290 TraceCheckUtils]: 116: Hoare triple {117664#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117664#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:20,204 INFO L290 TraceCheckUtils]: 117: Hoare triple {117664#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117665#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:20,204 INFO L290 TraceCheckUtils]: 118: Hoare triple {117665#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117665#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:20,205 INFO L290 TraceCheckUtils]: 119: Hoare triple {117665#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117666#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:20,205 INFO L290 TraceCheckUtils]: 120: Hoare triple {117666#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117666#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:20,205 INFO L290 TraceCheckUtils]: 121: Hoare triple {117666#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117667#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:20,205 INFO L290 TraceCheckUtils]: 122: Hoare triple {117667#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117667#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:20,206 INFO L290 TraceCheckUtils]: 123: Hoare triple {117667#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117668#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:20,206 INFO L290 TraceCheckUtils]: 124: Hoare triple {117668#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117668#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:20,206 INFO L290 TraceCheckUtils]: 125: Hoare triple {117668#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117669#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:20,206 INFO L290 TraceCheckUtils]: 126: Hoare triple {117669#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117669#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:20,207 INFO L290 TraceCheckUtils]: 127: Hoare triple {117669#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117670#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:20,207 INFO L290 TraceCheckUtils]: 128: Hoare triple {117670#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117670#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:20,207 INFO L290 TraceCheckUtils]: 129: Hoare triple {117670#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117671#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:20,207 INFO L290 TraceCheckUtils]: 130: Hoare triple {117671#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117671#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:20,208 INFO L290 TraceCheckUtils]: 131: Hoare triple {117671#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117672#(<= main_~i~0 63)} is VALID [2022-04-15 12:25:20,208 INFO L290 TraceCheckUtils]: 132: Hoare triple {117672#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117672#(<= main_~i~0 63)} is VALID [2022-04-15 12:25:20,208 INFO L290 TraceCheckUtils]: 133: Hoare triple {117672#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117673#(<= main_~i~0 64)} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 134: Hoare triple {117673#(<= main_~i~0 64)} assume !(~i~0 < 1024); {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 135: Hoare triple {117605#false} ~i~0 := 0; {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 136: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 137: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 138: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 139: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 140: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 141: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 142: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 143: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 144: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 145: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 146: Hoare triple {117605#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L272 TraceCheckUtils]: 147: Hoare triple {117605#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 148: Hoare triple {117605#false} ~cond := #in~cond; {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 149: Hoare triple {117605#false} assume 0 == ~cond; {117605#false} is VALID [2022-04-15 12:25:20,209 INFO L290 TraceCheckUtils]: 150: Hoare triple {117605#false} assume !false; {117605#false} is VALID [2022-04-15 12:25:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4106 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:25:20,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:25:20,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303376636] [2022-04-15 12:25:20,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303376636] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:25:20,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995573968] [2022-04-15 12:25:20,210 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:25:20,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:25:20,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:25:20,211 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:20,213 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:20,620 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:25:20,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:25:20,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-15 12:25:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:20,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:25:21,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {117604#true} call ULTIMATE.init(); {117604#true} is VALID [2022-04-15 12:25:21,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {117604#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {117604#true} is VALID [2022-04-15 12:25:21,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {117604#true} assume true; {117604#true} is VALID [2022-04-15 12:25:21,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117604#true} {117604#true} #64#return; {117604#true} is VALID [2022-04-15 12:25:21,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {117604#true} call #t~ret6 := main(); {117604#true} is VALID [2022-04-15 12:25:21,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {117604#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {117693#(<= main_~i~0 0)} is VALID [2022-04-15 12:25:21,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {117693#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117693#(<= main_~i~0 0)} is VALID [2022-04-15 12:25:21,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {117693#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117610#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:21,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {117610#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117610#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:21,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {117610#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117611#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:21,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {117611#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117611#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:21,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {117611#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117612#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:21,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {117612#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117612#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:21,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {117612#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117613#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:21,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {117613#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117613#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:21,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {117613#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117614#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:21,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {117614#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117614#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:21,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {117614#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117615#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:21,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {117615#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117615#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:21,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {117615#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117616#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:21,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {117616#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117616#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:21,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {117616#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117617#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:21,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {117617#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117617#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:21,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {117617#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117618#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:21,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {117618#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117618#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:21,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {117618#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117619#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:21,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {117619#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117619#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:21,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {117619#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117620#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:21,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {117620#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117620#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:21,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {117620#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117621#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:21,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {117621#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117621#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:21,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {117621#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117622#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:21,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {117622#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117622#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:21,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {117622#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117623#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:21,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {117623#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117623#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:21,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {117623#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117624#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:21,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {117624#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117624#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:21,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {117624#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117625#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:21,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {117625#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117625#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:21,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {117625#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117626#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:21,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {117626#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117626#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:21,374 INFO L290 TraceCheckUtils]: 41: Hoare triple {117626#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117627#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:21,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {117627#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117627#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:21,375 INFO L290 TraceCheckUtils]: 43: Hoare triple {117627#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117628#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:21,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {117628#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117628#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:21,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {117628#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117629#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:21,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {117629#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117629#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:21,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {117629#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117630#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:21,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {117630#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117630#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:21,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {117630#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117631#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:21,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {117631#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117631#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:21,377 INFO L290 TraceCheckUtils]: 51: Hoare triple {117631#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117632#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:21,377 INFO L290 TraceCheckUtils]: 52: Hoare triple {117632#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117632#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:21,377 INFO L290 TraceCheckUtils]: 53: Hoare triple {117632#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117633#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:21,378 INFO L290 TraceCheckUtils]: 54: Hoare triple {117633#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117633#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:21,378 INFO L290 TraceCheckUtils]: 55: Hoare triple {117633#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117634#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:21,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {117634#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117634#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:21,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {117634#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117635#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:21,379 INFO L290 TraceCheckUtils]: 58: Hoare triple {117635#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117635#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:21,379 INFO L290 TraceCheckUtils]: 59: Hoare triple {117635#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117636#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:21,379 INFO L290 TraceCheckUtils]: 60: Hoare triple {117636#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117636#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:21,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {117636#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117637#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:21,380 INFO L290 TraceCheckUtils]: 62: Hoare triple {117637#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117637#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:21,380 INFO L290 TraceCheckUtils]: 63: Hoare triple {117637#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117638#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:21,380 INFO L290 TraceCheckUtils]: 64: Hoare triple {117638#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117638#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:21,381 INFO L290 TraceCheckUtils]: 65: Hoare triple {117638#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117639#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:21,381 INFO L290 TraceCheckUtils]: 66: Hoare triple {117639#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117639#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:21,381 INFO L290 TraceCheckUtils]: 67: Hoare triple {117639#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117640#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:21,381 INFO L290 TraceCheckUtils]: 68: Hoare triple {117640#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117640#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:21,382 INFO L290 TraceCheckUtils]: 69: Hoare triple {117640#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117641#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:21,382 INFO L290 TraceCheckUtils]: 70: Hoare triple {117641#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117641#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:21,382 INFO L290 TraceCheckUtils]: 71: Hoare triple {117641#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117642#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:21,382 INFO L290 TraceCheckUtils]: 72: Hoare triple {117642#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117642#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:21,383 INFO L290 TraceCheckUtils]: 73: Hoare triple {117642#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117643#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:21,383 INFO L290 TraceCheckUtils]: 74: Hoare triple {117643#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117643#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:21,383 INFO L290 TraceCheckUtils]: 75: Hoare triple {117643#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117644#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:21,383 INFO L290 TraceCheckUtils]: 76: Hoare triple {117644#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117644#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:21,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {117644#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117645#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:21,384 INFO L290 TraceCheckUtils]: 78: Hoare triple {117645#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117645#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:21,384 INFO L290 TraceCheckUtils]: 79: Hoare triple {117645#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117646#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:21,384 INFO L290 TraceCheckUtils]: 80: Hoare triple {117646#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117646#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:21,385 INFO L290 TraceCheckUtils]: 81: Hoare triple {117646#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117647#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:21,385 INFO L290 TraceCheckUtils]: 82: Hoare triple {117647#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117647#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:21,385 INFO L290 TraceCheckUtils]: 83: Hoare triple {117647#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117648#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:21,385 INFO L290 TraceCheckUtils]: 84: Hoare triple {117648#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117648#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:21,386 INFO L290 TraceCheckUtils]: 85: Hoare triple {117648#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117649#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:21,386 INFO L290 TraceCheckUtils]: 86: Hoare triple {117649#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117649#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:21,386 INFO L290 TraceCheckUtils]: 87: Hoare triple {117649#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117650#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:21,387 INFO L290 TraceCheckUtils]: 88: Hoare triple {117650#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117650#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:21,387 INFO L290 TraceCheckUtils]: 89: Hoare triple {117650#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117651#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:21,387 INFO L290 TraceCheckUtils]: 90: Hoare triple {117651#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117651#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:21,387 INFO L290 TraceCheckUtils]: 91: Hoare triple {117651#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117652#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:21,388 INFO L290 TraceCheckUtils]: 92: Hoare triple {117652#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117652#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:21,388 INFO L290 TraceCheckUtils]: 93: Hoare triple {117652#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117653#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:21,388 INFO L290 TraceCheckUtils]: 94: Hoare triple {117653#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117653#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:21,388 INFO L290 TraceCheckUtils]: 95: Hoare triple {117653#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117654#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:21,389 INFO L290 TraceCheckUtils]: 96: Hoare triple {117654#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117654#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:21,389 INFO L290 TraceCheckUtils]: 97: Hoare triple {117654#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117655#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:21,389 INFO L290 TraceCheckUtils]: 98: Hoare triple {117655#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117655#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:21,389 INFO L290 TraceCheckUtils]: 99: Hoare triple {117655#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117656#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:21,390 INFO L290 TraceCheckUtils]: 100: Hoare triple {117656#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117656#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:21,390 INFO L290 TraceCheckUtils]: 101: Hoare triple {117656#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117657#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:21,390 INFO L290 TraceCheckUtils]: 102: Hoare triple {117657#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117657#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:21,391 INFO L290 TraceCheckUtils]: 103: Hoare triple {117657#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117658#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:21,391 INFO L290 TraceCheckUtils]: 104: Hoare triple {117658#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117658#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:21,391 INFO L290 TraceCheckUtils]: 105: Hoare triple {117658#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117659#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:21,391 INFO L290 TraceCheckUtils]: 106: Hoare triple {117659#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117659#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:21,392 INFO L290 TraceCheckUtils]: 107: Hoare triple {117659#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117660#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:21,392 INFO L290 TraceCheckUtils]: 108: Hoare triple {117660#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117660#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:21,392 INFO L290 TraceCheckUtils]: 109: Hoare triple {117660#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117661#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:21,392 INFO L290 TraceCheckUtils]: 110: Hoare triple {117661#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117661#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:21,393 INFO L290 TraceCheckUtils]: 111: Hoare triple {117661#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117662#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:21,393 INFO L290 TraceCheckUtils]: 112: Hoare triple {117662#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117662#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:21,393 INFO L290 TraceCheckUtils]: 113: Hoare triple {117662#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117663#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:21,393 INFO L290 TraceCheckUtils]: 114: Hoare triple {117663#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117663#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:21,394 INFO L290 TraceCheckUtils]: 115: Hoare triple {117663#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117664#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:21,394 INFO L290 TraceCheckUtils]: 116: Hoare triple {117664#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117664#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:21,394 INFO L290 TraceCheckUtils]: 117: Hoare triple {117664#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117665#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:21,394 INFO L290 TraceCheckUtils]: 118: Hoare triple {117665#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117665#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:21,395 INFO L290 TraceCheckUtils]: 119: Hoare triple {117665#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117666#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:21,395 INFO L290 TraceCheckUtils]: 120: Hoare triple {117666#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117666#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:21,395 INFO L290 TraceCheckUtils]: 121: Hoare triple {117666#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117667#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:21,396 INFO L290 TraceCheckUtils]: 122: Hoare triple {117667#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117667#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:21,396 INFO L290 TraceCheckUtils]: 123: Hoare triple {117667#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117668#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:21,396 INFO L290 TraceCheckUtils]: 124: Hoare triple {117668#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117668#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:21,396 INFO L290 TraceCheckUtils]: 125: Hoare triple {117668#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117669#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:21,397 INFO L290 TraceCheckUtils]: 126: Hoare triple {117669#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117669#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:21,397 INFO L290 TraceCheckUtils]: 127: Hoare triple {117669#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117670#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:21,397 INFO L290 TraceCheckUtils]: 128: Hoare triple {117670#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117670#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:21,397 INFO L290 TraceCheckUtils]: 129: Hoare triple {117670#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117671#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:21,398 INFO L290 TraceCheckUtils]: 130: Hoare triple {117671#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117671#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:21,398 INFO L290 TraceCheckUtils]: 131: Hoare triple {117671#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117672#(<= main_~i~0 63)} is VALID [2022-04-15 12:25:21,398 INFO L290 TraceCheckUtils]: 132: Hoare triple {117672#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117672#(<= main_~i~0 63)} is VALID [2022-04-15 12:25:21,398 INFO L290 TraceCheckUtils]: 133: Hoare triple {117672#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117673#(<= main_~i~0 64)} is VALID [2022-04-15 12:25:21,399 INFO L290 TraceCheckUtils]: 134: Hoare triple {117673#(<= main_~i~0 64)} assume !(~i~0 < 1024); {117605#false} is VALID [2022-04-15 12:25:21,399 INFO L290 TraceCheckUtils]: 135: Hoare triple {117605#false} ~i~0 := 0; {117605#false} is VALID [2022-04-15 12:25:21,399 INFO L290 TraceCheckUtils]: 136: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 12:25:21,399 INFO L290 TraceCheckUtils]: 137: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 12:25:21,399 INFO L290 TraceCheckUtils]: 138: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 12:25:21,399 INFO L290 TraceCheckUtils]: 139: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-15 12:25:21,399 INFO L290 TraceCheckUtils]: 140: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 12:25:21,399 INFO L290 TraceCheckUtils]: 141: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 12:25:21,399 INFO L290 TraceCheckUtils]: 142: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 12:25:21,399 INFO L290 TraceCheckUtils]: 143: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-15 12:25:21,399 INFO L290 TraceCheckUtils]: 144: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 12:25:21,399 INFO L290 TraceCheckUtils]: 145: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 12:25:21,399 INFO L290 TraceCheckUtils]: 146: Hoare triple {117605#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 12:25:21,399 INFO L272 TraceCheckUtils]: 147: Hoare triple {117605#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {117605#false} is VALID [2022-04-15 12:25:21,400 INFO L290 TraceCheckUtils]: 148: Hoare triple {117605#false} ~cond := #in~cond; {117605#false} is VALID [2022-04-15 12:25:21,400 INFO L290 TraceCheckUtils]: 149: Hoare triple {117605#false} assume 0 == ~cond; {117605#false} is VALID [2022-04-15 12:25:21,400 INFO L290 TraceCheckUtils]: 150: Hoare triple {117605#false} assume !false; {117605#false} is VALID [2022-04-15 12:25:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4106 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:25:21,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:25:25,517 INFO L290 TraceCheckUtils]: 150: Hoare triple {117605#false} assume !false; {117605#false} is VALID [2022-04-15 12:25:25,517 INFO L290 TraceCheckUtils]: 149: Hoare triple {117605#false} assume 0 == ~cond; {117605#false} is VALID [2022-04-15 12:25:25,517 INFO L290 TraceCheckUtils]: 148: Hoare triple {117605#false} ~cond := #in~cond; {117605#false} is VALID [2022-04-15 12:25:25,517 INFO L272 TraceCheckUtils]: 147: Hoare triple {117605#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {117605#false} is VALID [2022-04-15 12:25:25,517 INFO L290 TraceCheckUtils]: 146: Hoare triple {117605#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 12:25:25,517 INFO L290 TraceCheckUtils]: 145: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 12:25:25,517 INFO L290 TraceCheckUtils]: 144: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 12:25:25,517 INFO L290 TraceCheckUtils]: 143: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-15 12:25:25,517 INFO L290 TraceCheckUtils]: 142: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 12:25:25,517 INFO L290 TraceCheckUtils]: 141: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 12:25:25,517 INFO L290 TraceCheckUtils]: 140: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 12:25:25,518 INFO L290 TraceCheckUtils]: 139: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-15 12:25:25,518 INFO L290 TraceCheckUtils]: 138: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 12:25:25,518 INFO L290 TraceCheckUtils]: 137: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 12:25:25,518 INFO L290 TraceCheckUtils]: 136: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 12:25:25,518 INFO L290 TraceCheckUtils]: 135: Hoare triple {117605#false} ~i~0 := 0; {117605#false} is VALID [2022-04-15 12:25:25,518 INFO L290 TraceCheckUtils]: 134: Hoare triple {118177#(< main_~i~0 1024)} assume !(~i~0 < 1024); {117605#false} is VALID [2022-04-15 12:25:25,518 INFO L290 TraceCheckUtils]: 133: Hoare triple {118181#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118177#(< main_~i~0 1024)} is VALID [2022-04-15 12:25:25,519 INFO L290 TraceCheckUtils]: 132: Hoare triple {118181#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118181#(< main_~i~0 1023)} is VALID [2022-04-15 12:25:25,519 INFO L290 TraceCheckUtils]: 131: Hoare triple {118188#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118181#(< main_~i~0 1023)} is VALID [2022-04-15 12:25:25,519 INFO L290 TraceCheckUtils]: 130: Hoare triple {118188#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118188#(< main_~i~0 1022)} is VALID [2022-04-15 12:25:25,520 INFO L290 TraceCheckUtils]: 129: Hoare triple {118195#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118188#(< main_~i~0 1022)} is VALID [2022-04-15 12:25:25,520 INFO L290 TraceCheckUtils]: 128: Hoare triple {118195#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118195#(< main_~i~0 1021)} is VALID [2022-04-15 12:25:25,520 INFO L290 TraceCheckUtils]: 127: Hoare triple {118202#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118195#(< main_~i~0 1021)} is VALID [2022-04-15 12:25:25,520 INFO L290 TraceCheckUtils]: 126: Hoare triple {118202#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118202#(< main_~i~0 1020)} is VALID [2022-04-15 12:25:25,521 INFO L290 TraceCheckUtils]: 125: Hoare triple {118209#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118202#(< main_~i~0 1020)} is VALID [2022-04-15 12:25:25,521 INFO L290 TraceCheckUtils]: 124: Hoare triple {118209#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118209#(< main_~i~0 1019)} is VALID [2022-04-15 12:25:25,521 INFO L290 TraceCheckUtils]: 123: Hoare triple {118216#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118209#(< main_~i~0 1019)} is VALID [2022-04-15 12:25:25,521 INFO L290 TraceCheckUtils]: 122: Hoare triple {118216#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118216#(< main_~i~0 1018)} is VALID [2022-04-15 12:25:25,522 INFO L290 TraceCheckUtils]: 121: Hoare triple {118223#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118216#(< main_~i~0 1018)} is VALID [2022-04-15 12:25:25,522 INFO L290 TraceCheckUtils]: 120: Hoare triple {118223#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118223#(< main_~i~0 1017)} is VALID [2022-04-15 12:25:25,522 INFO L290 TraceCheckUtils]: 119: Hoare triple {118230#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118223#(< main_~i~0 1017)} is VALID [2022-04-15 12:25:25,523 INFO L290 TraceCheckUtils]: 118: Hoare triple {118230#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118230#(< main_~i~0 1016)} is VALID [2022-04-15 12:25:25,523 INFO L290 TraceCheckUtils]: 117: Hoare triple {118237#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118230#(< main_~i~0 1016)} is VALID [2022-04-15 12:25:25,523 INFO L290 TraceCheckUtils]: 116: Hoare triple {118237#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118237#(< main_~i~0 1015)} is VALID [2022-04-15 12:25:25,523 INFO L290 TraceCheckUtils]: 115: Hoare triple {118244#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118237#(< main_~i~0 1015)} is VALID [2022-04-15 12:25:25,524 INFO L290 TraceCheckUtils]: 114: Hoare triple {118244#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118244#(< main_~i~0 1014)} is VALID [2022-04-15 12:25:25,524 INFO L290 TraceCheckUtils]: 113: Hoare triple {118251#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118244#(< main_~i~0 1014)} is VALID [2022-04-15 12:25:25,524 INFO L290 TraceCheckUtils]: 112: Hoare triple {118251#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118251#(< main_~i~0 1013)} is VALID [2022-04-15 12:25:25,525 INFO L290 TraceCheckUtils]: 111: Hoare triple {118258#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118251#(< main_~i~0 1013)} is VALID [2022-04-15 12:25:25,525 INFO L290 TraceCheckUtils]: 110: Hoare triple {118258#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118258#(< main_~i~0 1012)} is VALID [2022-04-15 12:25:25,525 INFO L290 TraceCheckUtils]: 109: Hoare triple {118265#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118258#(< main_~i~0 1012)} is VALID [2022-04-15 12:25:25,525 INFO L290 TraceCheckUtils]: 108: Hoare triple {118265#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118265#(< main_~i~0 1011)} is VALID [2022-04-15 12:25:25,526 INFO L290 TraceCheckUtils]: 107: Hoare triple {118272#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118265#(< main_~i~0 1011)} is VALID [2022-04-15 12:25:25,526 INFO L290 TraceCheckUtils]: 106: Hoare triple {118272#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118272#(< main_~i~0 1010)} is VALID [2022-04-15 12:25:25,526 INFO L290 TraceCheckUtils]: 105: Hoare triple {118279#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118272#(< main_~i~0 1010)} is VALID [2022-04-15 12:25:25,527 INFO L290 TraceCheckUtils]: 104: Hoare triple {118279#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118279#(< main_~i~0 1009)} is VALID [2022-04-15 12:25:25,527 INFO L290 TraceCheckUtils]: 103: Hoare triple {118286#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118279#(< main_~i~0 1009)} is VALID [2022-04-15 12:25:25,527 INFO L290 TraceCheckUtils]: 102: Hoare triple {118286#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118286#(< main_~i~0 1008)} is VALID [2022-04-15 12:25:25,527 INFO L290 TraceCheckUtils]: 101: Hoare triple {118293#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118286#(< main_~i~0 1008)} is VALID [2022-04-15 12:25:25,528 INFO L290 TraceCheckUtils]: 100: Hoare triple {118293#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118293#(< main_~i~0 1007)} is VALID [2022-04-15 12:25:25,528 INFO L290 TraceCheckUtils]: 99: Hoare triple {118300#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118293#(< main_~i~0 1007)} is VALID [2022-04-15 12:25:25,528 INFO L290 TraceCheckUtils]: 98: Hoare triple {118300#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118300#(< main_~i~0 1006)} is VALID [2022-04-15 12:25:25,529 INFO L290 TraceCheckUtils]: 97: Hoare triple {118307#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118300#(< main_~i~0 1006)} is VALID [2022-04-15 12:25:25,529 INFO L290 TraceCheckUtils]: 96: Hoare triple {118307#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118307#(< main_~i~0 1005)} is VALID [2022-04-15 12:25:25,529 INFO L290 TraceCheckUtils]: 95: Hoare triple {118314#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118307#(< main_~i~0 1005)} is VALID [2022-04-15 12:25:25,529 INFO L290 TraceCheckUtils]: 94: Hoare triple {118314#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118314#(< main_~i~0 1004)} is VALID [2022-04-15 12:25:25,530 INFO L290 TraceCheckUtils]: 93: Hoare triple {118321#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118314#(< main_~i~0 1004)} is VALID [2022-04-15 12:25:25,530 INFO L290 TraceCheckUtils]: 92: Hoare triple {118321#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118321#(< main_~i~0 1003)} is VALID [2022-04-15 12:25:25,530 INFO L290 TraceCheckUtils]: 91: Hoare triple {118328#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118321#(< main_~i~0 1003)} is VALID [2022-04-15 12:25:25,530 INFO L290 TraceCheckUtils]: 90: Hoare triple {118328#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118328#(< main_~i~0 1002)} is VALID [2022-04-15 12:25:25,531 INFO L290 TraceCheckUtils]: 89: Hoare triple {118335#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118328#(< main_~i~0 1002)} is VALID [2022-04-15 12:25:25,531 INFO L290 TraceCheckUtils]: 88: Hoare triple {118335#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118335#(< main_~i~0 1001)} is VALID [2022-04-15 12:25:25,531 INFO L290 TraceCheckUtils]: 87: Hoare triple {118342#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118335#(< main_~i~0 1001)} is VALID [2022-04-15 12:25:25,532 INFO L290 TraceCheckUtils]: 86: Hoare triple {118342#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118342#(< main_~i~0 1000)} is VALID [2022-04-15 12:25:25,532 INFO L290 TraceCheckUtils]: 85: Hoare triple {118349#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118342#(< main_~i~0 1000)} is VALID [2022-04-15 12:25:25,532 INFO L290 TraceCheckUtils]: 84: Hoare triple {118349#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118349#(< main_~i~0 999)} is VALID [2022-04-15 12:25:25,532 INFO L290 TraceCheckUtils]: 83: Hoare triple {118356#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118349#(< main_~i~0 999)} is VALID [2022-04-15 12:25:25,533 INFO L290 TraceCheckUtils]: 82: Hoare triple {118356#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118356#(< main_~i~0 998)} is VALID [2022-04-15 12:25:25,533 INFO L290 TraceCheckUtils]: 81: Hoare triple {118363#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118356#(< main_~i~0 998)} is VALID [2022-04-15 12:25:25,533 INFO L290 TraceCheckUtils]: 80: Hoare triple {118363#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118363#(< main_~i~0 997)} is VALID [2022-04-15 12:25:25,534 INFO L290 TraceCheckUtils]: 79: Hoare triple {118370#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118363#(< main_~i~0 997)} is VALID [2022-04-15 12:25:25,534 INFO L290 TraceCheckUtils]: 78: Hoare triple {118370#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118370#(< main_~i~0 996)} is VALID [2022-04-15 12:25:25,534 INFO L290 TraceCheckUtils]: 77: Hoare triple {118377#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118370#(< main_~i~0 996)} is VALID [2022-04-15 12:25:25,534 INFO L290 TraceCheckUtils]: 76: Hoare triple {118377#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118377#(< main_~i~0 995)} is VALID [2022-04-15 12:25:25,535 INFO L290 TraceCheckUtils]: 75: Hoare triple {118384#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118377#(< main_~i~0 995)} is VALID [2022-04-15 12:25:25,535 INFO L290 TraceCheckUtils]: 74: Hoare triple {118384#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118384#(< main_~i~0 994)} is VALID [2022-04-15 12:25:25,535 INFO L290 TraceCheckUtils]: 73: Hoare triple {118391#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118384#(< main_~i~0 994)} is VALID [2022-04-15 12:25:25,536 INFO L290 TraceCheckUtils]: 72: Hoare triple {118391#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118391#(< main_~i~0 993)} is VALID [2022-04-15 12:25:25,536 INFO L290 TraceCheckUtils]: 71: Hoare triple {118398#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118391#(< main_~i~0 993)} is VALID [2022-04-15 12:25:25,536 INFO L290 TraceCheckUtils]: 70: Hoare triple {118398#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118398#(< main_~i~0 992)} is VALID [2022-04-15 12:25:25,536 INFO L290 TraceCheckUtils]: 69: Hoare triple {118405#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118398#(< main_~i~0 992)} is VALID [2022-04-15 12:25:25,537 INFO L290 TraceCheckUtils]: 68: Hoare triple {118405#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118405#(< main_~i~0 991)} is VALID [2022-04-15 12:25:25,537 INFO L290 TraceCheckUtils]: 67: Hoare triple {118412#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118405#(< main_~i~0 991)} is VALID [2022-04-15 12:25:25,537 INFO L290 TraceCheckUtils]: 66: Hoare triple {118412#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118412#(< main_~i~0 990)} is VALID [2022-04-15 12:25:25,538 INFO L290 TraceCheckUtils]: 65: Hoare triple {118419#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118412#(< main_~i~0 990)} is VALID [2022-04-15 12:25:25,538 INFO L290 TraceCheckUtils]: 64: Hoare triple {118419#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118419#(< main_~i~0 989)} is VALID [2022-04-15 12:25:25,538 INFO L290 TraceCheckUtils]: 63: Hoare triple {118426#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118419#(< main_~i~0 989)} is VALID [2022-04-15 12:25:25,538 INFO L290 TraceCheckUtils]: 62: Hoare triple {118426#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118426#(< main_~i~0 988)} is VALID [2022-04-15 12:25:25,539 INFO L290 TraceCheckUtils]: 61: Hoare triple {118433#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118426#(< main_~i~0 988)} is VALID [2022-04-15 12:25:25,539 INFO L290 TraceCheckUtils]: 60: Hoare triple {118433#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118433#(< main_~i~0 987)} is VALID [2022-04-15 12:25:25,539 INFO L290 TraceCheckUtils]: 59: Hoare triple {118440#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118433#(< main_~i~0 987)} is VALID [2022-04-15 12:25:25,539 INFO L290 TraceCheckUtils]: 58: Hoare triple {118440#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118440#(< main_~i~0 986)} is VALID [2022-04-15 12:25:25,540 INFO L290 TraceCheckUtils]: 57: Hoare triple {118447#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118440#(< main_~i~0 986)} is VALID [2022-04-15 12:25:25,540 INFO L290 TraceCheckUtils]: 56: Hoare triple {118447#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118447#(< main_~i~0 985)} is VALID [2022-04-15 12:25:25,540 INFO L290 TraceCheckUtils]: 55: Hoare triple {118454#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118447#(< main_~i~0 985)} is VALID [2022-04-15 12:25:25,541 INFO L290 TraceCheckUtils]: 54: Hoare triple {118454#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118454#(< main_~i~0 984)} is VALID [2022-04-15 12:25:25,541 INFO L290 TraceCheckUtils]: 53: Hoare triple {118461#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118454#(< main_~i~0 984)} is VALID [2022-04-15 12:25:25,541 INFO L290 TraceCheckUtils]: 52: Hoare triple {118461#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118461#(< main_~i~0 983)} is VALID [2022-04-15 12:25:25,541 INFO L290 TraceCheckUtils]: 51: Hoare triple {118468#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118461#(< main_~i~0 983)} is VALID [2022-04-15 12:25:25,542 INFO L290 TraceCheckUtils]: 50: Hoare triple {118468#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118468#(< main_~i~0 982)} is VALID [2022-04-15 12:25:25,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {118475#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118468#(< main_~i~0 982)} is VALID [2022-04-15 12:25:25,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {118475#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118475#(< main_~i~0 981)} is VALID [2022-04-15 12:25:25,543 INFO L290 TraceCheckUtils]: 47: Hoare triple {118482#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118475#(< main_~i~0 981)} is VALID [2022-04-15 12:25:25,543 INFO L290 TraceCheckUtils]: 46: Hoare triple {118482#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118482#(< main_~i~0 980)} is VALID [2022-04-15 12:25:25,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {118489#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118482#(< main_~i~0 980)} is VALID [2022-04-15 12:25:25,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {118489#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118489#(< main_~i~0 979)} is VALID [2022-04-15 12:25:25,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {118496#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118489#(< main_~i~0 979)} is VALID [2022-04-15 12:25:25,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {118496#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118496#(< main_~i~0 978)} is VALID [2022-04-15 12:25:25,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {118503#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118496#(< main_~i~0 978)} is VALID [2022-04-15 12:25:25,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {118503#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118503#(< main_~i~0 977)} is VALID [2022-04-15 12:25:25,545 INFO L290 TraceCheckUtils]: 39: Hoare triple {118510#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118503#(< main_~i~0 977)} is VALID [2022-04-15 12:25:25,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {118510#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118510#(< main_~i~0 976)} is VALID [2022-04-15 12:25:25,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {118517#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118510#(< main_~i~0 976)} is VALID [2022-04-15 12:25:25,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {118517#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118517#(< main_~i~0 975)} is VALID [2022-04-15 12:25:25,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {118524#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118517#(< main_~i~0 975)} is VALID [2022-04-15 12:25:25,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {118524#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118524#(< main_~i~0 974)} is VALID [2022-04-15 12:25:25,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {118531#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118524#(< main_~i~0 974)} is VALID [2022-04-15 12:25:25,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {118531#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118531#(< main_~i~0 973)} is VALID [2022-04-15 12:25:25,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {118538#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118531#(< main_~i~0 973)} is VALID [2022-04-15 12:25:25,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {118538#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118538#(< main_~i~0 972)} is VALID [2022-04-15 12:25:25,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {118545#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118538#(< main_~i~0 972)} is VALID [2022-04-15 12:25:25,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {118545#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118545#(< main_~i~0 971)} is VALID [2022-04-15 12:25:25,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {118552#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118545#(< main_~i~0 971)} is VALID [2022-04-15 12:25:25,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {118552#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118552#(< main_~i~0 970)} is VALID [2022-04-15 12:25:25,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {118559#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118552#(< main_~i~0 970)} is VALID [2022-04-15 12:25:25,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {118559#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118559#(< main_~i~0 969)} is VALID [2022-04-15 12:25:25,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {118566#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118559#(< main_~i~0 969)} is VALID [2022-04-15 12:25:25,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {118566#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118566#(< main_~i~0 968)} is VALID [2022-04-15 12:25:25,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {118573#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118566#(< main_~i~0 968)} is VALID [2022-04-15 12:25:25,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {118573#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118573#(< main_~i~0 967)} is VALID [2022-04-15 12:25:25,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {118580#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118573#(< main_~i~0 967)} is VALID [2022-04-15 12:25:25,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {118580#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118580#(< main_~i~0 966)} is VALID [2022-04-15 12:25:25,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {118587#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118580#(< main_~i~0 966)} is VALID [2022-04-15 12:25:25,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {118587#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118587#(< main_~i~0 965)} is VALID [2022-04-15 12:25:25,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {118594#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118587#(< main_~i~0 965)} is VALID [2022-04-15 12:25:25,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {118594#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118594#(< main_~i~0 964)} is VALID [2022-04-15 12:25:25,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {118601#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118594#(< main_~i~0 964)} is VALID [2022-04-15 12:25:25,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {118601#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118601#(< main_~i~0 963)} is VALID [2022-04-15 12:25:25,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {118608#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118601#(< main_~i~0 963)} is VALID [2022-04-15 12:25:25,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {118608#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118608#(< main_~i~0 962)} is VALID [2022-04-15 12:25:25,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {118615#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118608#(< main_~i~0 962)} is VALID [2022-04-15 12:25:25,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {118615#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118615#(< main_~i~0 961)} is VALID [2022-04-15 12:25:25,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {118622#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118615#(< main_~i~0 961)} is VALID [2022-04-15 12:25:25,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {118622#(< main_~i~0 960)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118622#(< main_~i~0 960)} is VALID [2022-04-15 12:25:25,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {117604#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {118622#(< main_~i~0 960)} is VALID [2022-04-15 12:25:25,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {117604#true} call #t~ret6 := main(); {117604#true} is VALID [2022-04-15 12:25:25,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117604#true} {117604#true} #64#return; {117604#true} is VALID [2022-04-15 12:25:25,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {117604#true} assume true; {117604#true} is VALID [2022-04-15 12:25:25,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {117604#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {117604#true} is VALID [2022-04-15 12:25:25,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {117604#true} call ULTIMATE.init(); {117604#true} is VALID [2022-04-15 12:25:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4106 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:25:25,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995573968] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:25:25,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:25:25,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67, 67] total 134 [2022-04-15 12:25:25,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:25:25,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [461108638] [2022-04-15 12:25:25,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [461108638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:25:25,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:25:25,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-15 12:25:25,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103081103] [2022-04-15 12:25:25,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:25:25,556 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2022-04-15 12:25:25,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:25:25,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:25,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:25,638 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-15 12:25:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:25,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-15 12:25:25,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8780, Invalid=9042, Unknown=0, NotChecked=0, Total=17822 [2022-04-15 12:25:25,640 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:43,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:43,249 INFO L93 Difference]: Finished difference Result 488 states and 622 transitions. [2022-04-15 12:25:43,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-15 12:25:43,249 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2022-04-15 12:25:43,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:25:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 613 transitions. [2022-04-15 12:25:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 613 transitions. [2022-04-15 12:25:43,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 613 transitions. [2022-04-15 12:25:43,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 613 edges. 613 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:43,650 INFO L225 Difference]: With dead ends: 488 [2022-04-15 12:25:43,650 INFO L226 Difference]: Without dead ends: 471 [2022-04-15 12:25:43,652 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2463 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=17426, Invalid=21976, Unknown=0, NotChecked=0, Total=39402 [2022-04-15 12:25:43,652 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1630 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1630 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:25:43,653 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1630 Valid, 32 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:25:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-04-15 12:25:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 154. [2022-04-15 12:25:44,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:25:44,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 471 states. Second operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:44,688 INFO L74 IsIncluded]: Start isIncluded. First operand 471 states. Second operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:44,688 INFO L87 Difference]: Start difference. First operand 471 states. Second operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:44,695 INFO L93 Difference]: Finished difference Result 471 states and 601 transitions. [2022-04-15 12:25:44,695 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 601 transitions. [2022-04-15 12:25:44,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:44,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:44,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 471 states. [2022-04-15 12:25:44,696 INFO L87 Difference]: Start difference. First operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 471 states. [2022-04-15 12:25:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:44,704 INFO L93 Difference]: Finished difference Result 471 states and 601 transitions. [2022-04-15 12:25:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 601 transitions. [2022-04-15 12:25:44,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:44,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:44,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:25:44,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:25:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2022-04-15 12:25:44,706 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 151 [2022-04-15 12:25:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:25:44,706 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2022-04-15 12:25:44,706 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:44,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 154 states and 158 transitions. [2022-04-15 12:25:45,149 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:25:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2022-04-15 12:25:45,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-15 12:25:45,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:25:45,150 INFO L499 BasicCegarLoop]: trace histogram [65, 65, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:25:45,169 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:25:45,350 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:25:45,351 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:25:45,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:25:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash -980276517, now seen corresponding path program 131 times [2022-04-15 12:25:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:45,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1707832327] [2022-04-15 12:25:45,355 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:25:45,355 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:25:45,355 INFO L85 PathProgramCache]: Analyzing trace with hash -980276517, now seen corresponding path program 132 times [2022-04-15 12:25:45,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:25:45,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495280677] [2022-04-15 12:25:45,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:25:45,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:25:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:46,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:25:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:46,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {121073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {121002#true} is VALID [2022-04-15 12:25:46,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {121002#true} assume true; {121002#true} is VALID [2022-04-15 12:25:46,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121002#true} {121002#true} #64#return; {121002#true} is VALID [2022-04-15 12:25:46,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {121002#true} call ULTIMATE.init(); {121073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:25:46,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {121073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {121002#true} is VALID [2022-04-15 12:25:46,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {121002#true} assume true; {121002#true} is VALID [2022-04-15 12:25:46,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121002#true} {121002#true} #64#return; {121002#true} is VALID [2022-04-15 12:25:46,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {121002#true} call #t~ret6 := main(); {121002#true} is VALID [2022-04-15 12:25:46,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {121002#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {121007#(= main_~i~0 0)} is VALID [2022-04-15 12:25:46,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {121007#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121007#(= main_~i~0 0)} is VALID [2022-04-15 12:25:46,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {121007#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121008#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:46,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {121008#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121008#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:46,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {121008#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121009#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:46,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {121009#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121009#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:46,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {121009#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121010#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:46,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {121010#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121010#(<= main_~i~0 3)} is VALID [2022-04-15 12:25:46,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {121010#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121011#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:46,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {121011#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121011#(<= main_~i~0 4)} is VALID [2022-04-15 12:25:46,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {121011#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121012#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:46,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {121012#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121012#(<= main_~i~0 5)} is VALID [2022-04-15 12:25:46,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {121012#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121013#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:46,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {121013#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121013#(<= main_~i~0 6)} is VALID [2022-04-15 12:25:46,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {121013#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121014#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:46,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {121014#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121014#(<= main_~i~0 7)} is VALID [2022-04-15 12:25:46,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {121014#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121015#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:46,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {121015#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121015#(<= main_~i~0 8)} is VALID [2022-04-15 12:25:46,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {121015#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121016#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:46,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {121016#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121016#(<= main_~i~0 9)} is VALID [2022-04-15 12:25:46,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {121016#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121017#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:46,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {121017#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121017#(<= main_~i~0 10)} is VALID [2022-04-15 12:25:46,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {121017#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121018#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:46,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {121018#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121018#(<= main_~i~0 11)} is VALID [2022-04-15 12:25:46,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {121018#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121019#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:46,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {121019#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121019#(<= main_~i~0 12)} is VALID [2022-04-15 12:25:46,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {121019#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121020#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:46,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {121020#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121020#(<= main_~i~0 13)} is VALID [2022-04-15 12:25:46,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {121020#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121021#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:46,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {121021#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121021#(<= main_~i~0 14)} is VALID [2022-04-15 12:25:46,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {121021#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121022#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:46,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {121022#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121022#(<= main_~i~0 15)} is VALID [2022-04-15 12:25:46,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {121022#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121023#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:46,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {121023#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121023#(<= main_~i~0 16)} is VALID [2022-04-15 12:25:46,745 INFO L290 TraceCheckUtils]: 39: Hoare triple {121023#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121024#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:46,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {121024#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121024#(<= main_~i~0 17)} is VALID [2022-04-15 12:25:46,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {121024#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121025#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:46,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {121025#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121025#(<= main_~i~0 18)} is VALID [2022-04-15 12:25:46,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {121025#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121026#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:46,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {121026#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121026#(<= main_~i~0 19)} is VALID [2022-04-15 12:25:46,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {121026#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121027#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:46,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {121027#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121027#(<= main_~i~0 20)} is VALID [2022-04-15 12:25:46,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {121027#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121028#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:46,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {121028#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121028#(<= main_~i~0 21)} is VALID [2022-04-15 12:25:46,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {121028#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121029#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:46,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {121029#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121029#(<= main_~i~0 22)} is VALID [2022-04-15 12:25:46,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {121029#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121030#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:46,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {121030#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121030#(<= main_~i~0 23)} is VALID [2022-04-15 12:25:46,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {121030#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121031#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:46,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {121031#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121031#(<= main_~i~0 24)} is VALID [2022-04-15 12:25:46,750 INFO L290 TraceCheckUtils]: 55: Hoare triple {121031#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121032#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:46,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {121032#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121032#(<= main_~i~0 25)} is VALID [2022-04-15 12:25:46,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {121032#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121033#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:46,750 INFO L290 TraceCheckUtils]: 58: Hoare triple {121033#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121033#(<= main_~i~0 26)} is VALID [2022-04-15 12:25:46,751 INFO L290 TraceCheckUtils]: 59: Hoare triple {121033#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121034#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:46,751 INFO L290 TraceCheckUtils]: 60: Hoare triple {121034#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121034#(<= main_~i~0 27)} is VALID [2022-04-15 12:25:46,751 INFO L290 TraceCheckUtils]: 61: Hoare triple {121034#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121035#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:46,751 INFO L290 TraceCheckUtils]: 62: Hoare triple {121035#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121035#(<= main_~i~0 28)} is VALID [2022-04-15 12:25:46,752 INFO L290 TraceCheckUtils]: 63: Hoare triple {121035#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121036#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:46,752 INFO L290 TraceCheckUtils]: 64: Hoare triple {121036#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121036#(<= main_~i~0 29)} is VALID [2022-04-15 12:25:46,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {121036#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121037#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:46,753 INFO L290 TraceCheckUtils]: 66: Hoare triple {121037#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121037#(<= main_~i~0 30)} is VALID [2022-04-15 12:25:46,753 INFO L290 TraceCheckUtils]: 67: Hoare triple {121037#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121038#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:46,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {121038#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121038#(<= main_~i~0 31)} is VALID [2022-04-15 12:25:46,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {121038#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121039#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:46,754 INFO L290 TraceCheckUtils]: 70: Hoare triple {121039#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121039#(<= main_~i~0 32)} is VALID [2022-04-15 12:25:46,754 INFO L290 TraceCheckUtils]: 71: Hoare triple {121039#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121040#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:46,754 INFO L290 TraceCheckUtils]: 72: Hoare triple {121040#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121040#(<= main_~i~0 33)} is VALID [2022-04-15 12:25:46,755 INFO L290 TraceCheckUtils]: 73: Hoare triple {121040#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121041#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:46,755 INFO L290 TraceCheckUtils]: 74: Hoare triple {121041#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121041#(<= main_~i~0 34)} is VALID [2022-04-15 12:25:46,755 INFO L290 TraceCheckUtils]: 75: Hoare triple {121041#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121042#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:46,755 INFO L290 TraceCheckUtils]: 76: Hoare triple {121042#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121042#(<= main_~i~0 35)} is VALID [2022-04-15 12:25:46,756 INFO L290 TraceCheckUtils]: 77: Hoare triple {121042#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121043#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:46,756 INFO L290 TraceCheckUtils]: 78: Hoare triple {121043#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121043#(<= main_~i~0 36)} is VALID [2022-04-15 12:25:46,756 INFO L290 TraceCheckUtils]: 79: Hoare triple {121043#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121044#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:46,756 INFO L290 TraceCheckUtils]: 80: Hoare triple {121044#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121044#(<= main_~i~0 37)} is VALID [2022-04-15 12:25:46,757 INFO L290 TraceCheckUtils]: 81: Hoare triple {121044#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121045#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:46,757 INFO L290 TraceCheckUtils]: 82: Hoare triple {121045#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121045#(<= main_~i~0 38)} is VALID [2022-04-15 12:25:46,757 INFO L290 TraceCheckUtils]: 83: Hoare triple {121045#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121046#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:46,757 INFO L290 TraceCheckUtils]: 84: Hoare triple {121046#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121046#(<= main_~i~0 39)} is VALID [2022-04-15 12:25:46,758 INFO L290 TraceCheckUtils]: 85: Hoare triple {121046#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121047#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:46,758 INFO L290 TraceCheckUtils]: 86: Hoare triple {121047#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121047#(<= main_~i~0 40)} is VALID [2022-04-15 12:25:46,758 INFO L290 TraceCheckUtils]: 87: Hoare triple {121047#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121048#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:46,759 INFO L290 TraceCheckUtils]: 88: Hoare triple {121048#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121048#(<= main_~i~0 41)} is VALID [2022-04-15 12:25:46,759 INFO L290 TraceCheckUtils]: 89: Hoare triple {121048#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121049#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:46,759 INFO L290 TraceCheckUtils]: 90: Hoare triple {121049#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121049#(<= main_~i~0 42)} is VALID [2022-04-15 12:25:46,759 INFO L290 TraceCheckUtils]: 91: Hoare triple {121049#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121050#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:46,760 INFO L290 TraceCheckUtils]: 92: Hoare triple {121050#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121050#(<= main_~i~0 43)} is VALID [2022-04-15 12:25:46,760 INFO L290 TraceCheckUtils]: 93: Hoare triple {121050#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121051#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:46,760 INFO L290 TraceCheckUtils]: 94: Hoare triple {121051#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121051#(<= main_~i~0 44)} is VALID [2022-04-15 12:25:46,760 INFO L290 TraceCheckUtils]: 95: Hoare triple {121051#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121052#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:46,761 INFO L290 TraceCheckUtils]: 96: Hoare triple {121052#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121052#(<= main_~i~0 45)} is VALID [2022-04-15 12:25:46,761 INFO L290 TraceCheckUtils]: 97: Hoare triple {121052#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121053#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:46,761 INFO L290 TraceCheckUtils]: 98: Hoare triple {121053#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121053#(<= main_~i~0 46)} is VALID [2022-04-15 12:25:46,762 INFO L290 TraceCheckUtils]: 99: Hoare triple {121053#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121054#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:46,762 INFO L290 TraceCheckUtils]: 100: Hoare triple {121054#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121054#(<= main_~i~0 47)} is VALID [2022-04-15 12:25:46,762 INFO L290 TraceCheckUtils]: 101: Hoare triple {121054#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121055#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:46,762 INFO L290 TraceCheckUtils]: 102: Hoare triple {121055#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121055#(<= main_~i~0 48)} is VALID [2022-04-15 12:25:46,763 INFO L290 TraceCheckUtils]: 103: Hoare triple {121055#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121056#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:46,763 INFO L290 TraceCheckUtils]: 104: Hoare triple {121056#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121056#(<= main_~i~0 49)} is VALID [2022-04-15 12:25:46,763 INFO L290 TraceCheckUtils]: 105: Hoare triple {121056#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121057#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:46,763 INFO L290 TraceCheckUtils]: 106: Hoare triple {121057#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121057#(<= main_~i~0 50)} is VALID [2022-04-15 12:25:46,764 INFO L290 TraceCheckUtils]: 107: Hoare triple {121057#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121058#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:46,764 INFO L290 TraceCheckUtils]: 108: Hoare triple {121058#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121058#(<= main_~i~0 51)} is VALID [2022-04-15 12:25:46,764 INFO L290 TraceCheckUtils]: 109: Hoare triple {121058#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121059#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:46,765 INFO L290 TraceCheckUtils]: 110: Hoare triple {121059#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121059#(<= main_~i~0 52)} is VALID [2022-04-15 12:25:46,765 INFO L290 TraceCheckUtils]: 111: Hoare triple {121059#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121060#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:46,765 INFO L290 TraceCheckUtils]: 112: Hoare triple {121060#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121060#(<= main_~i~0 53)} is VALID [2022-04-15 12:25:46,765 INFO L290 TraceCheckUtils]: 113: Hoare triple {121060#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121061#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:46,766 INFO L290 TraceCheckUtils]: 114: Hoare triple {121061#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121061#(<= main_~i~0 54)} is VALID [2022-04-15 12:25:46,766 INFO L290 TraceCheckUtils]: 115: Hoare triple {121061#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121062#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:46,766 INFO L290 TraceCheckUtils]: 116: Hoare triple {121062#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121062#(<= main_~i~0 55)} is VALID [2022-04-15 12:25:46,766 INFO L290 TraceCheckUtils]: 117: Hoare triple {121062#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121063#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:46,767 INFO L290 TraceCheckUtils]: 118: Hoare triple {121063#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121063#(<= main_~i~0 56)} is VALID [2022-04-15 12:25:46,767 INFO L290 TraceCheckUtils]: 119: Hoare triple {121063#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121064#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:46,767 INFO L290 TraceCheckUtils]: 120: Hoare triple {121064#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121064#(<= main_~i~0 57)} is VALID [2022-04-15 12:25:46,768 INFO L290 TraceCheckUtils]: 121: Hoare triple {121064#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121065#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:46,768 INFO L290 TraceCheckUtils]: 122: Hoare triple {121065#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121065#(<= main_~i~0 58)} is VALID [2022-04-15 12:25:46,768 INFO L290 TraceCheckUtils]: 123: Hoare triple {121065#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121066#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:46,768 INFO L290 TraceCheckUtils]: 124: Hoare triple {121066#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121066#(<= main_~i~0 59)} is VALID [2022-04-15 12:25:46,769 INFO L290 TraceCheckUtils]: 125: Hoare triple {121066#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121067#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:46,769 INFO L290 TraceCheckUtils]: 126: Hoare triple {121067#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121067#(<= main_~i~0 60)} is VALID [2022-04-15 12:25:46,769 INFO L290 TraceCheckUtils]: 127: Hoare triple {121067#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121068#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:46,769 INFO L290 TraceCheckUtils]: 128: Hoare triple {121068#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121068#(<= main_~i~0 61)} is VALID [2022-04-15 12:25:46,770 INFO L290 TraceCheckUtils]: 129: Hoare triple {121068#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121069#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:46,770 INFO L290 TraceCheckUtils]: 130: Hoare triple {121069#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121069#(<= main_~i~0 62)} is VALID [2022-04-15 12:25:46,770 INFO L290 TraceCheckUtils]: 131: Hoare triple {121069#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121070#(<= main_~i~0 63)} is VALID [2022-04-15 12:25:46,771 INFO L290 TraceCheckUtils]: 132: Hoare triple {121070#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121070#(<= main_~i~0 63)} is VALID [2022-04-15 12:25:46,771 INFO L290 TraceCheckUtils]: 133: Hoare triple {121070#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121071#(<= main_~i~0 64)} is VALID [2022-04-15 12:25:46,771 INFO L290 TraceCheckUtils]: 134: Hoare triple {121071#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121071#(<= main_~i~0 64)} is VALID [2022-04-15 12:25:46,771 INFO L290 TraceCheckUtils]: 135: Hoare triple {121071#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121072#(<= main_~i~0 65)} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 136: Hoare triple {121072#(<= main_~i~0 65)} assume !(~i~0 < 1024); {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 137: Hoare triple {121003#false} ~i~0 := 0; {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 138: Hoare triple {121003#false} #t~short5 := ~i~0 < 1024; {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 139: Hoare triple {121003#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 140: Hoare triple {121003#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 141: Hoare triple {121003#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 142: Hoare triple {121003#false} #t~short5 := ~i~0 < 1024; {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 143: Hoare triple {121003#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 144: Hoare triple {121003#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 145: Hoare triple {121003#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 146: Hoare triple {121003#false} #t~short5 := ~i~0 < 1024; {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 147: Hoare triple {121003#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 148: Hoare triple {121003#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L272 TraceCheckUtils]: 149: Hoare triple {121003#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 150: Hoare triple {121003#false} ~cond := #in~cond; {121003#false} is VALID [2022-04-15 12:25:46,772 INFO L290 TraceCheckUtils]: 151: Hoare triple {121003#false} assume 0 == ~cond; {121003#false} is VALID [2022-04-15 12:25:46,773 INFO L290 TraceCheckUtils]: 152: Hoare triple {121003#false} assume !false; {121003#false} is VALID [2022-04-15 12:25:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:25:46,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:25:46,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495280677] [2022-04-15 12:25:46,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495280677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:25:46,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755743152] [2022-04-15 12:25:46,773 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:25:46,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:25:46,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:25:46,774 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:25:46,777 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:25:47,159 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:25:47,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:25:47,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:25:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:47,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:25:47,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {121002#true} call ULTIMATE.init(); {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {121002#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {121002#true} assume true; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121002#true} {121002#true} #64#return; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {121002#true} call #t~ret6 := main(); {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {121002#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 35: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 46: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 47: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 49: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 50: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 51: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 52: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 53: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 54: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 55: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 56: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 59: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,468 INFO L290 TraceCheckUtils]: 60: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 61: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 62: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 63: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 64: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 65: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 66: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 67: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 68: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 69: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 70: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 71: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 72: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 73: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 74: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 75: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 76: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 77: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 78: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 79: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 80: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,469 INFO L290 TraceCheckUtils]: 81: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 82: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 83: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 84: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 85: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 86: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 87: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 88: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 89: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 90: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 91: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 92: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 93: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 94: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 95: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 96: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 97: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 98: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 99: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 100: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,470 INFO L290 TraceCheckUtils]: 101: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 102: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 103: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 104: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 105: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 106: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 107: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 108: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 109: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 110: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 111: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 112: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 113: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 114: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 115: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 116: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 117: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 118: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 119: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 120: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,471 INFO L290 TraceCheckUtils]: 121: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 122: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 123: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 124: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 125: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 126: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 127: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 128: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 129: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 130: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 131: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 132: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 133: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 134: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 135: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,472 INFO L290 TraceCheckUtils]: 136: Hoare triple {121002#true} assume !(~i~0 < 1024); {121002#true} is VALID [2022-04-15 12:25:47,473 INFO L290 TraceCheckUtils]: 137: Hoare triple {121002#true} ~i~0 := 0; {121488#(<= main_~i~0 0)} is VALID [2022-04-15 12:25:47,473 INFO L290 TraceCheckUtils]: 138: Hoare triple {121488#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {121488#(<= main_~i~0 0)} is VALID [2022-04-15 12:25:47,473 INFO L290 TraceCheckUtils]: 139: Hoare triple {121488#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121488#(<= main_~i~0 0)} is VALID [2022-04-15 12:25:47,473 INFO L290 TraceCheckUtils]: 140: Hoare triple {121488#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121488#(<= main_~i~0 0)} is VALID [2022-04-15 12:25:47,474 INFO L290 TraceCheckUtils]: 141: Hoare triple {121488#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121008#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:47,474 INFO L290 TraceCheckUtils]: 142: Hoare triple {121008#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {121008#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:47,474 INFO L290 TraceCheckUtils]: 143: Hoare triple {121008#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121008#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:47,474 INFO L290 TraceCheckUtils]: 144: Hoare triple {121008#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121008#(<= main_~i~0 1)} is VALID [2022-04-15 12:25:47,475 INFO L290 TraceCheckUtils]: 145: Hoare triple {121008#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121009#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:47,475 INFO L290 TraceCheckUtils]: 146: Hoare triple {121009#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {121009#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:47,475 INFO L290 TraceCheckUtils]: 147: Hoare triple {121009#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121009#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:47,475 INFO L290 TraceCheckUtils]: 148: Hoare triple {121009#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {121009#(<= main_~i~0 2)} is VALID [2022-04-15 12:25:47,476 INFO L272 TraceCheckUtils]: 149: Hoare triple {121009#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {121525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:25:47,476 INFO L290 TraceCheckUtils]: 150: Hoare triple {121525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {121529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:25:47,476 INFO L290 TraceCheckUtils]: 151: Hoare triple {121529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {121003#false} is VALID [2022-04-15 12:25:47,476 INFO L290 TraceCheckUtils]: 152: Hoare triple {121003#false} assume !false; {121003#false} is VALID [2022-04-15 12:25:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2022-04-15 12:25:47,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:25:47,821 INFO L290 TraceCheckUtils]: 152: Hoare triple {121003#false} assume !false; {121003#false} is VALID [2022-04-15 12:25:47,822 INFO L290 TraceCheckUtils]: 151: Hoare triple {121529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {121003#false} is VALID [2022-04-15 12:25:47,822 INFO L290 TraceCheckUtils]: 150: Hoare triple {121525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {121529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:25:47,823 INFO L272 TraceCheckUtils]: 149: Hoare triple {121545#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {121525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:25:47,823 INFO L290 TraceCheckUtils]: 148: Hoare triple {121545#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {121545#(<= main_~i~0 512)} is VALID [2022-04-15 12:25:47,823 INFO L290 TraceCheckUtils]: 147: Hoare triple {121545#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121545#(<= main_~i~0 512)} is VALID [2022-04-15 12:25:47,823 INFO L290 TraceCheckUtils]: 146: Hoare triple {121545#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {121545#(<= main_~i~0 512)} is VALID [2022-04-15 12:25:47,824 INFO L290 TraceCheckUtils]: 145: Hoare triple {121558#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121545#(<= main_~i~0 512)} is VALID [2022-04-15 12:25:47,824 INFO L290 TraceCheckUtils]: 144: Hoare triple {121558#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121558#(<= main_~i~0 511)} is VALID [2022-04-15 12:25:47,824 INFO L290 TraceCheckUtils]: 143: Hoare triple {121558#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121558#(<= main_~i~0 511)} is VALID [2022-04-15 12:25:47,824 INFO L290 TraceCheckUtils]: 142: Hoare triple {121558#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {121558#(<= main_~i~0 511)} is VALID [2022-04-15 12:25:47,825 INFO L290 TraceCheckUtils]: 141: Hoare triple {121571#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121558#(<= main_~i~0 511)} is VALID [2022-04-15 12:25:47,825 INFO L290 TraceCheckUtils]: 140: Hoare triple {121571#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121571#(<= main_~i~0 510)} is VALID [2022-04-15 12:25:47,825 INFO L290 TraceCheckUtils]: 139: Hoare triple {121571#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121571#(<= main_~i~0 510)} is VALID [2022-04-15 12:25:47,825 INFO L290 TraceCheckUtils]: 138: Hoare triple {121571#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {121571#(<= main_~i~0 510)} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 137: Hoare triple {121002#true} ~i~0 := 0; {121571#(<= main_~i~0 510)} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 136: Hoare triple {121002#true} assume !(~i~0 < 1024); {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 135: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 134: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 133: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 132: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 131: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 130: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 129: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 128: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 127: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 126: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 125: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 124: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 123: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 122: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 121: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,826 INFO L290 TraceCheckUtils]: 120: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 119: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 118: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 117: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 116: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 115: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 114: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 113: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 112: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 111: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 110: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 109: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 108: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 107: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 106: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 105: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 104: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 103: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 102: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 101: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,827 INFO L290 TraceCheckUtils]: 100: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 99: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 98: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 97: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 96: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 95: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 94: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 93: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 92: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 91: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 90: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 89: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 88: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 87: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 86: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 85: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 84: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 83: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 82: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 81: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 80: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,828 INFO L290 TraceCheckUtils]: 79: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 78: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 77: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 76: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 75: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 74: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 73: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 72: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 71: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 70: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 69: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 68: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 67: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 66: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 65: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 64: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 63: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 62: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 61: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 60: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,829 INFO L290 TraceCheckUtils]: 59: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 58: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 57: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 56: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 55: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 54: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 53: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 51: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 50: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 49: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 48: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 47: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 46: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 45: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 44: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 42: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 41: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 40: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 38: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 33: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 12:25:47,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 12:25:47,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {121002#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {121002#true} is VALID [2022-04-15 12:25:47,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {121002#true} call #t~ret6 := main(); {121002#true} is VALID [2022-04-15 12:25:47,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121002#true} {121002#true} #64#return; {121002#true} is VALID [2022-04-15 12:25:47,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {121002#true} assume true; {121002#true} is VALID [2022-04-15 12:25:47,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {121002#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {121002#true} is VALID [2022-04-15 12:25:47,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {121002#true} call ULTIMATE.init(); {121002#true} is VALID [2022-04-15 12:25:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2022-04-15 12:25:47,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755743152] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:25:47,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:25:47,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 7, 7] total 75 [2022-04-15 12:25:47,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:25:47,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1707832327] [2022-04-15 12:25:47,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1707832327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:25:47,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:25:47,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-15 12:25:47,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116525588] [2022-04-15 12:25:47,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:25:47,834 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-15 12:25:47,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:25:47,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:47,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:47,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-15 12:25:47,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:47,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-15 12:25:47,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2562, Invalid=2988, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 12:25:47,921 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:05,822 INFO L93 Difference]: Finished difference Result 495 states and 631 transitions. [2022-04-15 12:26:05,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-15 12:26:05,823 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-15 12:26:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:26:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 622 transitions. [2022-04-15 12:26:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 622 transitions. [2022-04-15 12:26:05,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 622 transitions. [2022-04-15 12:26:06,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 622 edges. 622 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:26:06,228 INFO L225 Difference]: With dead ends: 495 [2022-04-15 12:26:06,228 INFO L226 Difference]: Without dead ends: 478 [2022-04-15 12:26:06,229 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=7315, Invalid=12425, Unknown=0, NotChecked=0, Total=19740 [2022-04-15 12:26:06,229 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1808 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1808 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:26:06,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1808 Valid, 32 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:26:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-04-15 12:26:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 156. [2022-04-15 12:26:07,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:26:07,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 478 states. Second operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:07,284 INFO L74 IsIncluded]: Start isIncluded. First operand 478 states. Second operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:07,284 INFO L87 Difference]: Start difference. First operand 478 states. Second operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:07,291 INFO L93 Difference]: Finished difference Result 478 states and 610 transitions. [2022-04-15 12:26:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 610 transitions. [2022-04-15 12:26:07,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:26:07,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:26:07,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 478 states. [2022-04-15 12:26:07,292 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 478 states. [2022-04-15 12:26:07,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:07,300 INFO L93 Difference]: Finished difference Result 478 states and 610 transitions. [2022-04-15 12:26:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 610 transitions. [2022-04-15 12:26:07,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:26:07,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:26:07,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:26:07,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:26:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:07,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2022-04-15 12:26:07,302 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 153 [2022-04-15 12:26:07,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:26:07,302 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2022-04-15 12:26:07,302 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:07,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 160 transitions. [2022-04-15 12:26:07,747 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:26:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2022-04-15 12:26:07,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-15 12:26:07,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:26:07,748 INFO L499 BasicCegarLoop]: trace histogram [66, 66, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:26:07,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2022-04-15 12:26:07,949 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:07,949 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:26:07,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:26:07,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2062846087, now seen corresponding path program 133 times [2022-04-15 12:26:07,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:26:07,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [172002764] [2022-04-15 12:26:07,953 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:26:07,953 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:26:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2062846087, now seen corresponding path program 134 times [2022-04-15 12:26:07,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:26:07,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958338732] [2022-04-15 12:26:07,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:26:07,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:26:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:09,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:26:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:09,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {124459#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {124387#true} is VALID [2022-04-15 12:26:09,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {124387#true} assume true; {124387#true} is VALID [2022-04-15 12:26:09,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124387#true} {124387#true} #64#return; {124387#true} is VALID [2022-04-15 12:26:09,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {124387#true} call ULTIMATE.init(); {124459#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:26:09,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {124459#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {124387#true} is VALID [2022-04-15 12:26:09,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {124387#true} assume true; {124387#true} is VALID [2022-04-15 12:26:09,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124387#true} {124387#true} #64#return; {124387#true} is VALID [2022-04-15 12:26:09,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {124387#true} call #t~ret6 := main(); {124387#true} is VALID [2022-04-15 12:26:09,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {124387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {124392#(= main_~i~0 0)} is VALID [2022-04-15 12:26:09,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {124392#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124392#(= main_~i~0 0)} is VALID [2022-04-15 12:26:09,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {124392#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124393#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:09,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {124393#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124393#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:09,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {124393#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124394#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:09,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {124394#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124394#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:09,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {124394#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124395#(<= main_~i~0 3)} is VALID [2022-04-15 12:26:09,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {124395#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124395#(<= main_~i~0 3)} is VALID [2022-04-15 12:26:09,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {124395#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124396#(<= main_~i~0 4)} is VALID [2022-04-15 12:26:09,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {124396#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124396#(<= main_~i~0 4)} is VALID [2022-04-15 12:26:09,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {124396#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124397#(<= main_~i~0 5)} is VALID [2022-04-15 12:26:09,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {124397#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124397#(<= main_~i~0 5)} is VALID [2022-04-15 12:26:09,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {124397#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124398#(<= main_~i~0 6)} is VALID [2022-04-15 12:26:09,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {124398#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124398#(<= main_~i~0 6)} is VALID [2022-04-15 12:26:09,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {124398#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124399#(<= main_~i~0 7)} is VALID [2022-04-15 12:26:09,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {124399#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124399#(<= main_~i~0 7)} is VALID [2022-04-15 12:26:09,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {124399#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124400#(<= main_~i~0 8)} is VALID [2022-04-15 12:26:09,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {124400#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124400#(<= main_~i~0 8)} is VALID [2022-04-15 12:26:09,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {124400#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124401#(<= main_~i~0 9)} is VALID [2022-04-15 12:26:09,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {124401#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124401#(<= main_~i~0 9)} is VALID [2022-04-15 12:26:09,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {124401#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124402#(<= main_~i~0 10)} is VALID [2022-04-15 12:26:09,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {124402#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124402#(<= main_~i~0 10)} is VALID [2022-04-15 12:26:09,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {124402#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124403#(<= main_~i~0 11)} is VALID [2022-04-15 12:26:09,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {124403#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124403#(<= main_~i~0 11)} is VALID [2022-04-15 12:26:09,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {124403#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124404#(<= main_~i~0 12)} is VALID [2022-04-15 12:26:09,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {124404#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124404#(<= main_~i~0 12)} is VALID [2022-04-15 12:26:09,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {124404#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124405#(<= main_~i~0 13)} is VALID [2022-04-15 12:26:09,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {124405#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124405#(<= main_~i~0 13)} is VALID [2022-04-15 12:26:09,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {124405#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124406#(<= main_~i~0 14)} is VALID [2022-04-15 12:26:09,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {124406#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124406#(<= main_~i~0 14)} is VALID [2022-04-15 12:26:09,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {124406#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124407#(<= main_~i~0 15)} is VALID [2022-04-15 12:26:09,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {124407#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124407#(<= main_~i~0 15)} is VALID [2022-04-15 12:26:09,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {124407#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124408#(<= main_~i~0 16)} is VALID [2022-04-15 12:26:09,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {124408#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124408#(<= main_~i~0 16)} is VALID [2022-04-15 12:26:09,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {124408#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124409#(<= main_~i~0 17)} is VALID [2022-04-15 12:26:09,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {124409#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124409#(<= main_~i~0 17)} is VALID [2022-04-15 12:26:09,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {124409#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124410#(<= main_~i~0 18)} is VALID [2022-04-15 12:26:09,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {124410#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124410#(<= main_~i~0 18)} is VALID [2022-04-15 12:26:09,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {124410#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124411#(<= main_~i~0 19)} is VALID [2022-04-15 12:26:09,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {124411#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124411#(<= main_~i~0 19)} is VALID [2022-04-15 12:26:09,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {124411#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124412#(<= main_~i~0 20)} is VALID [2022-04-15 12:26:09,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {124412#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124412#(<= main_~i~0 20)} is VALID [2022-04-15 12:26:09,401 INFO L290 TraceCheckUtils]: 47: Hoare triple {124412#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124413#(<= main_~i~0 21)} is VALID [2022-04-15 12:26:09,401 INFO L290 TraceCheckUtils]: 48: Hoare triple {124413#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124413#(<= main_~i~0 21)} is VALID [2022-04-15 12:26:09,402 INFO L290 TraceCheckUtils]: 49: Hoare triple {124413#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124414#(<= main_~i~0 22)} is VALID [2022-04-15 12:26:09,402 INFO L290 TraceCheckUtils]: 50: Hoare triple {124414#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124414#(<= main_~i~0 22)} is VALID [2022-04-15 12:26:09,402 INFO L290 TraceCheckUtils]: 51: Hoare triple {124414#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124415#(<= main_~i~0 23)} is VALID [2022-04-15 12:26:09,402 INFO L290 TraceCheckUtils]: 52: Hoare triple {124415#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124415#(<= main_~i~0 23)} is VALID [2022-04-15 12:26:09,403 INFO L290 TraceCheckUtils]: 53: Hoare triple {124415#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124416#(<= main_~i~0 24)} is VALID [2022-04-15 12:26:09,403 INFO L290 TraceCheckUtils]: 54: Hoare triple {124416#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124416#(<= main_~i~0 24)} is VALID [2022-04-15 12:26:09,403 INFO L290 TraceCheckUtils]: 55: Hoare triple {124416#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124417#(<= main_~i~0 25)} is VALID [2022-04-15 12:26:09,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {124417#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124417#(<= main_~i~0 25)} is VALID [2022-04-15 12:26:09,404 INFO L290 TraceCheckUtils]: 57: Hoare triple {124417#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124418#(<= main_~i~0 26)} is VALID [2022-04-15 12:26:09,404 INFO L290 TraceCheckUtils]: 58: Hoare triple {124418#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124418#(<= main_~i~0 26)} is VALID [2022-04-15 12:26:09,404 INFO L290 TraceCheckUtils]: 59: Hoare triple {124418#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124419#(<= main_~i~0 27)} is VALID [2022-04-15 12:26:09,405 INFO L290 TraceCheckUtils]: 60: Hoare triple {124419#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124419#(<= main_~i~0 27)} is VALID [2022-04-15 12:26:09,405 INFO L290 TraceCheckUtils]: 61: Hoare triple {124419#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124420#(<= main_~i~0 28)} is VALID [2022-04-15 12:26:09,405 INFO L290 TraceCheckUtils]: 62: Hoare triple {124420#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124420#(<= main_~i~0 28)} is VALID [2022-04-15 12:26:09,406 INFO L290 TraceCheckUtils]: 63: Hoare triple {124420#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124421#(<= main_~i~0 29)} is VALID [2022-04-15 12:26:09,406 INFO L290 TraceCheckUtils]: 64: Hoare triple {124421#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124421#(<= main_~i~0 29)} is VALID [2022-04-15 12:26:09,406 INFO L290 TraceCheckUtils]: 65: Hoare triple {124421#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124422#(<= main_~i~0 30)} is VALID [2022-04-15 12:26:09,406 INFO L290 TraceCheckUtils]: 66: Hoare triple {124422#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124422#(<= main_~i~0 30)} is VALID [2022-04-15 12:26:09,407 INFO L290 TraceCheckUtils]: 67: Hoare triple {124422#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124423#(<= main_~i~0 31)} is VALID [2022-04-15 12:26:09,407 INFO L290 TraceCheckUtils]: 68: Hoare triple {124423#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124423#(<= main_~i~0 31)} is VALID [2022-04-15 12:26:09,407 INFO L290 TraceCheckUtils]: 69: Hoare triple {124423#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124424#(<= main_~i~0 32)} is VALID [2022-04-15 12:26:09,407 INFO L290 TraceCheckUtils]: 70: Hoare triple {124424#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124424#(<= main_~i~0 32)} is VALID [2022-04-15 12:26:09,408 INFO L290 TraceCheckUtils]: 71: Hoare triple {124424#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124425#(<= main_~i~0 33)} is VALID [2022-04-15 12:26:09,408 INFO L290 TraceCheckUtils]: 72: Hoare triple {124425#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124425#(<= main_~i~0 33)} is VALID [2022-04-15 12:26:09,408 INFO L290 TraceCheckUtils]: 73: Hoare triple {124425#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124426#(<= main_~i~0 34)} is VALID [2022-04-15 12:26:09,408 INFO L290 TraceCheckUtils]: 74: Hoare triple {124426#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124426#(<= main_~i~0 34)} is VALID [2022-04-15 12:26:09,409 INFO L290 TraceCheckUtils]: 75: Hoare triple {124426#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124427#(<= main_~i~0 35)} is VALID [2022-04-15 12:26:09,409 INFO L290 TraceCheckUtils]: 76: Hoare triple {124427#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124427#(<= main_~i~0 35)} is VALID [2022-04-15 12:26:09,409 INFO L290 TraceCheckUtils]: 77: Hoare triple {124427#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124428#(<= main_~i~0 36)} is VALID [2022-04-15 12:26:09,410 INFO L290 TraceCheckUtils]: 78: Hoare triple {124428#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124428#(<= main_~i~0 36)} is VALID [2022-04-15 12:26:09,410 INFO L290 TraceCheckUtils]: 79: Hoare triple {124428#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124429#(<= main_~i~0 37)} is VALID [2022-04-15 12:26:09,410 INFO L290 TraceCheckUtils]: 80: Hoare triple {124429#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124429#(<= main_~i~0 37)} is VALID [2022-04-15 12:26:09,410 INFO L290 TraceCheckUtils]: 81: Hoare triple {124429#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124430#(<= main_~i~0 38)} is VALID [2022-04-15 12:26:09,411 INFO L290 TraceCheckUtils]: 82: Hoare triple {124430#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124430#(<= main_~i~0 38)} is VALID [2022-04-15 12:26:09,411 INFO L290 TraceCheckUtils]: 83: Hoare triple {124430#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124431#(<= main_~i~0 39)} is VALID [2022-04-15 12:26:09,411 INFO L290 TraceCheckUtils]: 84: Hoare triple {124431#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124431#(<= main_~i~0 39)} is VALID [2022-04-15 12:26:09,412 INFO L290 TraceCheckUtils]: 85: Hoare triple {124431#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124432#(<= main_~i~0 40)} is VALID [2022-04-15 12:26:09,412 INFO L290 TraceCheckUtils]: 86: Hoare triple {124432#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124432#(<= main_~i~0 40)} is VALID [2022-04-15 12:26:09,412 INFO L290 TraceCheckUtils]: 87: Hoare triple {124432#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124433#(<= main_~i~0 41)} is VALID [2022-04-15 12:26:09,412 INFO L290 TraceCheckUtils]: 88: Hoare triple {124433#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124433#(<= main_~i~0 41)} is VALID [2022-04-15 12:26:09,413 INFO L290 TraceCheckUtils]: 89: Hoare triple {124433#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124434#(<= main_~i~0 42)} is VALID [2022-04-15 12:26:09,413 INFO L290 TraceCheckUtils]: 90: Hoare triple {124434#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124434#(<= main_~i~0 42)} is VALID [2022-04-15 12:26:09,413 INFO L290 TraceCheckUtils]: 91: Hoare triple {124434#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124435#(<= main_~i~0 43)} is VALID [2022-04-15 12:26:09,413 INFO L290 TraceCheckUtils]: 92: Hoare triple {124435#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124435#(<= main_~i~0 43)} is VALID [2022-04-15 12:26:09,414 INFO L290 TraceCheckUtils]: 93: Hoare triple {124435#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124436#(<= main_~i~0 44)} is VALID [2022-04-15 12:26:09,414 INFO L290 TraceCheckUtils]: 94: Hoare triple {124436#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124436#(<= main_~i~0 44)} is VALID [2022-04-15 12:26:09,414 INFO L290 TraceCheckUtils]: 95: Hoare triple {124436#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124437#(<= main_~i~0 45)} is VALID [2022-04-15 12:26:09,414 INFO L290 TraceCheckUtils]: 96: Hoare triple {124437#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124437#(<= main_~i~0 45)} is VALID [2022-04-15 12:26:09,415 INFO L290 TraceCheckUtils]: 97: Hoare triple {124437#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124438#(<= main_~i~0 46)} is VALID [2022-04-15 12:26:09,415 INFO L290 TraceCheckUtils]: 98: Hoare triple {124438#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124438#(<= main_~i~0 46)} is VALID [2022-04-15 12:26:09,415 INFO L290 TraceCheckUtils]: 99: Hoare triple {124438#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124439#(<= main_~i~0 47)} is VALID [2022-04-15 12:26:09,416 INFO L290 TraceCheckUtils]: 100: Hoare triple {124439#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124439#(<= main_~i~0 47)} is VALID [2022-04-15 12:26:09,416 INFO L290 TraceCheckUtils]: 101: Hoare triple {124439#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124440#(<= main_~i~0 48)} is VALID [2022-04-15 12:26:09,416 INFO L290 TraceCheckUtils]: 102: Hoare triple {124440#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124440#(<= main_~i~0 48)} is VALID [2022-04-15 12:26:09,416 INFO L290 TraceCheckUtils]: 103: Hoare triple {124440#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124441#(<= main_~i~0 49)} is VALID [2022-04-15 12:26:09,417 INFO L290 TraceCheckUtils]: 104: Hoare triple {124441#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124441#(<= main_~i~0 49)} is VALID [2022-04-15 12:26:09,417 INFO L290 TraceCheckUtils]: 105: Hoare triple {124441#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124442#(<= main_~i~0 50)} is VALID [2022-04-15 12:26:09,417 INFO L290 TraceCheckUtils]: 106: Hoare triple {124442#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124442#(<= main_~i~0 50)} is VALID [2022-04-15 12:26:09,417 INFO L290 TraceCheckUtils]: 107: Hoare triple {124442#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124443#(<= main_~i~0 51)} is VALID [2022-04-15 12:26:09,418 INFO L290 TraceCheckUtils]: 108: Hoare triple {124443#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124443#(<= main_~i~0 51)} is VALID [2022-04-15 12:26:09,418 INFO L290 TraceCheckUtils]: 109: Hoare triple {124443#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124444#(<= main_~i~0 52)} is VALID [2022-04-15 12:26:09,418 INFO L290 TraceCheckUtils]: 110: Hoare triple {124444#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124444#(<= main_~i~0 52)} is VALID [2022-04-15 12:26:09,419 INFO L290 TraceCheckUtils]: 111: Hoare triple {124444#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124445#(<= main_~i~0 53)} is VALID [2022-04-15 12:26:09,419 INFO L290 TraceCheckUtils]: 112: Hoare triple {124445#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124445#(<= main_~i~0 53)} is VALID [2022-04-15 12:26:09,419 INFO L290 TraceCheckUtils]: 113: Hoare triple {124445#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124446#(<= main_~i~0 54)} is VALID [2022-04-15 12:26:09,419 INFO L290 TraceCheckUtils]: 114: Hoare triple {124446#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124446#(<= main_~i~0 54)} is VALID [2022-04-15 12:26:09,420 INFO L290 TraceCheckUtils]: 115: Hoare triple {124446#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124447#(<= main_~i~0 55)} is VALID [2022-04-15 12:26:09,420 INFO L290 TraceCheckUtils]: 116: Hoare triple {124447#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124447#(<= main_~i~0 55)} is VALID [2022-04-15 12:26:09,420 INFO L290 TraceCheckUtils]: 117: Hoare triple {124447#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124448#(<= main_~i~0 56)} is VALID [2022-04-15 12:26:09,420 INFO L290 TraceCheckUtils]: 118: Hoare triple {124448#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124448#(<= main_~i~0 56)} is VALID [2022-04-15 12:26:09,421 INFO L290 TraceCheckUtils]: 119: Hoare triple {124448#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124449#(<= main_~i~0 57)} is VALID [2022-04-15 12:26:09,421 INFO L290 TraceCheckUtils]: 120: Hoare triple {124449#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124449#(<= main_~i~0 57)} is VALID [2022-04-15 12:26:09,421 INFO L290 TraceCheckUtils]: 121: Hoare triple {124449#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124450#(<= main_~i~0 58)} is VALID [2022-04-15 12:26:09,422 INFO L290 TraceCheckUtils]: 122: Hoare triple {124450#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124450#(<= main_~i~0 58)} is VALID [2022-04-15 12:26:09,422 INFO L290 TraceCheckUtils]: 123: Hoare triple {124450#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124451#(<= main_~i~0 59)} is VALID [2022-04-15 12:26:09,422 INFO L290 TraceCheckUtils]: 124: Hoare triple {124451#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124451#(<= main_~i~0 59)} is VALID [2022-04-15 12:26:09,422 INFO L290 TraceCheckUtils]: 125: Hoare triple {124451#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124452#(<= main_~i~0 60)} is VALID [2022-04-15 12:26:09,423 INFO L290 TraceCheckUtils]: 126: Hoare triple {124452#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124452#(<= main_~i~0 60)} is VALID [2022-04-15 12:26:09,423 INFO L290 TraceCheckUtils]: 127: Hoare triple {124452#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124453#(<= main_~i~0 61)} is VALID [2022-04-15 12:26:09,423 INFO L290 TraceCheckUtils]: 128: Hoare triple {124453#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124453#(<= main_~i~0 61)} is VALID [2022-04-15 12:26:09,423 INFO L290 TraceCheckUtils]: 129: Hoare triple {124453#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124454#(<= main_~i~0 62)} is VALID [2022-04-15 12:26:09,424 INFO L290 TraceCheckUtils]: 130: Hoare triple {124454#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124454#(<= main_~i~0 62)} is VALID [2022-04-15 12:26:09,424 INFO L290 TraceCheckUtils]: 131: Hoare triple {124454#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124455#(<= main_~i~0 63)} is VALID [2022-04-15 12:26:09,424 INFO L290 TraceCheckUtils]: 132: Hoare triple {124455#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124455#(<= main_~i~0 63)} is VALID [2022-04-15 12:26:09,425 INFO L290 TraceCheckUtils]: 133: Hoare triple {124455#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124456#(<= main_~i~0 64)} is VALID [2022-04-15 12:26:09,425 INFO L290 TraceCheckUtils]: 134: Hoare triple {124456#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124456#(<= main_~i~0 64)} is VALID [2022-04-15 12:26:09,425 INFO L290 TraceCheckUtils]: 135: Hoare triple {124456#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124457#(<= main_~i~0 65)} is VALID [2022-04-15 12:26:09,425 INFO L290 TraceCheckUtils]: 136: Hoare triple {124457#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124457#(<= main_~i~0 65)} is VALID [2022-04-15 12:26:09,426 INFO L290 TraceCheckUtils]: 137: Hoare triple {124457#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124458#(<= main_~i~0 66)} is VALID [2022-04-15 12:26:09,426 INFO L290 TraceCheckUtils]: 138: Hoare triple {124458#(<= main_~i~0 66)} assume !(~i~0 < 1024); {124388#false} is VALID [2022-04-15 12:26:09,426 INFO L290 TraceCheckUtils]: 139: Hoare triple {124388#false} ~i~0 := 0; {124388#false} is VALID [2022-04-15 12:26:09,426 INFO L290 TraceCheckUtils]: 140: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 12:26:09,426 INFO L290 TraceCheckUtils]: 141: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 12:26:09,426 INFO L290 TraceCheckUtils]: 142: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 12:26:09,426 INFO L290 TraceCheckUtils]: 143: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-15 12:26:09,426 INFO L290 TraceCheckUtils]: 144: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 12:26:09,426 INFO L290 TraceCheckUtils]: 145: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 12:26:09,426 INFO L290 TraceCheckUtils]: 146: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 12:26:09,426 INFO L290 TraceCheckUtils]: 147: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-15 12:26:09,426 INFO L290 TraceCheckUtils]: 148: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 12:26:09,427 INFO L290 TraceCheckUtils]: 149: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 12:26:09,427 INFO L290 TraceCheckUtils]: 150: Hoare triple {124388#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 12:26:09,427 INFO L272 TraceCheckUtils]: 151: Hoare triple {124388#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {124388#false} is VALID [2022-04-15 12:26:09,427 INFO L290 TraceCheckUtils]: 152: Hoare triple {124388#false} ~cond := #in~cond; {124388#false} is VALID [2022-04-15 12:26:09,427 INFO L290 TraceCheckUtils]: 153: Hoare triple {124388#false} assume 0 == ~cond; {124388#false} is VALID [2022-04-15 12:26:09,427 INFO L290 TraceCheckUtils]: 154: Hoare triple {124388#false} assume !false; {124388#false} is VALID [2022-04-15 12:26:09,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:26:09,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:26:09,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958338732] [2022-04-15 12:26:09,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958338732] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:26:09,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462028946] [2022-04-15 12:26:09,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:26:09,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:26:09,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:26:09,428 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:09,429 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:09,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:26:09,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:26:09,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-15 12:26:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:09,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:26:10,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {124387#true} call ULTIMATE.init(); {124387#true} is VALID [2022-04-15 12:26:10,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {124387#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {124387#true} is VALID [2022-04-15 12:26:10,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {124387#true} assume true; {124387#true} is VALID [2022-04-15 12:26:10,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124387#true} {124387#true} #64#return; {124387#true} is VALID [2022-04-15 12:26:10,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {124387#true} call #t~ret6 := main(); {124387#true} is VALID [2022-04-15 12:26:10,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {124387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {124478#(<= main_~i~0 0)} is VALID [2022-04-15 12:26:10,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {124478#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124478#(<= main_~i~0 0)} is VALID [2022-04-15 12:26:10,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {124478#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124393#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:10,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {124393#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124393#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:10,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {124393#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124394#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:10,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {124394#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124394#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:10,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {124394#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124395#(<= main_~i~0 3)} is VALID [2022-04-15 12:26:10,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {124395#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124395#(<= main_~i~0 3)} is VALID [2022-04-15 12:26:10,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {124395#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124396#(<= main_~i~0 4)} is VALID [2022-04-15 12:26:10,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {124396#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124396#(<= main_~i~0 4)} is VALID [2022-04-15 12:26:10,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {124396#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124397#(<= main_~i~0 5)} is VALID [2022-04-15 12:26:10,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {124397#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124397#(<= main_~i~0 5)} is VALID [2022-04-15 12:26:10,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {124397#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124398#(<= main_~i~0 6)} is VALID [2022-04-15 12:26:10,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {124398#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124398#(<= main_~i~0 6)} is VALID [2022-04-15 12:26:10,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {124398#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124399#(<= main_~i~0 7)} is VALID [2022-04-15 12:26:10,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {124399#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124399#(<= main_~i~0 7)} is VALID [2022-04-15 12:26:10,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {124399#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124400#(<= main_~i~0 8)} is VALID [2022-04-15 12:26:10,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {124400#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124400#(<= main_~i~0 8)} is VALID [2022-04-15 12:26:10,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {124400#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124401#(<= main_~i~0 9)} is VALID [2022-04-15 12:26:10,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {124401#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124401#(<= main_~i~0 9)} is VALID [2022-04-15 12:26:10,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {124401#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124402#(<= main_~i~0 10)} is VALID [2022-04-15 12:26:10,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {124402#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124402#(<= main_~i~0 10)} is VALID [2022-04-15 12:26:10,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {124402#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124403#(<= main_~i~0 11)} is VALID [2022-04-15 12:26:10,622 INFO L290 TraceCheckUtils]: 28: Hoare triple {124403#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124403#(<= main_~i~0 11)} is VALID [2022-04-15 12:26:10,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {124403#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124404#(<= main_~i~0 12)} is VALID [2022-04-15 12:26:10,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {124404#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124404#(<= main_~i~0 12)} is VALID [2022-04-15 12:26:10,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {124404#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124405#(<= main_~i~0 13)} is VALID [2022-04-15 12:26:10,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {124405#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124405#(<= main_~i~0 13)} is VALID [2022-04-15 12:26:10,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {124405#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124406#(<= main_~i~0 14)} is VALID [2022-04-15 12:26:10,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {124406#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124406#(<= main_~i~0 14)} is VALID [2022-04-15 12:26:10,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {124406#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124407#(<= main_~i~0 15)} is VALID [2022-04-15 12:26:10,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {124407#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124407#(<= main_~i~0 15)} is VALID [2022-04-15 12:26:10,625 INFO L290 TraceCheckUtils]: 37: Hoare triple {124407#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124408#(<= main_~i~0 16)} is VALID [2022-04-15 12:26:10,625 INFO L290 TraceCheckUtils]: 38: Hoare triple {124408#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124408#(<= main_~i~0 16)} is VALID [2022-04-15 12:26:10,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {124408#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124409#(<= main_~i~0 17)} is VALID [2022-04-15 12:26:10,626 INFO L290 TraceCheckUtils]: 40: Hoare triple {124409#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124409#(<= main_~i~0 17)} is VALID [2022-04-15 12:26:10,626 INFO L290 TraceCheckUtils]: 41: Hoare triple {124409#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124410#(<= main_~i~0 18)} is VALID [2022-04-15 12:26:10,626 INFO L290 TraceCheckUtils]: 42: Hoare triple {124410#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124410#(<= main_~i~0 18)} is VALID [2022-04-15 12:26:10,626 INFO L290 TraceCheckUtils]: 43: Hoare triple {124410#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124411#(<= main_~i~0 19)} is VALID [2022-04-15 12:26:10,627 INFO L290 TraceCheckUtils]: 44: Hoare triple {124411#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124411#(<= main_~i~0 19)} is VALID [2022-04-15 12:26:10,627 INFO L290 TraceCheckUtils]: 45: Hoare triple {124411#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124412#(<= main_~i~0 20)} is VALID [2022-04-15 12:26:10,627 INFO L290 TraceCheckUtils]: 46: Hoare triple {124412#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124412#(<= main_~i~0 20)} is VALID [2022-04-15 12:26:10,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {124412#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124413#(<= main_~i~0 21)} is VALID [2022-04-15 12:26:10,628 INFO L290 TraceCheckUtils]: 48: Hoare triple {124413#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124413#(<= main_~i~0 21)} is VALID [2022-04-15 12:26:10,628 INFO L290 TraceCheckUtils]: 49: Hoare triple {124413#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124414#(<= main_~i~0 22)} is VALID [2022-04-15 12:26:10,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {124414#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124414#(<= main_~i~0 22)} is VALID [2022-04-15 12:26:10,629 INFO L290 TraceCheckUtils]: 51: Hoare triple {124414#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124415#(<= main_~i~0 23)} is VALID [2022-04-15 12:26:10,629 INFO L290 TraceCheckUtils]: 52: Hoare triple {124415#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124415#(<= main_~i~0 23)} is VALID [2022-04-15 12:26:10,629 INFO L290 TraceCheckUtils]: 53: Hoare triple {124415#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124416#(<= main_~i~0 24)} is VALID [2022-04-15 12:26:10,629 INFO L290 TraceCheckUtils]: 54: Hoare triple {124416#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124416#(<= main_~i~0 24)} is VALID [2022-04-15 12:26:10,630 INFO L290 TraceCheckUtils]: 55: Hoare triple {124416#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124417#(<= main_~i~0 25)} is VALID [2022-04-15 12:26:10,630 INFO L290 TraceCheckUtils]: 56: Hoare triple {124417#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124417#(<= main_~i~0 25)} is VALID [2022-04-15 12:26:10,630 INFO L290 TraceCheckUtils]: 57: Hoare triple {124417#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124418#(<= main_~i~0 26)} is VALID [2022-04-15 12:26:10,631 INFO L290 TraceCheckUtils]: 58: Hoare triple {124418#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124418#(<= main_~i~0 26)} is VALID [2022-04-15 12:26:10,631 INFO L290 TraceCheckUtils]: 59: Hoare triple {124418#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124419#(<= main_~i~0 27)} is VALID [2022-04-15 12:26:10,631 INFO L290 TraceCheckUtils]: 60: Hoare triple {124419#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124419#(<= main_~i~0 27)} is VALID [2022-04-15 12:26:10,631 INFO L290 TraceCheckUtils]: 61: Hoare triple {124419#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124420#(<= main_~i~0 28)} is VALID [2022-04-15 12:26:10,632 INFO L290 TraceCheckUtils]: 62: Hoare triple {124420#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124420#(<= main_~i~0 28)} is VALID [2022-04-15 12:26:10,632 INFO L290 TraceCheckUtils]: 63: Hoare triple {124420#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124421#(<= main_~i~0 29)} is VALID [2022-04-15 12:26:10,632 INFO L290 TraceCheckUtils]: 64: Hoare triple {124421#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124421#(<= main_~i~0 29)} is VALID [2022-04-15 12:26:10,633 INFO L290 TraceCheckUtils]: 65: Hoare triple {124421#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124422#(<= main_~i~0 30)} is VALID [2022-04-15 12:26:10,633 INFO L290 TraceCheckUtils]: 66: Hoare triple {124422#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124422#(<= main_~i~0 30)} is VALID [2022-04-15 12:26:10,633 INFO L290 TraceCheckUtils]: 67: Hoare triple {124422#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124423#(<= main_~i~0 31)} is VALID [2022-04-15 12:26:10,633 INFO L290 TraceCheckUtils]: 68: Hoare triple {124423#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124423#(<= main_~i~0 31)} is VALID [2022-04-15 12:26:10,634 INFO L290 TraceCheckUtils]: 69: Hoare triple {124423#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124424#(<= main_~i~0 32)} is VALID [2022-04-15 12:26:10,634 INFO L290 TraceCheckUtils]: 70: Hoare triple {124424#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124424#(<= main_~i~0 32)} is VALID [2022-04-15 12:26:10,634 INFO L290 TraceCheckUtils]: 71: Hoare triple {124424#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124425#(<= main_~i~0 33)} is VALID [2022-04-15 12:26:10,634 INFO L290 TraceCheckUtils]: 72: Hoare triple {124425#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124425#(<= main_~i~0 33)} is VALID [2022-04-15 12:26:10,635 INFO L290 TraceCheckUtils]: 73: Hoare triple {124425#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124426#(<= main_~i~0 34)} is VALID [2022-04-15 12:26:10,635 INFO L290 TraceCheckUtils]: 74: Hoare triple {124426#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124426#(<= main_~i~0 34)} is VALID [2022-04-15 12:26:10,635 INFO L290 TraceCheckUtils]: 75: Hoare triple {124426#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124427#(<= main_~i~0 35)} is VALID [2022-04-15 12:26:10,636 INFO L290 TraceCheckUtils]: 76: Hoare triple {124427#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124427#(<= main_~i~0 35)} is VALID [2022-04-15 12:26:10,636 INFO L290 TraceCheckUtils]: 77: Hoare triple {124427#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124428#(<= main_~i~0 36)} is VALID [2022-04-15 12:26:10,636 INFO L290 TraceCheckUtils]: 78: Hoare triple {124428#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124428#(<= main_~i~0 36)} is VALID [2022-04-15 12:26:10,636 INFO L290 TraceCheckUtils]: 79: Hoare triple {124428#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124429#(<= main_~i~0 37)} is VALID [2022-04-15 12:26:10,637 INFO L290 TraceCheckUtils]: 80: Hoare triple {124429#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124429#(<= main_~i~0 37)} is VALID [2022-04-15 12:26:10,637 INFO L290 TraceCheckUtils]: 81: Hoare triple {124429#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124430#(<= main_~i~0 38)} is VALID [2022-04-15 12:26:10,637 INFO L290 TraceCheckUtils]: 82: Hoare triple {124430#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124430#(<= main_~i~0 38)} is VALID [2022-04-15 12:26:10,637 INFO L290 TraceCheckUtils]: 83: Hoare triple {124430#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124431#(<= main_~i~0 39)} is VALID [2022-04-15 12:26:10,638 INFO L290 TraceCheckUtils]: 84: Hoare triple {124431#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124431#(<= main_~i~0 39)} is VALID [2022-04-15 12:26:10,638 INFO L290 TraceCheckUtils]: 85: Hoare triple {124431#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124432#(<= main_~i~0 40)} is VALID [2022-04-15 12:26:10,638 INFO L290 TraceCheckUtils]: 86: Hoare triple {124432#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124432#(<= main_~i~0 40)} is VALID [2022-04-15 12:26:10,639 INFO L290 TraceCheckUtils]: 87: Hoare triple {124432#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124433#(<= main_~i~0 41)} is VALID [2022-04-15 12:26:10,639 INFO L290 TraceCheckUtils]: 88: Hoare triple {124433#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124433#(<= main_~i~0 41)} is VALID [2022-04-15 12:26:10,639 INFO L290 TraceCheckUtils]: 89: Hoare triple {124433#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124434#(<= main_~i~0 42)} is VALID [2022-04-15 12:26:10,639 INFO L290 TraceCheckUtils]: 90: Hoare triple {124434#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124434#(<= main_~i~0 42)} is VALID [2022-04-15 12:26:10,640 INFO L290 TraceCheckUtils]: 91: Hoare triple {124434#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124435#(<= main_~i~0 43)} is VALID [2022-04-15 12:26:10,640 INFO L290 TraceCheckUtils]: 92: Hoare triple {124435#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124435#(<= main_~i~0 43)} is VALID [2022-04-15 12:26:10,640 INFO L290 TraceCheckUtils]: 93: Hoare triple {124435#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124436#(<= main_~i~0 44)} is VALID [2022-04-15 12:26:10,640 INFO L290 TraceCheckUtils]: 94: Hoare triple {124436#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124436#(<= main_~i~0 44)} is VALID [2022-04-15 12:26:10,641 INFO L290 TraceCheckUtils]: 95: Hoare triple {124436#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124437#(<= main_~i~0 45)} is VALID [2022-04-15 12:26:10,641 INFO L290 TraceCheckUtils]: 96: Hoare triple {124437#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124437#(<= main_~i~0 45)} is VALID [2022-04-15 12:26:10,641 INFO L290 TraceCheckUtils]: 97: Hoare triple {124437#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124438#(<= main_~i~0 46)} is VALID [2022-04-15 12:26:10,642 INFO L290 TraceCheckUtils]: 98: Hoare triple {124438#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124438#(<= main_~i~0 46)} is VALID [2022-04-15 12:26:10,642 INFO L290 TraceCheckUtils]: 99: Hoare triple {124438#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124439#(<= main_~i~0 47)} is VALID [2022-04-15 12:26:10,642 INFO L290 TraceCheckUtils]: 100: Hoare triple {124439#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124439#(<= main_~i~0 47)} is VALID [2022-04-15 12:26:10,642 INFO L290 TraceCheckUtils]: 101: Hoare triple {124439#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124440#(<= main_~i~0 48)} is VALID [2022-04-15 12:26:10,643 INFO L290 TraceCheckUtils]: 102: Hoare triple {124440#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124440#(<= main_~i~0 48)} is VALID [2022-04-15 12:26:10,643 INFO L290 TraceCheckUtils]: 103: Hoare triple {124440#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124441#(<= main_~i~0 49)} is VALID [2022-04-15 12:26:10,643 INFO L290 TraceCheckUtils]: 104: Hoare triple {124441#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124441#(<= main_~i~0 49)} is VALID [2022-04-15 12:26:10,644 INFO L290 TraceCheckUtils]: 105: Hoare triple {124441#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124442#(<= main_~i~0 50)} is VALID [2022-04-15 12:26:10,644 INFO L290 TraceCheckUtils]: 106: Hoare triple {124442#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124442#(<= main_~i~0 50)} is VALID [2022-04-15 12:26:10,644 INFO L290 TraceCheckUtils]: 107: Hoare triple {124442#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124443#(<= main_~i~0 51)} is VALID [2022-04-15 12:26:10,644 INFO L290 TraceCheckUtils]: 108: Hoare triple {124443#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124443#(<= main_~i~0 51)} is VALID [2022-04-15 12:26:10,645 INFO L290 TraceCheckUtils]: 109: Hoare triple {124443#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124444#(<= main_~i~0 52)} is VALID [2022-04-15 12:26:10,645 INFO L290 TraceCheckUtils]: 110: Hoare triple {124444#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124444#(<= main_~i~0 52)} is VALID [2022-04-15 12:26:10,645 INFO L290 TraceCheckUtils]: 111: Hoare triple {124444#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124445#(<= main_~i~0 53)} is VALID [2022-04-15 12:26:10,645 INFO L290 TraceCheckUtils]: 112: Hoare triple {124445#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124445#(<= main_~i~0 53)} is VALID [2022-04-15 12:26:10,646 INFO L290 TraceCheckUtils]: 113: Hoare triple {124445#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124446#(<= main_~i~0 54)} is VALID [2022-04-15 12:26:10,646 INFO L290 TraceCheckUtils]: 114: Hoare triple {124446#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124446#(<= main_~i~0 54)} is VALID [2022-04-15 12:26:10,646 INFO L290 TraceCheckUtils]: 115: Hoare triple {124446#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124447#(<= main_~i~0 55)} is VALID [2022-04-15 12:26:10,647 INFO L290 TraceCheckUtils]: 116: Hoare triple {124447#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124447#(<= main_~i~0 55)} is VALID [2022-04-15 12:26:10,647 INFO L290 TraceCheckUtils]: 117: Hoare triple {124447#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124448#(<= main_~i~0 56)} is VALID [2022-04-15 12:26:10,647 INFO L290 TraceCheckUtils]: 118: Hoare triple {124448#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124448#(<= main_~i~0 56)} is VALID [2022-04-15 12:26:10,647 INFO L290 TraceCheckUtils]: 119: Hoare triple {124448#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124449#(<= main_~i~0 57)} is VALID [2022-04-15 12:26:10,648 INFO L290 TraceCheckUtils]: 120: Hoare triple {124449#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124449#(<= main_~i~0 57)} is VALID [2022-04-15 12:26:10,648 INFO L290 TraceCheckUtils]: 121: Hoare triple {124449#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124450#(<= main_~i~0 58)} is VALID [2022-04-15 12:26:10,648 INFO L290 TraceCheckUtils]: 122: Hoare triple {124450#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124450#(<= main_~i~0 58)} is VALID [2022-04-15 12:26:10,648 INFO L290 TraceCheckUtils]: 123: Hoare triple {124450#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124451#(<= main_~i~0 59)} is VALID [2022-04-15 12:26:10,649 INFO L290 TraceCheckUtils]: 124: Hoare triple {124451#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124451#(<= main_~i~0 59)} is VALID [2022-04-15 12:26:10,649 INFO L290 TraceCheckUtils]: 125: Hoare triple {124451#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124452#(<= main_~i~0 60)} is VALID [2022-04-15 12:26:10,649 INFO L290 TraceCheckUtils]: 126: Hoare triple {124452#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124452#(<= main_~i~0 60)} is VALID [2022-04-15 12:26:10,650 INFO L290 TraceCheckUtils]: 127: Hoare triple {124452#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124453#(<= main_~i~0 61)} is VALID [2022-04-15 12:26:10,650 INFO L290 TraceCheckUtils]: 128: Hoare triple {124453#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124453#(<= main_~i~0 61)} is VALID [2022-04-15 12:26:10,650 INFO L290 TraceCheckUtils]: 129: Hoare triple {124453#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124454#(<= main_~i~0 62)} is VALID [2022-04-15 12:26:10,650 INFO L290 TraceCheckUtils]: 130: Hoare triple {124454#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124454#(<= main_~i~0 62)} is VALID [2022-04-15 12:26:10,651 INFO L290 TraceCheckUtils]: 131: Hoare triple {124454#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124455#(<= main_~i~0 63)} is VALID [2022-04-15 12:26:10,651 INFO L290 TraceCheckUtils]: 132: Hoare triple {124455#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124455#(<= main_~i~0 63)} is VALID [2022-04-15 12:26:10,651 INFO L290 TraceCheckUtils]: 133: Hoare triple {124455#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124456#(<= main_~i~0 64)} is VALID [2022-04-15 12:26:10,651 INFO L290 TraceCheckUtils]: 134: Hoare triple {124456#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124456#(<= main_~i~0 64)} is VALID [2022-04-15 12:26:10,652 INFO L290 TraceCheckUtils]: 135: Hoare triple {124456#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124457#(<= main_~i~0 65)} is VALID [2022-04-15 12:26:10,652 INFO L290 TraceCheckUtils]: 136: Hoare triple {124457#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124457#(<= main_~i~0 65)} is VALID [2022-04-15 12:26:10,652 INFO L290 TraceCheckUtils]: 137: Hoare triple {124457#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124458#(<= main_~i~0 66)} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 138: Hoare triple {124458#(<= main_~i~0 66)} assume !(~i~0 < 1024); {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 139: Hoare triple {124388#false} ~i~0 := 0; {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 140: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 141: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 142: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 143: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 144: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 145: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 146: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 147: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 148: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 149: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 150: Hoare triple {124388#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L272 TraceCheckUtils]: 151: Hoare triple {124388#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 152: Hoare triple {124388#false} ~cond := #in~cond; {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 153: Hoare triple {124388#false} assume 0 == ~cond; {124388#false} is VALID [2022-04-15 12:26:10,653 INFO L290 TraceCheckUtils]: 154: Hoare triple {124388#false} assume !false; {124388#false} is VALID [2022-04-15 12:26:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:26:10,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:26:14,921 INFO L290 TraceCheckUtils]: 154: Hoare triple {124388#false} assume !false; {124388#false} is VALID [2022-04-15 12:26:14,921 INFO L290 TraceCheckUtils]: 153: Hoare triple {124388#false} assume 0 == ~cond; {124388#false} is VALID [2022-04-15 12:26:14,921 INFO L290 TraceCheckUtils]: 152: Hoare triple {124388#false} ~cond := #in~cond; {124388#false} is VALID [2022-04-15 12:26:14,922 INFO L272 TraceCheckUtils]: 151: Hoare triple {124388#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {124388#false} is VALID [2022-04-15 12:26:14,922 INFO L290 TraceCheckUtils]: 150: Hoare triple {124388#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 12:26:14,922 INFO L290 TraceCheckUtils]: 149: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 12:26:14,922 INFO L290 TraceCheckUtils]: 148: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 12:26:14,922 INFO L290 TraceCheckUtils]: 147: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-15 12:26:14,922 INFO L290 TraceCheckUtils]: 146: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 12:26:14,922 INFO L290 TraceCheckUtils]: 145: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 12:26:14,922 INFO L290 TraceCheckUtils]: 144: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 12:26:14,922 INFO L290 TraceCheckUtils]: 143: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-15 12:26:14,922 INFO L290 TraceCheckUtils]: 142: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 12:26:14,922 INFO L290 TraceCheckUtils]: 141: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 12:26:14,922 INFO L290 TraceCheckUtils]: 140: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 12:26:14,922 INFO L290 TraceCheckUtils]: 139: Hoare triple {124388#false} ~i~0 := 0; {124388#false} is VALID [2022-04-15 12:26:14,922 INFO L290 TraceCheckUtils]: 138: Hoare triple {124974#(< main_~i~0 1024)} assume !(~i~0 < 1024); {124388#false} is VALID [2022-04-15 12:26:14,923 INFO L290 TraceCheckUtils]: 137: Hoare triple {124978#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124974#(< main_~i~0 1024)} is VALID [2022-04-15 12:26:14,923 INFO L290 TraceCheckUtils]: 136: Hoare triple {124978#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124978#(< main_~i~0 1023)} is VALID [2022-04-15 12:26:14,923 INFO L290 TraceCheckUtils]: 135: Hoare triple {124985#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124978#(< main_~i~0 1023)} is VALID [2022-04-15 12:26:14,924 INFO L290 TraceCheckUtils]: 134: Hoare triple {124985#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124985#(< main_~i~0 1022)} is VALID [2022-04-15 12:26:14,924 INFO L290 TraceCheckUtils]: 133: Hoare triple {124992#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124985#(< main_~i~0 1022)} is VALID [2022-04-15 12:26:14,924 INFO L290 TraceCheckUtils]: 132: Hoare triple {124992#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124992#(< main_~i~0 1021)} is VALID [2022-04-15 12:26:14,924 INFO L290 TraceCheckUtils]: 131: Hoare triple {124999#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124992#(< main_~i~0 1021)} is VALID [2022-04-15 12:26:14,925 INFO L290 TraceCheckUtils]: 130: Hoare triple {124999#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124999#(< main_~i~0 1020)} is VALID [2022-04-15 12:26:14,925 INFO L290 TraceCheckUtils]: 129: Hoare triple {125006#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124999#(< main_~i~0 1020)} is VALID [2022-04-15 12:26:14,925 INFO L290 TraceCheckUtils]: 128: Hoare triple {125006#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125006#(< main_~i~0 1019)} is VALID [2022-04-15 12:26:14,926 INFO L290 TraceCheckUtils]: 127: Hoare triple {125013#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125006#(< main_~i~0 1019)} is VALID [2022-04-15 12:26:14,926 INFO L290 TraceCheckUtils]: 126: Hoare triple {125013#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125013#(< main_~i~0 1018)} is VALID [2022-04-15 12:26:14,926 INFO L290 TraceCheckUtils]: 125: Hoare triple {125020#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125013#(< main_~i~0 1018)} is VALID [2022-04-15 12:26:14,926 INFO L290 TraceCheckUtils]: 124: Hoare triple {125020#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125020#(< main_~i~0 1017)} is VALID [2022-04-15 12:26:14,927 INFO L290 TraceCheckUtils]: 123: Hoare triple {125027#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125020#(< main_~i~0 1017)} is VALID [2022-04-15 12:26:14,927 INFO L290 TraceCheckUtils]: 122: Hoare triple {125027#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125027#(< main_~i~0 1016)} is VALID [2022-04-15 12:26:14,927 INFO L290 TraceCheckUtils]: 121: Hoare triple {125034#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125027#(< main_~i~0 1016)} is VALID [2022-04-15 12:26:14,927 INFO L290 TraceCheckUtils]: 120: Hoare triple {125034#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125034#(< main_~i~0 1015)} is VALID [2022-04-15 12:26:14,928 INFO L290 TraceCheckUtils]: 119: Hoare triple {125041#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125034#(< main_~i~0 1015)} is VALID [2022-04-15 12:26:14,928 INFO L290 TraceCheckUtils]: 118: Hoare triple {125041#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125041#(< main_~i~0 1014)} is VALID [2022-04-15 12:26:14,928 INFO L290 TraceCheckUtils]: 117: Hoare triple {125048#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125041#(< main_~i~0 1014)} is VALID [2022-04-15 12:26:14,929 INFO L290 TraceCheckUtils]: 116: Hoare triple {125048#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125048#(< main_~i~0 1013)} is VALID [2022-04-15 12:26:14,929 INFO L290 TraceCheckUtils]: 115: Hoare triple {125055#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125048#(< main_~i~0 1013)} is VALID [2022-04-15 12:26:14,929 INFO L290 TraceCheckUtils]: 114: Hoare triple {125055#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125055#(< main_~i~0 1012)} is VALID [2022-04-15 12:26:14,929 INFO L290 TraceCheckUtils]: 113: Hoare triple {125062#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125055#(< main_~i~0 1012)} is VALID [2022-04-15 12:26:14,930 INFO L290 TraceCheckUtils]: 112: Hoare triple {125062#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125062#(< main_~i~0 1011)} is VALID [2022-04-15 12:26:14,930 INFO L290 TraceCheckUtils]: 111: Hoare triple {125069#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125062#(< main_~i~0 1011)} is VALID [2022-04-15 12:26:14,930 INFO L290 TraceCheckUtils]: 110: Hoare triple {125069#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125069#(< main_~i~0 1010)} is VALID [2022-04-15 12:26:14,931 INFO L290 TraceCheckUtils]: 109: Hoare triple {125076#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125069#(< main_~i~0 1010)} is VALID [2022-04-15 12:26:14,931 INFO L290 TraceCheckUtils]: 108: Hoare triple {125076#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125076#(< main_~i~0 1009)} is VALID [2022-04-15 12:26:14,931 INFO L290 TraceCheckUtils]: 107: Hoare triple {125083#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125076#(< main_~i~0 1009)} is VALID [2022-04-15 12:26:14,931 INFO L290 TraceCheckUtils]: 106: Hoare triple {125083#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125083#(< main_~i~0 1008)} is VALID [2022-04-15 12:26:14,932 INFO L290 TraceCheckUtils]: 105: Hoare triple {125090#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125083#(< main_~i~0 1008)} is VALID [2022-04-15 12:26:14,932 INFO L290 TraceCheckUtils]: 104: Hoare triple {125090#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125090#(< main_~i~0 1007)} is VALID [2022-04-15 12:26:14,932 INFO L290 TraceCheckUtils]: 103: Hoare triple {125097#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125090#(< main_~i~0 1007)} is VALID [2022-04-15 12:26:14,932 INFO L290 TraceCheckUtils]: 102: Hoare triple {125097#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125097#(< main_~i~0 1006)} is VALID [2022-04-15 12:26:14,933 INFO L290 TraceCheckUtils]: 101: Hoare triple {125104#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125097#(< main_~i~0 1006)} is VALID [2022-04-15 12:26:14,933 INFO L290 TraceCheckUtils]: 100: Hoare triple {125104#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125104#(< main_~i~0 1005)} is VALID [2022-04-15 12:26:14,933 INFO L290 TraceCheckUtils]: 99: Hoare triple {125111#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125104#(< main_~i~0 1005)} is VALID [2022-04-15 12:26:14,934 INFO L290 TraceCheckUtils]: 98: Hoare triple {125111#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125111#(< main_~i~0 1004)} is VALID [2022-04-15 12:26:14,934 INFO L290 TraceCheckUtils]: 97: Hoare triple {125118#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125111#(< main_~i~0 1004)} is VALID [2022-04-15 12:26:14,934 INFO L290 TraceCheckUtils]: 96: Hoare triple {125118#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125118#(< main_~i~0 1003)} is VALID [2022-04-15 12:26:14,934 INFO L290 TraceCheckUtils]: 95: Hoare triple {125125#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125118#(< main_~i~0 1003)} is VALID [2022-04-15 12:26:14,935 INFO L290 TraceCheckUtils]: 94: Hoare triple {125125#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125125#(< main_~i~0 1002)} is VALID [2022-04-15 12:26:14,935 INFO L290 TraceCheckUtils]: 93: Hoare triple {125132#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125125#(< main_~i~0 1002)} is VALID [2022-04-15 12:26:14,935 INFO L290 TraceCheckUtils]: 92: Hoare triple {125132#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125132#(< main_~i~0 1001)} is VALID [2022-04-15 12:26:14,936 INFO L290 TraceCheckUtils]: 91: Hoare triple {125139#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125132#(< main_~i~0 1001)} is VALID [2022-04-15 12:26:14,936 INFO L290 TraceCheckUtils]: 90: Hoare triple {125139#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125139#(< main_~i~0 1000)} is VALID [2022-04-15 12:26:14,936 INFO L290 TraceCheckUtils]: 89: Hoare triple {125146#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125139#(< main_~i~0 1000)} is VALID [2022-04-15 12:26:14,936 INFO L290 TraceCheckUtils]: 88: Hoare triple {125146#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125146#(< main_~i~0 999)} is VALID [2022-04-15 12:26:14,937 INFO L290 TraceCheckUtils]: 87: Hoare triple {125153#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125146#(< main_~i~0 999)} is VALID [2022-04-15 12:26:14,937 INFO L290 TraceCheckUtils]: 86: Hoare triple {125153#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125153#(< main_~i~0 998)} is VALID [2022-04-15 12:26:14,937 INFO L290 TraceCheckUtils]: 85: Hoare triple {125160#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125153#(< main_~i~0 998)} is VALID [2022-04-15 12:26:14,937 INFO L290 TraceCheckUtils]: 84: Hoare triple {125160#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125160#(< main_~i~0 997)} is VALID [2022-04-15 12:26:14,938 INFO L290 TraceCheckUtils]: 83: Hoare triple {125167#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125160#(< main_~i~0 997)} is VALID [2022-04-15 12:26:14,938 INFO L290 TraceCheckUtils]: 82: Hoare triple {125167#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125167#(< main_~i~0 996)} is VALID [2022-04-15 12:26:14,938 INFO L290 TraceCheckUtils]: 81: Hoare triple {125174#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125167#(< main_~i~0 996)} is VALID [2022-04-15 12:26:14,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {125174#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125174#(< main_~i~0 995)} is VALID [2022-04-15 12:26:14,939 INFO L290 TraceCheckUtils]: 79: Hoare triple {125181#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125174#(< main_~i~0 995)} is VALID [2022-04-15 12:26:14,939 INFO L290 TraceCheckUtils]: 78: Hoare triple {125181#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125181#(< main_~i~0 994)} is VALID [2022-04-15 12:26:14,939 INFO L290 TraceCheckUtils]: 77: Hoare triple {125188#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125181#(< main_~i~0 994)} is VALID [2022-04-15 12:26:14,940 INFO L290 TraceCheckUtils]: 76: Hoare triple {125188#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125188#(< main_~i~0 993)} is VALID [2022-04-15 12:26:14,940 INFO L290 TraceCheckUtils]: 75: Hoare triple {125195#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125188#(< main_~i~0 993)} is VALID [2022-04-15 12:26:14,940 INFO L290 TraceCheckUtils]: 74: Hoare triple {125195#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125195#(< main_~i~0 992)} is VALID [2022-04-15 12:26:14,941 INFO L290 TraceCheckUtils]: 73: Hoare triple {125202#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125195#(< main_~i~0 992)} is VALID [2022-04-15 12:26:14,941 INFO L290 TraceCheckUtils]: 72: Hoare triple {125202#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125202#(< main_~i~0 991)} is VALID [2022-04-15 12:26:14,941 INFO L290 TraceCheckUtils]: 71: Hoare triple {125209#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125202#(< main_~i~0 991)} is VALID [2022-04-15 12:26:14,941 INFO L290 TraceCheckUtils]: 70: Hoare triple {125209#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125209#(< main_~i~0 990)} is VALID [2022-04-15 12:26:14,942 INFO L290 TraceCheckUtils]: 69: Hoare triple {125216#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125209#(< main_~i~0 990)} is VALID [2022-04-15 12:26:14,942 INFO L290 TraceCheckUtils]: 68: Hoare triple {125216#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125216#(< main_~i~0 989)} is VALID [2022-04-15 12:26:14,942 INFO L290 TraceCheckUtils]: 67: Hoare triple {125223#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125216#(< main_~i~0 989)} is VALID [2022-04-15 12:26:14,943 INFO L290 TraceCheckUtils]: 66: Hoare triple {125223#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125223#(< main_~i~0 988)} is VALID [2022-04-15 12:26:14,943 INFO L290 TraceCheckUtils]: 65: Hoare triple {125230#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125223#(< main_~i~0 988)} is VALID [2022-04-15 12:26:14,943 INFO L290 TraceCheckUtils]: 64: Hoare triple {125230#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125230#(< main_~i~0 987)} is VALID [2022-04-15 12:26:14,943 INFO L290 TraceCheckUtils]: 63: Hoare triple {125237#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125230#(< main_~i~0 987)} is VALID [2022-04-15 12:26:14,944 INFO L290 TraceCheckUtils]: 62: Hoare triple {125237#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125237#(< main_~i~0 986)} is VALID [2022-04-15 12:26:14,944 INFO L290 TraceCheckUtils]: 61: Hoare triple {125244#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125237#(< main_~i~0 986)} is VALID [2022-04-15 12:26:14,944 INFO L290 TraceCheckUtils]: 60: Hoare triple {125244#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125244#(< main_~i~0 985)} is VALID [2022-04-15 12:26:14,944 INFO L290 TraceCheckUtils]: 59: Hoare triple {125251#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125244#(< main_~i~0 985)} is VALID [2022-04-15 12:26:14,945 INFO L290 TraceCheckUtils]: 58: Hoare triple {125251#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125251#(< main_~i~0 984)} is VALID [2022-04-15 12:26:14,945 INFO L290 TraceCheckUtils]: 57: Hoare triple {125258#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125251#(< main_~i~0 984)} is VALID [2022-04-15 12:26:14,945 INFO L290 TraceCheckUtils]: 56: Hoare triple {125258#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125258#(< main_~i~0 983)} is VALID [2022-04-15 12:26:14,946 INFO L290 TraceCheckUtils]: 55: Hoare triple {125265#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125258#(< main_~i~0 983)} is VALID [2022-04-15 12:26:14,946 INFO L290 TraceCheckUtils]: 54: Hoare triple {125265#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125265#(< main_~i~0 982)} is VALID [2022-04-15 12:26:14,946 INFO L290 TraceCheckUtils]: 53: Hoare triple {125272#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125265#(< main_~i~0 982)} is VALID [2022-04-15 12:26:14,946 INFO L290 TraceCheckUtils]: 52: Hoare triple {125272#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125272#(< main_~i~0 981)} is VALID [2022-04-15 12:26:14,947 INFO L290 TraceCheckUtils]: 51: Hoare triple {125279#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125272#(< main_~i~0 981)} is VALID [2022-04-15 12:26:14,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {125279#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125279#(< main_~i~0 980)} is VALID [2022-04-15 12:26:14,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {125286#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125279#(< main_~i~0 980)} is VALID [2022-04-15 12:26:14,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {125286#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125286#(< main_~i~0 979)} is VALID [2022-04-15 12:26:14,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {125293#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125286#(< main_~i~0 979)} is VALID [2022-04-15 12:26:14,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {125293#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125293#(< main_~i~0 978)} is VALID [2022-04-15 12:26:14,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {125300#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125293#(< main_~i~0 978)} is VALID [2022-04-15 12:26:14,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {125300#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125300#(< main_~i~0 977)} is VALID [2022-04-15 12:26:14,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {125307#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125300#(< main_~i~0 977)} is VALID [2022-04-15 12:26:14,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {125307#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125307#(< main_~i~0 976)} is VALID [2022-04-15 12:26:14,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {125314#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125307#(< main_~i~0 976)} is VALID [2022-04-15 12:26:14,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {125314#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125314#(< main_~i~0 975)} is VALID [2022-04-15 12:26:14,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {125321#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125314#(< main_~i~0 975)} is VALID [2022-04-15 12:26:14,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {125321#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125321#(< main_~i~0 974)} is VALID [2022-04-15 12:26:14,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {125328#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125321#(< main_~i~0 974)} is VALID [2022-04-15 12:26:14,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {125328#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125328#(< main_~i~0 973)} is VALID [2022-04-15 12:26:14,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {125335#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125328#(< main_~i~0 973)} is VALID [2022-04-15 12:26:14,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {125335#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125335#(< main_~i~0 972)} is VALID [2022-04-15 12:26:14,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {125342#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125335#(< main_~i~0 972)} is VALID [2022-04-15 12:26:14,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {125342#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125342#(< main_~i~0 971)} is VALID [2022-04-15 12:26:14,952 INFO L290 TraceCheckUtils]: 31: Hoare triple {125349#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125342#(< main_~i~0 971)} is VALID [2022-04-15 12:26:14,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {125349#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125349#(< main_~i~0 970)} is VALID [2022-04-15 12:26:14,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {125356#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125349#(< main_~i~0 970)} is VALID [2022-04-15 12:26:14,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {125356#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125356#(< main_~i~0 969)} is VALID [2022-04-15 12:26:14,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {125363#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125356#(< main_~i~0 969)} is VALID [2022-04-15 12:26:14,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {125363#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125363#(< main_~i~0 968)} is VALID [2022-04-15 12:26:14,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {125370#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125363#(< main_~i~0 968)} is VALID [2022-04-15 12:26:14,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {125370#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125370#(< main_~i~0 967)} is VALID [2022-04-15 12:26:14,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {125377#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125370#(< main_~i~0 967)} is VALID [2022-04-15 12:26:14,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {125377#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125377#(< main_~i~0 966)} is VALID [2022-04-15 12:26:14,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {125384#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125377#(< main_~i~0 966)} is VALID [2022-04-15 12:26:14,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {125384#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125384#(< main_~i~0 965)} is VALID [2022-04-15 12:26:14,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {125391#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125384#(< main_~i~0 965)} is VALID [2022-04-15 12:26:14,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {125391#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125391#(< main_~i~0 964)} is VALID [2022-04-15 12:26:14,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {125398#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125391#(< main_~i~0 964)} is VALID [2022-04-15 12:26:14,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {125398#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125398#(< main_~i~0 963)} is VALID [2022-04-15 12:26:14,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {125405#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125398#(< main_~i~0 963)} is VALID [2022-04-15 12:26:14,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {125405#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125405#(< main_~i~0 962)} is VALID [2022-04-15 12:26:14,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {125412#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125405#(< main_~i~0 962)} is VALID [2022-04-15 12:26:14,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {125412#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125412#(< main_~i~0 961)} is VALID [2022-04-15 12:26:14,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {125419#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125412#(< main_~i~0 961)} is VALID [2022-04-15 12:26:14,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {125419#(< main_~i~0 960)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125419#(< main_~i~0 960)} is VALID [2022-04-15 12:26:14,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {125426#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125419#(< main_~i~0 960)} is VALID [2022-04-15 12:26:14,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {125426#(< main_~i~0 959)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125426#(< main_~i~0 959)} is VALID [2022-04-15 12:26:14,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {125433#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125426#(< main_~i~0 959)} is VALID [2022-04-15 12:26:14,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {125433#(< main_~i~0 958)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125433#(< main_~i~0 958)} is VALID [2022-04-15 12:26:14,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {124387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {125433#(< main_~i~0 958)} is VALID [2022-04-15 12:26:14,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {124387#true} call #t~ret6 := main(); {124387#true} is VALID [2022-04-15 12:26:14,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124387#true} {124387#true} #64#return; {124387#true} is VALID [2022-04-15 12:26:14,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {124387#true} assume true; {124387#true} is VALID [2022-04-15 12:26:14,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {124387#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {124387#true} is VALID [2022-04-15 12:26:14,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {124387#true} call ULTIMATE.init(); {124387#true} is VALID [2022-04-15 12:26:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:26:14,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462028946] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:26:14,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:26:14,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 69, 69] total 138 [2022-04-15 12:26:14,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:26:14,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [172002764] [2022-04-15 12:26:14,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [172002764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:26:14,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:26:14,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-04-15 12:26:14,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705297869] [2022-04-15 12:26:14,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:26:14,961 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 69 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2022-04-15 12:26:14,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:26:14,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 69 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:15,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:26:15,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-15 12:26:15,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:26:15,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-15 12:26:15,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9318, Invalid=9588, Unknown=0, NotChecked=0, Total=18906 [2022-04-15 12:26:15,047 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand has 70 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 69 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:33,523 INFO L93 Difference]: Finished difference Result 502 states and 640 transitions. [2022-04-15 12:26:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-04-15 12:26:33,523 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 69 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2022-04-15 12:26:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:26:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 69 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 631 transitions. [2022-04-15 12:26:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 69 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 631 transitions. [2022-04-15 12:26:33,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 631 transitions. [2022-04-15 12:26:33,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:26:33,933 INFO L225 Difference]: With dead ends: 502 [2022-04-15 12:26:33,933 INFO L226 Difference]: Without dead ends: 485 [2022-04-15 12:26:33,935 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2606 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=18498, Invalid=23322, Unknown=0, NotChecked=0, Total=41820 [2022-04-15 12:26:33,935 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1554 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:26:33,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1554 Valid, 62 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:26:33,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-04-15 12:26:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 158. [2022-04-15 12:26:35,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:26:35,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 485 states. Second operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:35,021 INFO L74 IsIncluded]: Start isIncluded. First operand 485 states. Second operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:35,021 INFO L87 Difference]: Start difference. First operand 485 states. Second operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:35,029 INFO L93 Difference]: Finished difference Result 485 states and 619 transitions. [2022-04-15 12:26:35,029 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 619 transitions. [2022-04-15 12:26:35,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:26:35,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:26:35,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 485 states. [2022-04-15 12:26:35,030 INFO L87 Difference]: Start difference. First operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 485 states. [2022-04-15 12:26:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:35,037 INFO L93 Difference]: Finished difference Result 485 states and 619 transitions. [2022-04-15 12:26:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 619 transitions. [2022-04-15 12:26:35,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:26:35,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:26:35,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:26:35,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:26:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 162 transitions. [2022-04-15 12:26:35,039 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 162 transitions. Word has length 155 [2022-04-15 12:26:35,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:26:35,040 INFO L478 AbstractCegarLoop]: Abstraction has 158 states and 162 transitions. [2022-04-15 12:26:35,040 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 69 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:35,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 158 states and 162 transitions. [2022-04-15 12:26:35,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:26:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2022-04-15 12:26:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-15 12:26:35,491 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:26:35,492 INFO L499 BasicCegarLoop]: trace histogram [67, 67, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:26:35,509 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:26:35,692 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:26:35,692 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:26:35,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:26:35,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1264850071, now seen corresponding path program 135 times [2022-04-15 12:26:35,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:26:35,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2092547485] [2022-04-15 12:26:35,696 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:26:35,696 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:26:35,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1264850071, now seen corresponding path program 136 times [2022-04-15 12:26:35,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:26:35,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142777818] [2022-04-15 12:26:35,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:26:35,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:26:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:37,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:26:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:37,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {127954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {127881#true} is VALID [2022-04-15 12:26:37,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {127881#true} assume true; {127881#true} is VALID [2022-04-15 12:26:37,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127881#true} {127881#true} #64#return; {127881#true} is VALID [2022-04-15 12:26:37,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {127881#true} call ULTIMATE.init(); {127954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:26:37,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {127954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {127881#true} is VALID [2022-04-15 12:26:37,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {127881#true} assume true; {127881#true} is VALID [2022-04-15 12:26:37,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127881#true} {127881#true} #64#return; {127881#true} is VALID [2022-04-15 12:26:37,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {127881#true} call #t~ret6 := main(); {127881#true} is VALID [2022-04-15 12:26:37,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {127881#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {127886#(= main_~i~0 0)} is VALID [2022-04-15 12:26:37,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {127886#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127886#(= main_~i~0 0)} is VALID [2022-04-15 12:26:37,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {127886#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127887#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:37,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {127887#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127887#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:37,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {127887#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127888#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:37,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {127888#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127888#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:37,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {127888#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127889#(<= main_~i~0 3)} is VALID [2022-04-15 12:26:37,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {127889#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127889#(<= main_~i~0 3)} is VALID [2022-04-15 12:26:37,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {127889#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127890#(<= main_~i~0 4)} is VALID [2022-04-15 12:26:37,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {127890#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127890#(<= main_~i~0 4)} is VALID [2022-04-15 12:26:37,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {127890#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127891#(<= main_~i~0 5)} is VALID [2022-04-15 12:26:37,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {127891#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127891#(<= main_~i~0 5)} is VALID [2022-04-15 12:26:37,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {127891#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127892#(<= main_~i~0 6)} is VALID [2022-04-15 12:26:37,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {127892#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127892#(<= main_~i~0 6)} is VALID [2022-04-15 12:26:37,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {127892#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127893#(<= main_~i~0 7)} is VALID [2022-04-15 12:26:37,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {127893#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127893#(<= main_~i~0 7)} is VALID [2022-04-15 12:26:37,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {127893#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127894#(<= main_~i~0 8)} is VALID [2022-04-15 12:26:37,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {127894#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127894#(<= main_~i~0 8)} is VALID [2022-04-15 12:26:37,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {127894#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127895#(<= main_~i~0 9)} is VALID [2022-04-15 12:26:37,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {127895#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127895#(<= main_~i~0 9)} is VALID [2022-04-15 12:26:37,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {127895#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127896#(<= main_~i~0 10)} is VALID [2022-04-15 12:26:37,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {127896#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127896#(<= main_~i~0 10)} is VALID [2022-04-15 12:26:37,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {127896#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127897#(<= main_~i~0 11)} is VALID [2022-04-15 12:26:37,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {127897#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127897#(<= main_~i~0 11)} is VALID [2022-04-15 12:26:37,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {127897#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127898#(<= main_~i~0 12)} is VALID [2022-04-15 12:26:37,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {127898#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127898#(<= main_~i~0 12)} is VALID [2022-04-15 12:26:37,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {127898#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127899#(<= main_~i~0 13)} is VALID [2022-04-15 12:26:37,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {127899#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127899#(<= main_~i~0 13)} is VALID [2022-04-15 12:26:37,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {127899#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127900#(<= main_~i~0 14)} is VALID [2022-04-15 12:26:37,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {127900#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127900#(<= main_~i~0 14)} is VALID [2022-04-15 12:26:37,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {127900#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127901#(<= main_~i~0 15)} is VALID [2022-04-15 12:26:37,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {127901#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127901#(<= main_~i~0 15)} is VALID [2022-04-15 12:26:37,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {127901#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127902#(<= main_~i~0 16)} is VALID [2022-04-15 12:26:37,154 INFO L290 TraceCheckUtils]: 38: Hoare triple {127902#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127902#(<= main_~i~0 16)} is VALID [2022-04-15 12:26:37,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {127902#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127903#(<= main_~i~0 17)} is VALID [2022-04-15 12:26:37,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {127903#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127903#(<= main_~i~0 17)} is VALID [2022-04-15 12:26:37,155 INFO L290 TraceCheckUtils]: 41: Hoare triple {127903#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127904#(<= main_~i~0 18)} is VALID [2022-04-15 12:26:37,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {127904#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127904#(<= main_~i~0 18)} is VALID [2022-04-15 12:26:37,155 INFO L290 TraceCheckUtils]: 43: Hoare triple {127904#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127905#(<= main_~i~0 19)} is VALID [2022-04-15 12:26:37,156 INFO L290 TraceCheckUtils]: 44: Hoare triple {127905#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127905#(<= main_~i~0 19)} is VALID [2022-04-15 12:26:37,156 INFO L290 TraceCheckUtils]: 45: Hoare triple {127905#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127906#(<= main_~i~0 20)} is VALID [2022-04-15 12:26:37,156 INFO L290 TraceCheckUtils]: 46: Hoare triple {127906#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127906#(<= main_~i~0 20)} is VALID [2022-04-15 12:26:37,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {127906#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127907#(<= main_~i~0 21)} is VALID [2022-04-15 12:26:37,157 INFO L290 TraceCheckUtils]: 48: Hoare triple {127907#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127907#(<= main_~i~0 21)} is VALID [2022-04-15 12:26:37,157 INFO L290 TraceCheckUtils]: 49: Hoare triple {127907#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127908#(<= main_~i~0 22)} is VALID [2022-04-15 12:26:37,157 INFO L290 TraceCheckUtils]: 50: Hoare triple {127908#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127908#(<= main_~i~0 22)} is VALID [2022-04-15 12:26:37,158 INFO L290 TraceCheckUtils]: 51: Hoare triple {127908#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127909#(<= main_~i~0 23)} is VALID [2022-04-15 12:26:37,158 INFO L290 TraceCheckUtils]: 52: Hoare triple {127909#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127909#(<= main_~i~0 23)} is VALID [2022-04-15 12:26:37,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {127909#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127910#(<= main_~i~0 24)} is VALID [2022-04-15 12:26:37,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {127910#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127910#(<= main_~i~0 24)} is VALID [2022-04-15 12:26:37,159 INFO L290 TraceCheckUtils]: 55: Hoare triple {127910#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127911#(<= main_~i~0 25)} is VALID [2022-04-15 12:26:37,159 INFO L290 TraceCheckUtils]: 56: Hoare triple {127911#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127911#(<= main_~i~0 25)} is VALID [2022-04-15 12:26:37,159 INFO L290 TraceCheckUtils]: 57: Hoare triple {127911#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127912#(<= main_~i~0 26)} is VALID [2022-04-15 12:26:37,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {127912#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127912#(<= main_~i~0 26)} is VALID [2022-04-15 12:26:37,160 INFO L290 TraceCheckUtils]: 59: Hoare triple {127912#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127913#(<= main_~i~0 27)} is VALID [2022-04-15 12:26:37,160 INFO L290 TraceCheckUtils]: 60: Hoare triple {127913#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127913#(<= main_~i~0 27)} is VALID [2022-04-15 12:26:37,160 INFO L290 TraceCheckUtils]: 61: Hoare triple {127913#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127914#(<= main_~i~0 28)} is VALID [2022-04-15 12:26:37,160 INFO L290 TraceCheckUtils]: 62: Hoare triple {127914#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127914#(<= main_~i~0 28)} is VALID [2022-04-15 12:26:37,161 INFO L290 TraceCheckUtils]: 63: Hoare triple {127914#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127915#(<= main_~i~0 29)} is VALID [2022-04-15 12:26:37,161 INFO L290 TraceCheckUtils]: 64: Hoare triple {127915#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127915#(<= main_~i~0 29)} is VALID [2022-04-15 12:26:37,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {127915#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127916#(<= main_~i~0 30)} is VALID [2022-04-15 12:26:37,162 INFO L290 TraceCheckUtils]: 66: Hoare triple {127916#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127916#(<= main_~i~0 30)} is VALID [2022-04-15 12:26:37,162 INFO L290 TraceCheckUtils]: 67: Hoare triple {127916#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127917#(<= main_~i~0 31)} is VALID [2022-04-15 12:26:37,162 INFO L290 TraceCheckUtils]: 68: Hoare triple {127917#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127917#(<= main_~i~0 31)} is VALID [2022-04-15 12:26:37,162 INFO L290 TraceCheckUtils]: 69: Hoare triple {127917#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127918#(<= main_~i~0 32)} is VALID [2022-04-15 12:26:37,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {127918#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127918#(<= main_~i~0 32)} is VALID [2022-04-15 12:26:37,163 INFO L290 TraceCheckUtils]: 71: Hoare triple {127918#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127919#(<= main_~i~0 33)} is VALID [2022-04-15 12:26:37,163 INFO L290 TraceCheckUtils]: 72: Hoare triple {127919#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127919#(<= main_~i~0 33)} is VALID [2022-04-15 12:26:37,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {127919#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127920#(<= main_~i~0 34)} is VALID [2022-04-15 12:26:37,164 INFO L290 TraceCheckUtils]: 74: Hoare triple {127920#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127920#(<= main_~i~0 34)} is VALID [2022-04-15 12:26:37,164 INFO L290 TraceCheckUtils]: 75: Hoare triple {127920#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127921#(<= main_~i~0 35)} is VALID [2022-04-15 12:26:37,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {127921#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127921#(<= main_~i~0 35)} is VALID [2022-04-15 12:26:37,165 INFO L290 TraceCheckUtils]: 77: Hoare triple {127921#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127922#(<= main_~i~0 36)} is VALID [2022-04-15 12:26:37,165 INFO L290 TraceCheckUtils]: 78: Hoare triple {127922#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127922#(<= main_~i~0 36)} is VALID [2022-04-15 12:26:37,165 INFO L290 TraceCheckUtils]: 79: Hoare triple {127922#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127923#(<= main_~i~0 37)} is VALID [2022-04-15 12:26:37,165 INFO L290 TraceCheckUtils]: 80: Hoare triple {127923#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127923#(<= main_~i~0 37)} is VALID [2022-04-15 12:26:37,166 INFO L290 TraceCheckUtils]: 81: Hoare triple {127923#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127924#(<= main_~i~0 38)} is VALID [2022-04-15 12:26:37,166 INFO L290 TraceCheckUtils]: 82: Hoare triple {127924#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127924#(<= main_~i~0 38)} is VALID [2022-04-15 12:26:37,166 INFO L290 TraceCheckUtils]: 83: Hoare triple {127924#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127925#(<= main_~i~0 39)} is VALID [2022-04-15 12:26:37,166 INFO L290 TraceCheckUtils]: 84: Hoare triple {127925#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127925#(<= main_~i~0 39)} is VALID [2022-04-15 12:26:37,167 INFO L290 TraceCheckUtils]: 85: Hoare triple {127925#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127926#(<= main_~i~0 40)} is VALID [2022-04-15 12:26:37,167 INFO L290 TraceCheckUtils]: 86: Hoare triple {127926#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127926#(<= main_~i~0 40)} is VALID [2022-04-15 12:26:37,167 INFO L290 TraceCheckUtils]: 87: Hoare triple {127926#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127927#(<= main_~i~0 41)} is VALID [2022-04-15 12:26:37,168 INFO L290 TraceCheckUtils]: 88: Hoare triple {127927#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127927#(<= main_~i~0 41)} is VALID [2022-04-15 12:26:37,168 INFO L290 TraceCheckUtils]: 89: Hoare triple {127927#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127928#(<= main_~i~0 42)} is VALID [2022-04-15 12:26:37,168 INFO L290 TraceCheckUtils]: 90: Hoare triple {127928#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127928#(<= main_~i~0 42)} is VALID [2022-04-15 12:26:37,168 INFO L290 TraceCheckUtils]: 91: Hoare triple {127928#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127929#(<= main_~i~0 43)} is VALID [2022-04-15 12:26:37,169 INFO L290 TraceCheckUtils]: 92: Hoare triple {127929#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127929#(<= main_~i~0 43)} is VALID [2022-04-15 12:26:37,169 INFO L290 TraceCheckUtils]: 93: Hoare triple {127929#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127930#(<= main_~i~0 44)} is VALID [2022-04-15 12:26:37,169 INFO L290 TraceCheckUtils]: 94: Hoare triple {127930#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127930#(<= main_~i~0 44)} is VALID [2022-04-15 12:26:37,169 INFO L290 TraceCheckUtils]: 95: Hoare triple {127930#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127931#(<= main_~i~0 45)} is VALID [2022-04-15 12:26:37,170 INFO L290 TraceCheckUtils]: 96: Hoare triple {127931#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127931#(<= main_~i~0 45)} is VALID [2022-04-15 12:26:37,170 INFO L290 TraceCheckUtils]: 97: Hoare triple {127931#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127932#(<= main_~i~0 46)} is VALID [2022-04-15 12:26:37,170 INFO L290 TraceCheckUtils]: 98: Hoare triple {127932#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127932#(<= main_~i~0 46)} is VALID [2022-04-15 12:26:37,171 INFO L290 TraceCheckUtils]: 99: Hoare triple {127932#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127933#(<= main_~i~0 47)} is VALID [2022-04-15 12:26:37,171 INFO L290 TraceCheckUtils]: 100: Hoare triple {127933#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127933#(<= main_~i~0 47)} is VALID [2022-04-15 12:26:37,171 INFO L290 TraceCheckUtils]: 101: Hoare triple {127933#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127934#(<= main_~i~0 48)} is VALID [2022-04-15 12:26:37,171 INFO L290 TraceCheckUtils]: 102: Hoare triple {127934#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127934#(<= main_~i~0 48)} is VALID [2022-04-15 12:26:37,172 INFO L290 TraceCheckUtils]: 103: Hoare triple {127934#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127935#(<= main_~i~0 49)} is VALID [2022-04-15 12:26:37,172 INFO L290 TraceCheckUtils]: 104: Hoare triple {127935#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127935#(<= main_~i~0 49)} is VALID [2022-04-15 12:26:37,172 INFO L290 TraceCheckUtils]: 105: Hoare triple {127935#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127936#(<= main_~i~0 50)} is VALID [2022-04-15 12:26:37,172 INFO L290 TraceCheckUtils]: 106: Hoare triple {127936#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127936#(<= main_~i~0 50)} is VALID [2022-04-15 12:26:37,173 INFO L290 TraceCheckUtils]: 107: Hoare triple {127936#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127937#(<= main_~i~0 51)} is VALID [2022-04-15 12:26:37,173 INFO L290 TraceCheckUtils]: 108: Hoare triple {127937#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127937#(<= main_~i~0 51)} is VALID [2022-04-15 12:26:37,173 INFO L290 TraceCheckUtils]: 109: Hoare triple {127937#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127938#(<= main_~i~0 52)} is VALID [2022-04-15 12:26:37,173 INFO L290 TraceCheckUtils]: 110: Hoare triple {127938#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127938#(<= main_~i~0 52)} is VALID [2022-04-15 12:26:37,174 INFO L290 TraceCheckUtils]: 111: Hoare triple {127938#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127939#(<= main_~i~0 53)} is VALID [2022-04-15 12:26:37,174 INFO L290 TraceCheckUtils]: 112: Hoare triple {127939#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127939#(<= main_~i~0 53)} is VALID [2022-04-15 12:26:37,174 INFO L290 TraceCheckUtils]: 113: Hoare triple {127939#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127940#(<= main_~i~0 54)} is VALID [2022-04-15 12:26:37,175 INFO L290 TraceCheckUtils]: 114: Hoare triple {127940#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127940#(<= main_~i~0 54)} is VALID [2022-04-15 12:26:37,175 INFO L290 TraceCheckUtils]: 115: Hoare triple {127940#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127941#(<= main_~i~0 55)} is VALID [2022-04-15 12:26:37,175 INFO L290 TraceCheckUtils]: 116: Hoare triple {127941#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127941#(<= main_~i~0 55)} is VALID [2022-04-15 12:26:37,175 INFO L290 TraceCheckUtils]: 117: Hoare triple {127941#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127942#(<= main_~i~0 56)} is VALID [2022-04-15 12:26:37,176 INFO L290 TraceCheckUtils]: 118: Hoare triple {127942#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127942#(<= main_~i~0 56)} is VALID [2022-04-15 12:26:37,176 INFO L290 TraceCheckUtils]: 119: Hoare triple {127942#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127943#(<= main_~i~0 57)} is VALID [2022-04-15 12:26:37,176 INFO L290 TraceCheckUtils]: 120: Hoare triple {127943#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127943#(<= main_~i~0 57)} is VALID [2022-04-15 12:26:37,177 INFO L290 TraceCheckUtils]: 121: Hoare triple {127943#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127944#(<= main_~i~0 58)} is VALID [2022-04-15 12:26:37,177 INFO L290 TraceCheckUtils]: 122: Hoare triple {127944#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127944#(<= main_~i~0 58)} is VALID [2022-04-15 12:26:37,177 INFO L290 TraceCheckUtils]: 123: Hoare triple {127944#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127945#(<= main_~i~0 59)} is VALID [2022-04-15 12:26:37,177 INFO L290 TraceCheckUtils]: 124: Hoare triple {127945#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127945#(<= main_~i~0 59)} is VALID [2022-04-15 12:26:37,178 INFO L290 TraceCheckUtils]: 125: Hoare triple {127945#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127946#(<= main_~i~0 60)} is VALID [2022-04-15 12:26:37,178 INFO L290 TraceCheckUtils]: 126: Hoare triple {127946#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127946#(<= main_~i~0 60)} is VALID [2022-04-15 12:26:37,178 INFO L290 TraceCheckUtils]: 127: Hoare triple {127946#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127947#(<= main_~i~0 61)} is VALID [2022-04-15 12:26:37,178 INFO L290 TraceCheckUtils]: 128: Hoare triple {127947#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127947#(<= main_~i~0 61)} is VALID [2022-04-15 12:26:37,179 INFO L290 TraceCheckUtils]: 129: Hoare triple {127947#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127948#(<= main_~i~0 62)} is VALID [2022-04-15 12:26:37,179 INFO L290 TraceCheckUtils]: 130: Hoare triple {127948#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127948#(<= main_~i~0 62)} is VALID [2022-04-15 12:26:37,179 INFO L290 TraceCheckUtils]: 131: Hoare triple {127948#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127949#(<= main_~i~0 63)} is VALID [2022-04-15 12:26:37,179 INFO L290 TraceCheckUtils]: 132: Hoare triple {127949#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127949#(<= main_~i~0 63)} is VALID [2022-04-15 12:26:37,180 INFO L290 TraceCheckUtils]: 133: Hoare triple {127949#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127950#(<= main_~i~0 64)} is VALID [2022-04-15 12:26:37,180 INFO L290 TraceCheckUtils]: 134: Hoare triple {127950#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127950#(<= main_~i~0 64)} is VALID [2022-04-15 12:26:37,180 INFO L290 TraceCheckUtils]: 135: Hoare triple {127950#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127951#(<= main_~i~0 65)} is VALID [2022-04-15 12:26:37,181 INFO L290 TraceCheckUtils]: 136: Hoare triple {127951#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127951#(<= main_~i~0 65)} is VALID [2022-04-15 12:26:37,181 INFO L290 TraceCheckUtils]: 137: Hoare triple {127951#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127952#(<= main_~i~0 66)} is VALID [2022-04-15 12:26:37,181 INFO L290 TraceCheckUtils]: 138: Hoare triple {127952#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127952#(<= main_~i~0 66)} is VALID [2022-04-15 12:26:37,181 INFO L290 TraceCheckUtils]: 139: Hoare triple {127952#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127953#(<= main_~i~0 67)} is VALID [2022-04-15 12:26:37,182 INFO L290 TraceCheckUtils]: 140: Hoare triple {127953#(<= main_~i~0 67)} assume !(~i~0 < 1024); {127882#false} is VALID [2022-04-15 12:26:37,182 INFO L290 TraceCheckUtils]: 141: Hoare triple {127882#false} ~i~0 := 0; {127882#false} is VALID [2022-04-15 12:26:37,182 INFO L290 TraceCheckUtils]: 142: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-15 12:26:37,182 INFO L290 TraceCheckUtils]: 143: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-15 12:26:37,182 INFO L290 TraceCheckUtils]: 144: Hoare triple {127882#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-15 12:26:37,182 INFO L290 TraceCheckUtils]: 145: Hoare triple {127882#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {127882#false} is VALID [2022-04-15 12:26:37,182 INFO L290 TraceCheckUtils]: 146: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-15 12:26:37,182 INFO L290 TraceCheckUtils]: 147: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-15 12:26:37,182 INFO L290 TraceCheckUtils]: 148: Hoare triple {127882#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-15 12:26:37,182 INFO L290 TraceCheckUtils]: 149: Hoare triple {127882#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {127882#false} is VALID [2022-04-15 12:26:37,182 INFO L290 TraceCheckUtils]: 150: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-15 12:26:37,182 INFO L290 TraceCheckUtils]: 151: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-15 12:26:37,182 INFO L290 TraceCheckUtils]: 152: Hoare triple {127882#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-15 12:26:37,182 INFO L272 TraceCheckUtils]: 153: Hoare triple {127882#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {127882#false} is VALID [2022-04-15 12:26:37,182 INFO L290 TraceCheckUtils]: 154: Hoare triple {127882#false} ~cond := #in~cond; {127882#false} is VALID [2022-04-15 12:26:37,183 INFO L290 TraceCheckUtils]: 155: Hoare triple {127882#false} assume 0 == ~cond; {127882#false} is VALID [2022-04-15 12:26:37,183 INFO L290 TraceCheckUtils]: 156: Hoare triple {127882#false} assume !false; {127882#false} is VALID [2022-04-15 12:26:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:26:37,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:26:37,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142777818] [2022-04-15 12:26:37,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142777818] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:26:37,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986928560] [2022-04-15 12:26:37,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:26:37,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:26:37,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:26:37,184 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:26:37,185 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:26:37,626 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:26:37,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:26:37,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-15 12:26:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:37,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:26:38,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {127881#true} call ULTIMATE.init(); {127881#true} is VALID [2022-04-15 12:26:38,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {127881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {127881#true} is VALID [2022-04-15 12:26:38,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {127881#true} assume true; {127881#true} is VALID [2022-04-15 12:26:38,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127881#true} {127881#true} #64#return; {127881#true} is VALID [2022-04-15 12:26:38,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {127881#true} call #t~ret6 := main(); {127881#true} is VALID [2022-04-15 12:26:38,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {127881#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {127973#(<= main_~i~0 0)} is VALID [2022-04-15 12:26:38,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {127973#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127973#(<= main_~i~0 0)} is VALID [2022-04-15 12:26:38,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {127973#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127887#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:38,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {127887#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127887#(<= main_~i~0 1)} is VALID [2022-04-15 12:26:38,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {127887#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127888#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:38,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {127888#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127888#(<= main_~i~0 2)} is VALID [2022-04-15 12:26:38,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {127888#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127889#(<= main_~i~0 3)} is VALID [2022-04-15 12:26:38,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {127889#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127889#(<= main_~i~0 3)} is VALID [2022-04-15 12:26:38,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {127889#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127890#(<= main_~i~0 4)} is VALID [2022-04-15 12:26:38,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {127890#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127890#(<= main_~i~0 4)} is VALID [2022-04-15 12:26:38,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {127890#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127891#(<= main_~i~0 5)} is VALID [2022-04-15 12:26:38,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {127891#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127891#(<= main_~i~0 5)} is VALID [2022-04-15 12:26:38,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {127891#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127892#(<= main_~i~0 6)} is VALID [2022-04-15 12:26:38,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {127892#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127892#(<= main_~i~0 6)} is VALID [2022-04-15 12:26:38,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {127892#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127893#(<= main_~i~0 7)} is VALID [2022-04-15 12:26:38,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {127893#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127893#(<= main_~i~0 7)} is VALID [2022-04-15 12:26:38,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {127893#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127894#(<= main_~i~0 8)} is VALID [2022-04-15 12:26:38,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {127894#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127894#(<= main_~i~0 8)} is VALID [2022-04-15 12:26:38,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {127894#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127895#(<= main_~i~0 9)} is VALID [2022-04-15 12:26:38,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {127895#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127895#(<= main_~i~0 9)} is VALID [2022-04-15 12:26:38,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {127895#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127896#(<= main_~i~0 10)} is VALID [2022-04-15 12:26:38,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {127896#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127896#(<= main_~i~0 10)} is VALID [2022-04-15 12:26:38,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {127896#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127897#(<= main_~i~0 11)} is VALID [2022-04-15 12:26:38,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {127897#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127897#(<= main_~i~0 11)} is VALID [2022-04-15 12:26:38,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {127897#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127898#(<= main_~i~0 12)} is VALID [2022-04-15 12:26:38,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {127898#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127898#(<= main_~i~0 12)} is VALID [2022-04-15 12:26:38,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {127898#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127899#(<= main_~i~0 13)} is VALID [2022-04-15 12:26:38,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {127899#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127899#(<= main_~i~0 13)} is VALID [2022-04-15 12:26:38,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {127899#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127900#(<= main_~i~0 14)} is VALID [2022-04-15 12:26:38,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {127900#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127900#(<= main_~i~0 14)} is VALID [2022-04-15 12:26:38,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {127900#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127901#(<= main_~i~0 15)} is VALID [2022-04-15 12:26:38,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {127901#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127901#(<= main_~i~0 15)} is VALID [2022-04-15 12:26:38,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {127901#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127902#(<= main_~i~0 16)} is VALID [2022-04-15 12:26:38,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {127902#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127902#(<= main_~i~0 16)} is VALID [2022-04-15 12:26:38,413 INFO L290 TraceCheckUtils]: 39: Hoare triple {127902#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127903#(<= main_~i~0 17)} is VALID [2022-04-15 12:26:38,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {127903#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127903#(<= main_~i~0 17)} is VALID [2022-04-15 12:26:38,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {127903#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127904#(<= main_~i~0 18)} is VALID [2022-04-15 12:26:38,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {127904#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127904#(<= main_~i~0 18)} is VALID [2022-04-15 12:26:38,414 INFO L290 TraceCheckUtils]: 43: Hoare triple {127904#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127905#(<= main_~i~0 19)} is VALID [2022-04-15 12:26:38,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {127905#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127905#(<= main_~i~0 19)} is VALID [2022-04-15 12:26:38,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {127905#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127906#(<= main_~i~0 20)} is VALID [2022-04-15 12:26:38,415 INFO L290 TraceCheckUtils]: 46: Hoare triple {127906#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127906#(<= main_~i~0 20)} is VALID [2022-04-15 12:26:38,415 INFO L290 TraceCheckUtils]: 47: Hoare triple {127906#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127907#(<= main_~i~0 21)} is VALID [2022-04-15 12:26:38,415 INFO L290 TraceCheckUtils]: 48: Hoare triple {127907#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127907#(<= main_~i~0 21)} is VALID [2022-04-15 12:26:38,415 INFO L290 TraceCheckUtils]: 49: Hoare triple {127907#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127908#(<= main_~i~0 22)} is VALID [2022-04-15 12:26:38,416 INFO L290 TraceCheckUtils]: 50: Hoare triple {127908#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127908#(<= main_~i~0 22)} is VALID [2022-04-15 12:26:38,416 INFO L290 TraceCheckUtils]: 51: Hoare triple {127908#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127909#(<= main_~i~0 23)} is VALID [2022-04-15 12:26:38,416 INFO L290 TraceCheckUtils]: 52: Hoare triple {127909#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127909#(<= main_~i~0 23)} is VALID [2022-04-15 12:26:38,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {127909#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127910#(<= main_~i~0 24)} is VALID [2022-04-15 12:26:38,417 INFO L290 TraceCheckUtils]: 54: Hoare triple {127910#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127910#(<= main_~i~0 24)} is VALID [2022-04-15 12:26:38,417 INFO L290 TraceCheckUtils]: 55: Hoare triple {127910#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127911#(<= main_~i~0 25)} is VALID [2022-04-15 12:26:38,417 INFO L290 TraceCheckUtils]: 56: Hoare triple {127911#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127911#(<= main_~i~0 25)} is VALID [2022-04-15 12:26:38,418 INFO L290 TraceCheckUtils]: 57: Hoare triple {127911#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127912#(<= main_~i~0 26)} is VALID [2022-04-15 12:26:38,418 INFO L290 TraceCheckUtils]: 58: Hoare triple {127912#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127912#(<= main_~i~0 26)} is VALID [2022-04-15 12:26:38,418 INFO L290 TraceCheckUtils]: 59: Hoare triple {127912#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127913#(<= main_~i~0 27)} is VALID [2022-04-15 12:26:38,418 INFO L290 TraceCheckUtils]: 60: Hoare triple {127913#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127913#(<= main_~i~0 27)} is VALID [2022-04-15 12:26:38,419 INFO L290 TraceCheckUtils]: 61: Hoare triple {127913#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127914#(<= main_~i~0 28)} is VALID [2022-04-15 12:26:38,419 INFO L290 TraceCheckUtils]: 62: Hoare triple {127914#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127914#(<= main_~i~0 28)} is VALID [2022-04-15 12:26:38,419 INFO L290 TraceCheckUtils]: 63: Hoare triple {127914#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127915#(<= main_~i~0 29)} is VALID [2022-04-15 12:26:38,420 INFO L290 TraceCheckUtils]: 64: Hoare triple {127915#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127915#(<= main_~i~0 29)} is VALID [2022-04-15 12:26:38,420 INFO L290 TraceCheckUtils]: 65: Hoare triple {127915#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127916#(<= main_~i~0 30)} is VALID [2022-04-15 12:26:38,420 INFO L290 TraceCheckUtils]: 66: Hoare triple {127916#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127916#(<= main_~i~0 30)} is VALID [2022-04-15 12:26:38,420 INFO L290 TraceCheckUtils]: 67: Hoare triple {127916#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127917#(<= main_~i~0 31)} is VALID [2022-04-15 12:26:38,421 INFO L290 TraceCheckUtils]: 68: Hoare triple {127917#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127917#(<= main_~i~0 31)} is VALID [2022-04-15 12:26:38,421 INFO L290 TraceCheckUtils]: 69: Hoare triple {127917#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127918#(<= main_~i~0 32)} is VALID [2022-04-15 12:26:38,421 INFO L290 TraceCheckUtils]: 70: Hoare triple {127918#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127918#(<= main_~i~0 32)} is VALID [2022-04-15 12:26:38,421 INFO L290 TraceCheckUtils]: 71: Hoare triple {127918#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127919#(<= main_~i~0 33)} is VALID [2022-04-15 12:26:38,422 INFO L290 TraceCheckUtils]: 72: Hoare triple {127919#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127919#(<= main_~i~0 33)} is VALID [2022-04-15 12:26:38,422 INFO L290 TraceCheckUtils]: 73: Hoare triple {127919#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127920#(<= main_~i~0 34)} is VALID [2022-04-15 12:26:38,422 INFO L290 TraceCheckUtils]: 74: Hoare triple {127920#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127920#(<= main_~i~0 34)} is VALID [2022-04-15 12:26:38,423 INFO L290 TraceCheckUtils]: 75: Hoare triple {127920#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127921#(<= main_~i~0 35)} is VALID [2022-04-15 12:26:38,423 INFO L290 TraceCheckUtils]: 76: Hoare triple {127921#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127921#(<= main_~i~0 35)} is VALID [2022-04-15 12:26:38,423 INFO L290 TraceCheckUtils]: 77: Hoare triple {127921#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127922#(<= main_~i~0 36)} is VALID [2022-04-15 12:26:38,423 INFO L290 TraceCheckUtils]: 78: Hoare triple {127922#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127922#(<= main_~i~0 36)} is VALID [2022-04-15 12:26:38,424 INFO L290 TraceCheckUtils]: 79: Hoare triple {127922#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127923#(<= main_~i~0 37)} is VALID [2022-04-15 12:26:38,424 INFO L290 TraceCheckUtils]: 80: Hoare triple {127923#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127923#(<= main_~i~0 37)} is VALID [2022-04-15 12:26:38,424 INFO L290 TraceCheckUtils]: 81: Hoare triple {127923#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127924#(<= main_~i~0 38)} is VALID [2022-04-15 12:26:38,424 INFO L290 TraceCheckUtils]: 82: Hoare triple {127924#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127924#(<= main_~i~0 38)} is VALID [2022-04-15 12:26:38,425 INFO L290 TraceCheckUtils]: 83: Hoare triple {127924#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127925#(<= main_~i~0 39)} is VALID [2022-04-15 12:26:38,425 INFO L290 TraceCheckUtils]: 84: Hoare triple {127925#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127925#(<= main_~i~0 39)} is VALID [2022-04-15 12:26:38,425 INFO L290 TraceCheckUtils]: 85: Hoare triple {127925#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127926#(<= main_~i~0 40)} is VALID [2022-04-15 12:26:38,437 INFO L290 TraceCheckUtils]: 86: Hoare triple {127926#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127926#(<= main_~i~0 40)} is VALID [2022-04-15 12:26:38,438 INFO L290 TraceCheckUtils]: 87: Hoare triple {127926#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127927#(<= main_~i~0 41)} is VALID [2022-04-15 12:26:38,438 INFO L290 TraceCheckUtils]: 88: Hoare triple {127927#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127927#(<= main_~i~0 41)} is VALID [2022-04-15 12:26:38,438 INFO L290 TraceCheckUtils]: 89: Hoare triple {127927#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127928#(<= main_~i~0 42)} is VALID [2022-04-15 12:26:38,438 INFO L290 TraceCheckUtils]: 90: Hoare triple {127928#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127928#(<= main_~i~0 42)} is VALID [2022-04-15 12:26:38,439 INFO L290 TraceCheckUtils]: 91: Hoare triple {127928#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127929#(<= main_~i~0 43)} is VALID [2022-04-15 12:26:38,439 INFO L290 TraceCheckUtils]: 92: Hoare triple {127929#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127929#(<= main_~i~0 43)} is VALID [2022-04-15 12:26:38,439 INFO L290 TraceCheckUtils]: 93: Hoare triple {127929#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127930#(<= main_~i~0 44)} is VALID [2022-04-15 12:26:38,440 INFO L290 TraceCheckUtils]: 94: Hoare triple {127930#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127930#(<= main_~i~0 44)} is VALID [2022-04-15 12:26:38,440 INFO L290 TraceCheckUtils]: 95: Hoare triple {127930#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127931#(<= main_~i~0 45)} is VALID [2022-04-15 12:26:38,440 INFO L290 TraceCheckUtils]: 96: Hoare triple {127931#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127931#(<= main_~i~0 45)} is VALID [2022-04-15 12:26:38,441 INFO L290 TraceCheckUtils]: 97: Hoare triple {127931#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127932#(<= main_~i~0 46)} is VALID [2022-04-15 12:26:38,441 INFO L290 TraceCheckUtils]: 98: Hoare triple {127932#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127932#(<= main_~i~0 46)} is VALID [2022-04-15 12:26:38,441 INFO L290 TraceCheckUtils]: 99: Hoare triple {127932#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127933#(<= main_~i~0 47)} is VALID [2022-04-15 12:26:38,441 INFO L290 TraceCheckUtils]: 100: Hoare triple {127933#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127933#(<= main_~i~0 47)} is VALID [2022-04-15 12:26:38,442 INFO L290 TraceCheckUtils]: 101: Hoare triple {127933#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127934#(<= main_~i~0 48)} is VALID [2022-04-15 12:26:38,442 INFO L290 TraceCheckUtils]: 102: Hoare triple {127934#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127934#(<= main_~i~0 48)} is VALID [2022-04-15 12:26:38,442 INFO L290 TraceCheckUtils]: 103: Hoare triple {127934#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127935#(<= main_~i~0 49)} is VALID [2022-04-15 12:26:38,442 INFO L290 TraceCheckUtils]: 104: Hoare triple {127935#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127935#(<= main_~i~0 49)} is VALID [2022-04-15 12:26:38,443 INFO L290 TraceCheckUtils]: 105: Hoare triple {127935#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127936#(<= main_~i~0 50)} is VALID [2022-04-15 12:26:38,443 INFO L290 TraceCheckUtils]: 106: Hoare triple {127936#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127936#(<= main_~i~0 50)} is VALID [2022-04-15 12:26:38,443 INFO L290 TraceCheckUtils]: 107: Hoare triple {127936#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127937#(<= main_~i~0 51)} is VALID [2022-04-15 12:26:38,444 INFO L290 TraceCheckUtils]: 108: Hoare triple {127937#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127937#(<= main_~i~0 51)} is VALID [2022-04-15 12:26:38,444 INFO L290 TraceCheckUtils]: 109: Hoare triple {127937#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127938#(<= main_~i~0 52)} is VALID [2022-04-15 12:26:38,444 INFO L290 TraceCheckUtils]: 110: Hoare triple {127938#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127938#(<= main_~i~0 52)} is VALID [2022-04-15 12:26:38,444 INFO L290 TraceCheckUtils]: 111: Hoare triple {127938#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127939#(<= main_~i~0 53)} is VALID [2022-04-15 12:26:38,445 INFO L290 TraceCheckUtils]: 112: Hoare triple {127939#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127939#(<= main_~i~0 53)} is VALID [2022-04-15 12:26:38,445 INFO L290 TraceCheckUtils]: 113: Hoare triple {127939#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127940#(<= main_~i~0 54)} is VALID [2022-04-15 12:26:38,445 INFO L290 TraceCheckUtils]: 114: Hoare triple {127940#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127940#(<= main_~i~0 54)} is VALID [2022-04-15 12:26:38,446 INFO L290 TraceCheckUtils]: 115: Hoare triple {127940#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127941#(<= main_~i~0 55)} is VALID [2022-04-15 12:26:38,446 INFO L290 TraceCheckUtils]: 116: Hoare triple {127941#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127941#(<= main_~i~0 55)} is VALID [2022-04-15 12:26:38,446 INFO L290 TraceCheckUtils]: 117: Hoare triple {127941#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127942#(<= main_~i~0 56)} is VALID [2022-04-15 12:26:38,446 INFO L290 TraceCheckUtils]: 118: Hoare triple {127942#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127942#(<= main_~i~0 56)} is VALID [2022-04-15 12:26:38,447 INFO L290 TraceCheckUtils]: 119: Hoare triple {127942#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127943#(<= main_~i~0 57)} is VALID [2022-04-15 12:26:38,447 INFO L290 TraceCheckUtils]: 120: Hoare triple {127943#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127943#(<= main_~i~0 57)} is VALID [2022-04-15 12:26:38,447 INFO L290 TraceCheckUtils]: 121: Hoare triple {127943#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127944#(<= main_~i~0 58)} is VALID [2022-04-15 12:26:38,447 INFO L290 TraceCheckUtils]: 122: Hoare triple {127944#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127944#(<= main_~i~0 58)} is VALID [2022-04-15 12:26:38,448 INFO L290 TraceCheckUtils]: 123: Hoare triple {127944#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127945#(<= main_~i~0 59)} is VALID [2022-04-15 12:26:38,448 INFO L290 TraceCheckUtils]: 124: Hoare triple {127945#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127945#(<= main_~i~0 59)} is VALID [2022-04-15 12:26:38,448 INFO L290 TraceCheckUtils]: 125: Hoare triple {127945#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127946#(<= main_~i~0 60)} is VALID [2022-04-15 12:26:38,449 INFO L290 TraceCheckUtils]: 126: Hoare triple {127946#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127946#(<= main_~i~0 60)} is VALID [2022-04-15 12:26:38,449 INFO L290 TraceCheckUtils]: 127: Hoare triple {127946#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127947#(<= main_~i~0 61)} is VALID [2022-04-15 12:26:38,449 INFO L290 TraceCheckUtils]: 128: Hoare triple {127947#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127947#(<= main_~i~0 61)} is VALID [2022-04-15 12:26:38,449 INFO L290 TraceCheckUtils]: 129: Hoare triple {127947#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127948#(<= main_~i~0 62)} is VALID [2022-04-15 12:26:38,450 INFO L290 TraceCheckUtils]: 130: Hoare triple {127948#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127948#(<= main_~i~0 62)} is VALID [2022-04-15 12:26:38,450 INFO L290 TraceCheckUtils]: 131: Hoare triple {127948#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127949#(<= main_~i~0 63)} is VALID [2022-04-15 12:26:38,450 INFO L290 TraceCheckUtils]: 132: Hoare triple {127949#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127949#(<= main_~i~0 63)} is VALID [2022-04-15 12:26:38,451 INFO L290 TraceCheckUtils]: 133: Hoare triple {127949#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127950#(<= main_~i~0 64)} is VALID [2022-04-15 12:26:38,451 INFO L290 TraceCheckUtils]: 134: Hoare triple {127950#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127950#(<= main_~i~0 64)} is VALID [2022-04-15 12:26:38,451 INFO L290 TraceCheckUtils]: 135: Hoare triple {127950#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127951#(<= main_~i~0 65)} is VALID [2022-04-15 12:26:38,451 INFO L290 TraceCheckUtils]: 136: Hoare triple {127951#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127951#(<= main_~i~0 65)} is VALID [2022-04-15 12:26:38,452 INFO L290 TraceCheckUtils]: 137: Hoare triple {127951#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127952#(<= main_~i~0 66)} is VALID [2022-04-15 12:26:38,452 INFO L290 TraceCheckUtils]: 138: Hoare triple {127952#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127952#(<= main_~i~0 66)} is VALID [2022-04-15 12:26:38,452 INFO L290 TraceCheckUtils]: 139: Hoare triple {127952#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127953#(<= main_~i~0 67)} is VALID [2022-04-15 12:26:38,452 INFO L290 TraceCheckUtils]: 140: Hoare triple {127953#(<= main_~i~0 67)} assume !(~i~0 < 1024); {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 141: Hoare triple {127882#false} ~i~0 := 0; {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 142: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 143: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 144: Hoare triple {127882#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 145: Hoare triple {127882#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 146: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 147: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 148: Hoare triple {127882#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 149: Hoare triple {127882#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 150: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 151: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 152: Hoare triple {127882#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L272 TraceCheckUtils]: 153: Hoare triple {127882#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 154: Hoare triple {127882#false} ~cond := #in~cond; {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 155: Hoare triple {127882#false} assume 0 == ~cond; {127882#false} is VALID [2022-04-15 12:26:38,453 INFO L290 TraceCheckUtils]: 156: Hoare triple {127882#false} assume !false; {127882#false} is VALID [2022-04-15 12:26:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:26:38,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:26:42,808 INFO L290 TraceCheckUtils]: 156: Hoare triple {127882#false} assume !false; {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L290 TraceCheckUtils]: 155: Hoare triple {127882#false} assume 0 == ~cond; {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L290 TraceCheckUtils]: 154: Hoare triple {127882#false} ~cond := #in~cond; {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L272 TraceCheckUtils]: 153: Hoare triple {127882#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L290 TraceCheckUtils]: 152: Hoare triple {127882#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L290 TraceCheckUtils]: 151: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L290 TraceCheckUtils]: 150: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L290 TraceCheckUtils]: 149: Hoare triple {127882#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L290 TraceCheckUtils]: 148: Hoare triple {127882#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L290 TraceCheckUtils]: 147: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L290 TraceCheckUtils]: 146: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L290 TraceCheckUtils]: 145: Hoare triple {127882#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L290 TraceCheckUtils]: 144: Hoare triple {127882#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L290 TraceCheckUtils]: 143: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L290 TraceCheckUtils]: 142: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-15 12:26:42,809 INFO L290 TraceCheckUtils]: 141: Hoare triple {127882#false} ~i~0 := 0; {127882#false} is VALID [2022-04-15 12:26:42,810 INFO L290 TraceCheckUtils]: 140: Hoare triple {128475#(< main_~i~0 1024)} assume !(~i~0 < 1024); {127882#false} is VALID [2022-04-15 12:26:42,810 INFO L290 TraceCheckUtils]: 139: Hoare triple {128479#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128475#(< main_~i~0 1024)} is VALID [2022-04-15 12:26:42,810 INFO L290 TraceCheckUtils]: 138: Hoare triple {128479#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128479#(< main_~i~0 1023)} is VALID [2022-04-15 12:26:42,811 INFO L290 TraceCheckUtils]: 137: Hoare triple {128486#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128479#(< main_~i~0 1023)} is VALID [2022-04-15 12:26:42,811 INFO L290 TraceCheckUtils]: 136: Hoare triple {128486#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128486#(< main_~i~0 1022)} is VALID [2022-04-15 12:26:42,811 INFO L290 TraceCheckUtils]: 135: Hoare triple {128493#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128486#(< main_~i~0 1022)} is VALID [2022-04-15 12:26:42,811 INFO L290 TraceCheckUtils]: 134: Hoare triple {128493#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128493#(< main_~i~0 1021)} is VALID [2022-04-15 12:26:42,812 INFO L290 TraceCheckUtils]: 133: Hoare triple {128500#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128493#(< main_~i~0 1021)} is VALID [2022-04-15 12:26:42,812 INFO L290 TraceCheckUtils]: 132: Hoare triple {128500#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128500#(< main_~i~0 1020)} is VALID [2022-04-15 12:26:42,812 INFO L290 TraceCheckUtils]: 131: Hoare triple {128507#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128500#(< main_~i~0 1020)} is VALID [2022-04-15 12:26:42,812 INFO L290 TraceCheckUtils]: 130: Hoare triple {128507#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128507#(< main_~i~0 1019)} is VALID [2022-04-15 12:26:42,813 INFO L290 TraceCheckUtils]: 129: Hoare triple {128514#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128507#(< main_~i~0 1019)} is VALID [2022-04-15 12:26:42,813 INFO L290 TraceCheckUtils]: 128: Hoare triple {128514#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128514#(< main_~i~0 1018)} is VALID [2022-04-15 12:26:42,813 INFO L290 TraceCheckUtils]: 127: Hoare triple {128521#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128514#(< main_~i~0 1018)} is VALID [2022-04-15 12:26:42,814 INFO L290 TraceCheckUtils]: 126: Hoare triple {128521#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128521#(< main_~i~0 1017)} is VALID [2022-04-15 12:26:42,814 INFO L290 TraceCheckUtils]: 125: Hoare triple {128528#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128521#(< main_~i~0 1017)} is VALID [2022-04-15 12:26:42,814 INFO L290 TraceCheckUtils]: 124: Hoare triple {128528#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128528#(< main_~i~0 1016)} is VALID [2022-04-15 12:26:42,814 INFO L290 TraceCheckUtils]: 123: Hoare triple {128535#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128528#(< main_~i~0 1016)} is VALID [2022-04-15 12:26:42,815 INFO L290 TraceCheckUtils]: 122: Hoare triple {128535#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128535#(< main_~i~0 1015)} is VALID [2022-04-15 12:26:42,815 INFO L290 TraceCheckUtils]: 121: Hoare triple {128542#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128535#(< main_~i~0 1015)} is VALID [2022-04-15 12:26:42,815 INFO L290 TraceCheckUtils]: 120: Hoare triple {128542#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128542#(< main_~i~0 1014)} is VALID [2022-04-15 12:26:42,816 INFO L290 TraceCheckUtils]: 119: Hoare triple {128549#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128542#(< main_~i~0 1014)} is VALID [2022-04-15 12:26:42,816 INFO L290 TraceCheckUtils]: 118: Hoare triple {128549#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128549#(< main_~i~0 1013)} is VALID [2022-04-15 12:26:42,816 INFO L290 TraceCheckUtils]: 117: Hoare triple {128556#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128549#(< main_~i~0 1013)} is VALID [2022-04-15 12:26:42,816 INFO L290 TraceCheckUtils]: 116: Hoare triple {128556#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128556#(< main_~i~0 1012)} is VALID [2022-04-15 12:26:42,817 INFO L290 TraceCheckUtils]: 115: Hoare triple {128563#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128556#(< main_~i~0 1012)} is VALID [2022-04-15 12:26:42,817 INFO L290 TraceCheckUtils]: 114: Hoare triple {128563#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128563#(< main_~i~0 1011)} is VALID [2022-04-15 12:26:42,817 INFO L290 TraceCheckUtils]: 113: Hoare triple {128570#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128563#(< main_~i~0 1011)} is VALID [2022-04-15 12:26:42,817 INFO L290 TraceCheckUtils]: 112: Hoare triple {128570#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128570#(< main_~i~0 1010)} is VALID [2022-04-15 12:26:42,818 INFO L290 TraceCheckUtils]: 111: Hoare triple {128577#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128570#(< main_~i~0 1010)} is VALID [2022-04-15 12:26:42,818 INFO L290 TraceCheckUtils]: 110: Hoare triple {128577#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128577#(< main_~i~0 1009)} is VALID [2022-04-15 12:26:42,818 INFO L290 TraceCheckUtils]: 109: Hoare triple {128584#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128577#(< main_~i~0 1009)} is VALID [2022-04-15 12:26:42,819 INFO L290 TraceCheckUtils]: 108: Hoare triple {128584#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128584#(< main_~i~0 1008)} is VALID [2022-04-15 12:26:42,819 INFO L290 TraceCheckUtils]: 107: Hoare triple {128591#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128584#(< main_~i~0 1008)} is VALID [2022-04-15 12:26:42,819 INFO L290 TraceCheckUtils]: 106: Hoare triple {128591#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128591#(< main_~i~0 1007)} is VALID [2022-04-15 12:26:42,819 INFO L290 TraceCheckUtils]: 105: Hoare triple {128598#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128591#(< main_~i~0 1007)} is VALID [2022-04-15 12:26:42,820 INFO L290 TraceCheckUtils]: 104: Hoare triple {128598#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128598#(< main_~i~0 1006)} is VALID [2022-04-15 12:26:42,820 INFO L290 TraceCheckUtils]: 103: Hoare triple {128605#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128598#(< main_~i~0 1006)} is VALID [2022-04-15 12:26:42,820 INFO L290 TraceCheckUtils]: 102: Hoare triple {128605#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128605#(< main_~i~0 1005)} is VALID [2022-04-15 12:26:42,820 INFO L290 TraceCheckUtils]: 101: Hoare triple {128612#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128605#(< main_~i~0 1005)} is VALID [2022-04-15 12:26:42,821 INFO L290 TraceCheckUtils]: 100: Hoare triple {128612#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128612#(< main_~i~0 1004)} is VALID [2022-04-15 12:26:42,821 INFO L290 TraceCheckUtils]: 99: Hoare triple {128619#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128612#(< main_~i~0 1004)} is VALID [2022-04-15 12:26:42,821 INFO L290 TraceCheckUtils]: 98: Hoare triple {128619#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128619#(< main_~i~0 1003)} is VALID [2022-04-15 12:26:42,822 INFO L290 TraceCheckUtils]: 97: Hoare triple {128626#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128619#(< main_~i~0 1003)} is VALID [2022-04-15 12:26:42,822 INFO L290 TraceCheckUtils]: 96: Hoare triple {128626#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128626#(< main_~i~0 1002)} is VALID [2022-04-15 12:26:42,822 INFO L290 TraceCheckUtils]: 95: Hoare triple {128633#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128626#(< main_~i~0 1002)} is VALID [2022-04-15 12:26:42,822 INFO L290 TraceCheckUtils]: 94: Hoare triple {128633#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128633#(< main_~i~0 1001)} is VALID [2022-04-15 12:26:42,823 INFO L290 TraceCheckUtils]: 93: Hoare triple {128640#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128633#(< main_~i~0 1001)} is VALID [2022-04-15 12:26:42,823 INFO L290 TraceCheckUtils]: 92: Hoare triple {128640#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128640#(< main_~i~0 1000)} is VALID [2022-04-15 12:26:42,823 INFO L290 TraceCheckUtils]: 91: Hoare triple {128647#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128640#(< main_~i~0 1000)} is VALID [2022-04-15 12:26:42,823 INFO L290 TraceCheckUtils]: 90: Hoare triple {128647#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128647#(< main_~i~0 999)} is VALID [2022-04-15 12:26:42,824 INFO L290 TraceCheckUtils]: 89: Hoare triple {128654#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128647#(< main_~i~0 999)} is VALID [2022-04-15 12:26:42,824 INFO L290 TraceCheckUtils]: 88: Hoare triple {128654#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128654#(< main_~i~0 998)} is VALID [2022-04-15 12:26:42,824 INFO L290 TraceCheckUtils]: 87: Hoare triple {128661#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128654#(< main_~i~0 998)} is VALID [2022-04-15 12:26:42,825 INFO L290 TraceCheckUtils]: 86: Hoare triple {128661#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128661#(< main_~i~0 997)} is VALID [2022-04-15 12:26:42,825 INFO L290 TraceCheckUtils]: 85: Hoare triple {128668#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128661#(< main_~i~0 997)} is VALID [2022-04-15 12:26:42,825 INFO L290 TraceCheckUtils]: 84: Hoare triple {128668#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128668#(< main_~i~0 996)} is VALID [2022-04-15 12:26:42,825 INFO L290 TraceCheckUtils]: 83: Hoare triple {128675#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128668#(< main_~i~0 996)} is VALID [2022-04-15 12:26:42,826 INFO L290 TraceCheckUtils]: 82: Hoare triple {128675#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128675#(< main_~i~0 995)} is VALID [2022-04-15 12:26:42,826 INFO L290 TraceCheckUtils]: 81: Hoare triple {128682#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128675#(< main_~i~0 995)} is VALID [2022-04-15 12:26:42,826 INFO L290 TraceCheckUtils]: 80: Hoare triple {128682#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128682#(< main_~i~0 994)} is VALID [2022-04-15 12:26:42,827 INFO L290 TraceCheckUtils]: 79: Hoare triple {128689#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128682#(< main_~i~0 994)} is VALID [2022-04-15 12:26:42,827 INFO L290 TraceCheckUtils]: 78: Hoare triple {128689#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128689#(< main_~i~0 993)} is VALID [2022-04-15 12:26:42,827 INFO L290 TraceCheckUtils]: 77: Hoare triple {128696#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128689#(< main_~i~0 993)} is VALID [2022-04-15 12:26:42,827 INFO L290 TraceCheckUtils]: 76: Hoare triple {128696#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128696#(< main_~i~0 992)} is VALID [2022-04-15 12:26:42,828 INFO L290 TraceCheckUtils]: 75: Hoare triple {128703#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128696#(< main_~i~0 992)} is VALID [2022-04-15 12:26:42,828 INFO L290 TraceCheckUtils]: 74: Hoare triple {128703#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128703#(< main_~i~0 991)} is VALID [2022-04-15 12:26:42,828 INFO L290 TraceCheckUtils]: 73: Hoare triple {128710#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128703#(< main_~i~0 991)} is VALID [2022-04-15 12:26:42,828 INFO L290 TraceCheckUtils]: 72: Hoare triple {128710#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128710#(< main_~i~0 990)} is VALID [2022-04-15 12:26:42,829 INFO L290 TraceCheckUtils]: 71: Hoare triple {128717#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128710#(< main_~i~0 990)} is VALID [2022-04-15 12:26:42,829 INFO L290 TraceCheckUtils]: 70: Hoare triple {128717#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128717#(< main_~i~0 989)} is VALID [2022-04-15 12:26:42,829 INFO L290 TraceCheckUtils]: 69: Hoare triple {128724#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128717#(< main_~i~0 989)} is VALID [2022-04-15 12:26:42,830 INFO L290 TraceCheckUtils]: 68: Hoare triple {128724#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128724#(< main_~i~0 988)} is VALID [2022-04-15 12:26:42,830 INFO L290 TraceCheckUtils]: 67: Hoare triple {128731#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128724#(< main_~i~0 988)} is VALID [2022-04-15 12:26:42,830 INFO L290 TraceCheckUtils]: 66: Hoare triple {128731#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128731#(< main_~i~0 987)} is VALID [2022-04-15 12:26:42,830 INFO L290 TraceCheckUtils]: 65: Hoare triple {128738#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128731#(< main_~i~0 987)} is VALID [2022-04-15 12:26:42,831 INFO L290 TraceCheckUtils]: 64: Hoare triple {128738#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128738#(< main_~i~0 986)} is VALID [2022-04-15 12:26:42,831 INFO L290 TraceCheckUtils]: 63: Hoare triple {128745#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128738#(< main_~i~0 986)} is VALID [2022-04-15 12:26:42,831 INFO L290 TraceCheckUtils]: 62: Hoare triple {128745#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128745#(< main_~i~0 985)} is VALID [2022-04-15 12:26:42,832 INFO L290 TraceCheckUtils]: 61: Hoare triple {128752#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128745#(< main_~i~0 985)} is VALID [2022-04-15 12:26:42,832 INFO L290 TraceCheckUtils]: 60: Hoare triple {128752#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128752#(< main_~i~0 984)} is VALID [2022-04-15 12:26:42,832 INFO L290 TraceCheckUtils]: 59: Hoare triple {128759#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128752#(< main_~i~0 984)} is VALID [2022-04-15 12:26:42,832 INFO L290 TraceCheckUtils]: 58: Hoare triple {128759#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128759#(< main_~i~0 983)} is VALID [2022-04-15 12:26:42,833 INFO L290 TraceCheckUtils]: 57: Hoare triple {128766#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128759#(< main_~i~0 983)} is VALID [2022-04-15 12:26:42,833 INFO L290 TraceCheckUtils]: 56: Hoare triple {128766#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128766#(< main_~i~0 982)} is VALID [2022-04-15 12:26:42,833 INFO L290 TraceCheckUtils]: 55: Hoare triple {128773#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128766#(< main_~i~0 982)} is VALID [2022-04-15 12:26:42,833 INFO L290 TraceCheckUtils]: 54: Hoare triple {128773#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128773#(< main_~i~0 981)} is VALID [2022-04-15 12:26:42,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {128780#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128773#(< main_~i~0 981)} is VALID [2022-04-15 12:26:42,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {128780#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128780#(< main_~i~0 980)} is VALID [2022-04-15 12:26:42,834 INFO L290 TraceCheckUtils]: 51: Hoare triple {128787#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128780#(< main_~i~0 980)} is VALID [2022-04-15 12:26:42,834 INFO L290 TraceCheckUtils]: 50: Hoare triple {128787#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128787#(< main_~i~0 979)} is VALID [2022-04-15 12:26:42,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {128794#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128787#(< main_~i~0 979)} is VALID [2022-04-15 12:26:42,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {128794#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128794#(< main_~i~0 978)} is VALID [2022-04-15 12:26:42,835 INFO L290 TraceCheckUtils]: 47: Hoare triple {128801#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128794#(< main_~i~0 978)} is VALID [2022-04-15 12:26:42,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {128801#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128801#(< main_~i~0 977)} is VALID [2022-04-15 12:26:42,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {128808#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128801#(< main_~i~0 977)} is VALID [2022-04-15 12:26:42,836 INFO L290 TraceCheckUtils]: 44: Hoare triple {128808#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128808#(< main_~i~0 976)} is VALID [2022-04-15 12:26:42,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {128815#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128808#(< main_~i~0 976)} is VALID [2022-04-15 12:26:42,837 INFO L290 TraceCheckUtils]: 42: Hoare triple {128815#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128815#(< main_~i~0 975)} is VALID [2022-04-15 12:26:42,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {128822#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128815#(< main_~i~0 975)} is VALID [2022-04-15 12:26:42,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {128822#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128822#(< main_~i~0 974)} is VALID [2022-04-15 12:26:42,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {128829#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128822#(< main_~i~0 974)} is VALID [2022-04-15 12:26:42,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {128829#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128829#(< main_~i~0 973)} is VALID [2022-04-15 12:26:42,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {128836#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128829#(< main_~i~0 973)} is VALID [2022-04-15 12:26:42,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {128836#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128836#(< main_~i~0 972)} is VALID [2022-04-15 12:26:42,839 INFO L290 TraceCheckUtils]: 35: Hoare triple {128843#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128836#(< main_~i~0 972)} is VALID [2022-04-15 12:26:42,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {128843#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128843#(< main_~i~0 971)} is VALID [2022-04-15 12:26:42,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {128850#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128843#(< main_~i~0 971)} is VALID [2022-04-15 12:26:42,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {128850#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128850#(< main_~i~0 970)} is VALID [2022-04-15 12:26:42,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {128857#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128850#(< main_~i~0 970)} is VALID [2022-04-15 12:26:42,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {128857#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128857#(< main_~i~0 969)} is VALID [2022-04-15 12:26:42,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {128864#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128857#(< main_~i~0 969)} is VALID [2022-04-15 12:26:42,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {128864#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128864#(< main_~i~0 968)} is VALID [2022-04-15 12:26:42,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {128871#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128864#(< main_~i~0 968)} is VALID [2022-04-15 12:26:42,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {128871#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128871#(< main_~i~0 967)} is VALID [2022-04-15 12:26:42,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {128878#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128871#(< main_~i~0 967)} is VALID [2022-04-15 12:26:42,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {128878#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128878#(< main_~i~0 966)} is VALID [2022-04-15 12:26:42,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {128885#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128878#(< main_~i~0 966)} is VALID [2022-04-15 12:26:42,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {128885#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128885#(< main_~i~0 965)} is VALID [2022-04-15 12:26:42,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {128892#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128885#(< main_~i~0 965)} is VALID [2022-04-15 12:26:42,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {128892#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128892#(< main_~i~0 964)} is VALID [2022-04-15 12:26:42,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {128899#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128892#(< main_~i~0 964)} is VALID [2022-04-15 12:26:42,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {128899#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128899#(< main_~i~0 963)} is VALID [2022-04-15 12:26:42,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {128906#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128899#(< main_~i~0 963)} is VALID [2022-04-15 12:26:42,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {128906#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128906#(< main_~i~0 962)} is VALID [2022-04-15 12:26:42,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {128913#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128906#(< main_~i~0 962)} is VALID [2022-04-15 12:26:42,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {128913#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128913#(< main_~i~0 961)} is VALID [2022-04-15 12:26:42,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {128920#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128913#(< main_~i~0 961)} is VALID [2022-04-15 12:26:42,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {128920#(< main_~i~0 960)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128920#(< main_~i~0 960)} is VALID [2022-04-15 12:26:42,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {128927#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128920#(< main_~i~0 960)} is VALID [2022-04-15 12:26:42,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {128927#(< main_~i~0 959)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128927#(< main_~i~0 959)} is VALID [2022-04-15 12:26:42,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {128934#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128927#(< main_~i~0 959)} is VALID [2022-04-15 12:26:42,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {128934#(< main_~i~0 958)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128934#(< main_~i~0 958)} is VALID [2022-04-15 12:26:42,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {128941#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128934#(< main_~i~0 958)} is VALID [2022-04-15 12:26:42,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {128941#(< main_~i~0 957)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128941#(< main_~i~0 957)} is VALID [2022-04-15 12:26:42,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {127881#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {128941#(< main_~i~0 957)} is VALID [2022-04-15 12:26:42,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {127881#true} call #t~ret6 := main(); {127881#true} is VALID [2022-04-15 12:26:42,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127881#true} {127881#true} #64#return; {127881#true} is VALID [2022-04-15 12:26:42,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {127881#true} assume true; {127881#true} is VALID [2022-04-15 12:26:42,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {127881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {127881#true} is VALID [2022-04-15 12:26:42,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {127881#true} call ULTIMATE.init(); {127881#true} is VALID [2022-04-15 12:26:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:26:42,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986928560] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:26:42,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:26:42,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 140 [2022-04-15 12:26:42,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:26:42,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2092547485] [2022-04-15 12:26:42,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2092547485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:26:42,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:26:42,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2022-04-15 12:26:42,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78568421] [2022-04-15 12:26:42,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:26:42,849 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 70 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-15 12:26:42,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:26:42,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 70 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:42,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:26:42,937 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-04-15 12:26:42,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:26:42,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-04-15 12:26:42,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9593, Invalid=9867, Unknown=0, NotChecked=0, Total=19460 [2022-04-15 12:26:42,939 INFO L87 Difference]: Start difference. First operand 158 states and 162 transitions. Second operand has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 70 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:01,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:01,423 INFO L93 Difference]: Finished difference Result 509 states and 649 transitions. [2022-04-15 12:27:01,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-04-15 12:27:01,423 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 70 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-15 12:27:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:27:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 70 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 640 transitions. [2022-04-15 12:27:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 70 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 640 transitions. [2022-04-15 12:27:01,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 640 transitions. [2022-04-15 12:27:01,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:01,846 INFO L225 Difference]: With dead ends: 509 [2022-04-15 12:27:01,846 INFO L226 Difference]: Without dead ends: 492 [2022-04-15 12:27:01,848 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2679 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=19046, Invalid=24010, Unknown=0, NotChecked=0, Total=43056 [2022-04-15 12:27:01,848 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1509 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:27:01,848 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1509 Valid, 57 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:27:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-04-15 12:27:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 160. [2022-04-15 12:27:02,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:27:02,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:02,946 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:02,946 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:02,954 INFO L93 Difference]: Finished difference Result 492 states and 628 transitions. [2022-04-15 12:27:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 628 transitions. [2022-04-15 12:27:02,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:02,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:02,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-15 12:27:02,954 INFO L87 Difference]: Start difference. First operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-15 12:27:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:02,962 INFO L93 Difference]: Finished difference Result 492 states and 628 transitions. [2022-04-15 12:27:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 628 transitions. [2022-04-15 12:27:02,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:02,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:02,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:27:02,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:27:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 164 transitions. [2022-04-15 12:27:02,964 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 164 transitions. Word has length 157 [2022-04-15 12:27:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:27:02,965 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 164 transitions. [2022-04-15 12:27:02,965 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 70 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:02,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 164 transitions. [2022-04-15 12:27:03,438 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:27:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2022-04-15 12:27:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-15 12:27:03,438 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:03,438 INFO L499 BasicCegarLoop]: trace histogram [68, 68, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:03,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-04-15 12:27:03,639 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:03,639 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:03,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash -569777611, now seen corresponding path program 137 times [2022-04-15 12:27:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:03,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [307291938] [2022-04-15 12:27:03,643 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:27:03,643 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:27:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash -569777611, now seen corresponding path program 138 times [2022-04-15 12:27:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:03,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487123516] [2022-04-15 12:27:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:05,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:27:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:05,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {131497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {131423#true} is VALID [2022-04-15 12:27:05,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {131423#true} assume true; {131423#true} is VALID [2022-04-15 12:27:05,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131423#true} {131423#true} #64#return; {131423#true} is VALID [2022-04-15 12:27:05,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {131423#true} call ULTIMATE.init(); {131497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:27:05,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {131497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {131423#true} is VALID [2022-04-15 12:27:05,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {131423#true} assume true; {131423#true} is VALID [2022-04-15 12:27:05,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131423#true} {131423#true} #64#return; {131423#true} is VALID [2022-04-15 12:27:05,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {131423#true} call #t~ret6 := main(); {131423#true} is VALID [2022-04-15 12:27:05,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {131423#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {131428#(= main_~i~0 0)} is VALID [2022-04-15 12:27:05,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {131428#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131428#(= main_~i~0 0)} is VALID [2022-04-15 12:27:05,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {131428#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131429#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:05,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {131429#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131429#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:05,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {131429#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131430#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:05,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {131430#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131430#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:05,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {131430#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131431#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:05,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {131431#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131431#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:05,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {131431#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131432#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:05,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {131432#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131432#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:05,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {131432#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131433#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:05,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {131433#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131433#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:05,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {131433#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131434#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:05,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {131434#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131434#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:05,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {131434#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131435#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:05,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {131435#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131435#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:05,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {131435#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131436#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:05,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {131436#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131436#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:05,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {131436#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131437#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:05,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {131437#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131437#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:05,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {131437#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131438#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:05,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {131438#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131438#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:05,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {131438#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131439#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:05,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {131439#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131439#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:05,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {131439#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131440#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:05,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {131440#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131440#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:05,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {131440#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131441#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:05,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {131441#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131441#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:05,128 INFO L290 TraceCheckUtils]: 33: Hoare triple {131441#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131442#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:05,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {131442#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131442#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:05,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {131442#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131443#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:05,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {131443#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131443#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:05,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {131443#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131444#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:05,130 INFO L290 TraceCheckUtils]: 38: Hoare triple {131444#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131444#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:05,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {131444#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131445#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:05,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {131445#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131445#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:05,131 INFO L290 TraceCheckUtils]: 41: Hoare triple {131445#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131446#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:05,131 INFO L290 TraceCheckUtils]: 42: Hoare triple {131446#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131446#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:05,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {131446#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131447#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:05,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {131447#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131447#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:05,132 INFO L290 TraceCheckUtils]: 45: Hoare triple {131447#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131448#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:05,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {131448#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131448#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:05,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {131448#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131449#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:05,133 INFO L290 TraceCheckUtils]: 48: Hoare triple {131449#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131449#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:05,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {131449#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131450#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:05,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {131450#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131450#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:05,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {131450#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131451#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:05,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {131451#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131451#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:05,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {131451#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131452#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:05,134 INFO L290 TraceCheckUtils]: 54: Hoare triple {131452#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131452#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:05,135 INFO L290 TraceCheckUtils]: 55: Hoare triple {131452#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131453#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:05,135 INFO L290 TraceCheckUtils]: 56: Hoare triple {131453#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131453#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:05,135 INFO L290 TraceCheckUtils]: 57: Hoare triple {131453#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131454#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:05,135 INFO L290 TraceCheckUtils]: 58: Hoare triple {131454#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131454#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:05,136 INFO L290 TraceCheckUtils]: 59: Hoare triple {131454#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131455#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:05,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {131455#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131455#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:05,136 INFO L290 TraceCheckUtils]: 61: Hoare triple {131455#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131456#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:05,136 INFO L290 TraceCheckUtils]: 62: Hoare triple {131456#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131456#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:05,137 INFO L290 TraceCheckUtils]: 63: Hoare triple {131456#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131457#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:05,137 INFO L290 TraceCheckUtils]: 64: Hoare triple {131457#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131457#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:05,137 INFO L290 TraceCheckUtils]: 65: Hoare triple {131457#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131458#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:05,138 INFO L290 TraceCheckUtils]: 66: Hoare triple {131458#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131458#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:05,138 INFO L290 TraceCheckUtils]: 67: Hoare triple {131458#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131459#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:05,138 INFO L290 TraceCheckUtils]: 68: Hoare triple {131459#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131459#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:05,138 INFO L290 TraceCheckUtils]: 69: Hoare triple {131459#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131460#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:05,139 INFO L290 TraceCheckUtils]: 70: Hoare triple {131460#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131460#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:05,139 INFO L290 TraceCheckUtils]: 71: Hoare triple {131460#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131461#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:05,139 INFO L290 TraceCheckUtils]: 72: Hoare triple {131461#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131461#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:05,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {131461#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131462#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:05,140 INFO L290 TraceCheckUtils]: 74: Hoare triple {131462#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131462#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:05,140 INFO L290 TraceCheckUtils]: 75: Hoare triple {131462#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131463#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:05,140 INFO L290 TraceCheckUtils]: 76: Hoare triple {131463#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131463#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:05,141 INFO L290 TraceCheckUtils]: 77: Hoare triple {131463#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131464#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:05,141 INFO L290 TraceCheckUtils]: 78: Hoare triple {131464#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131464#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:05,141 INFO L290 TraceCheckUtils]: 79: Hoare triple {131464#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131465#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:05,141 INFO L290 TraceCheckUtils]: 80: Hoare triple {131465#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131465#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:05,142 INFO L290 TraceCheckUtils]: 81: Hoare triple {131465#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131466#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:05,142 INFO L290 TraceCheckUtils]: 82: Hoare triple {131466#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131466#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:05,142 INFO L290 TraceCheckUtils]: 83: Hoare triple {131466#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131467#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:05,143 INFO L290 TraceCheckUtils]: 84: Hoare triple {131467#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131467#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:05,143 INFO L290 TraceCheckUtils]: 85: Hoare triple {131467#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131468#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:05,143 INFO L290 TraceCheckUtils]: 86: Hoare triple {131468#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131468#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:05,143 INFO L290 TraceCheckUtils]: 87: Hoare triple {131468#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131469#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:05,144 INFO L290 TraceCheckUtils]: 88: Hoare triple {131469#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131469#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:05,144 INFO L290 TraceCheckUtils]: 89: Hoare triple {131469#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131470#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:05,144 INFO L290 TraceCheckUtils]: 90: Hoare triple {131470#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131470#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:05,145 INFO L290 TraceCheckUtils]: 91: Hoare triple {131470#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131471#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:05,145 INFO L290 TraceCheckUtils]: 92: Hoare triple {131471#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131471#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:05,145 INFO L290 TraceCheckUtils]: 93: Hoare triple {131471#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131472#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:05,145 INFO L290 TraceCheckUtils]: 94: Hoare triple {131472#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131472#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:05,146 INFO L290 TraceCheckUtils]: 95: Hoare triple {131472#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131473#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:05,146 INFO L290 TraceCheckUtils]: 96: Hoare triple {131473#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131473#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:05,146 INFO L290 TraceCheckUtils]: 97: Hoare triple {131473#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131474#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:05,147 INFO L290 TraceCheckUtils]: 98: Hoare triple {131474#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131474#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:05,147 INFO L290 TraceCheckUtils]: 99: Hoare triple {131474#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131475#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:05,147 INFO L290 TraceCheckUtils]: 100: Hoare triple {131475#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131475#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:05,147 INFO L290 TraceCheckUtils]: 101: Hoare triple {131475#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131476#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:05,148 INFO L290 TraceCheckUtils]: 102: Hoare triple {131476#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131476#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:05,148 INFO L290 TraceCheckUtils]: 103: Hoare triple {131476#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131477#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:05,148 INFO L290 TraceCheckUtils]: 104: Hoare triple {131477#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131477#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:05,148 INFO L290 TraceCheckUtils]: 105: Hoare triple {131477#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131478#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:05,149 INFO L290 TraceCheckUtils]: 106: Hoare triple {131478#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131478#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:05,149 INFO L290 TraceCheckUtils]: 107: Hoare triple {131478#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131479#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:05,149 INFO L290 TraceCheckUtils]: 108: Hoare triple {131479#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131479#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:05,150 INFO L290 TraceCheckUtils]: 109: Hoare triple {131479#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131480#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:05,150 INFO L290 TraceCheckUtils]: 110: Hoare triple {131480#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131480#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:05,150 INFO L290 TraceCheckUtils]: 111: Hoare triple {131480#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131481#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:05,150 INFO L290 TraceCheckUtils]: 112: Hoare triple {131481#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131481#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:05,151 INFO L290 TraceCheckUtils]: 113: Hoare triple {131481#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131482#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:05,151 INFO L290 TraceCheckUtils]: 114: Hoare triple {131482#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131482#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:05,151 INFO L290 TraceCheckUtils]: 115: Hoare triple {131482#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131483#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:05,151 INFO L290 TraceCheckUtils]: 116: Hoare triple {131483#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131483#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:05,152 INFO L290 TraceCheckUtils]: 117: Hoare triple {131483#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131484#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:05,152 INFO L290 TraceCheckUtils]: 118: Hoare triple {131484#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131484#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:05,152 INFO L290 TraceCheckUtils]: 119: Hoare triple {131484#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131485#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:05,153 INFO L290 TraceCheckUtils]: 120: Hoare triple {131485#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131485#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:05,153 INFO L290 TraceCheckUtils]: 121: Hoare triple {131485#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131486#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:05,153 INFO L290 TraceCheckUtils]: 122: Hoare triple {131486#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131486#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:05,153 INFO L290 TraceCheckUtils]: 123: Hoare triple {131486#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131487#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:05,154 INFO L290 TraceCheckUtils]: 124: Hoare triple {131487#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131487#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:05,154 INFO L290 TraceCheckUtils]: 125: Hoare triple {131487#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131488#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:05,154 INFO L290 TraceCheckUtils]: 126: Hoare triple {131488#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131488#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:05,155 INFO L290 TraceCheckUtils]: 127: Hoare triple {131488#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131489#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:05,155 INFO L290 TraceCheckUtils]: 128: Hoare triple {131489#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131489#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:05,155 INFO L290 TraceCheckUtils]: 129: Hoare triple {131489#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131490#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:05,155 INFO L290 TraceCheckUtils]: 130: Hoare triple {131490#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131490#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:05,156 INFO L290 TraceCheckUtils]: 131: Hoare triple {131490#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131491#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:05,156 INFO L290 TraceCheckUtils]: 132: Hoare triple {131491#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131491#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:05,156 INFO L290 TraceCheckUtils]: 133: Hoare triple {131491#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131492#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:05,156 INFO L290 TraceCheckUtils]: 134: Hoare triple {131492#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131492#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:05,157 INFO L290 TraceCheckUtils]: 135: Hoare triple {131492#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131493#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:05,157 INFO L290 TraceCheckUtils]: 136: Hoare triple {131493#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131493#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:05,157 INFO L290 TraceCheckUtils]: 137: Hoare triple {131493#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131494#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:05,158 INFO L290 TraceCheckUtils]: 138: Hoare triple {131494#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131494#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:05,158 INFO L290 TraceCheckUtils]: 139: Hoare triple {131494#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131495#(<= main_~i~0 67)} is VALID [2022-04-15 12:27:05,158 INFO L290 TraceCheckUtils]: 140: Hoare triple {131495#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131495#(<= main_~i~0 67)} is VALID [2022-04-15 12:27:05,158 INFO L290 TraceCheckUtils]: 141: Hoare triple {131495#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131496#(<= main_~i~0 68)} is VALID [2022-04-15 12:27:05,159 INFO L290 TraceCheckUtils]: 142: Hoare triple {131496#(<= main_~i~0 68)} assume !(~i~0 < 1024); {131424#false} is VALID [2022-04-15 12:27:05,159 INFO L290 TraceCheckUtils]: 143: Hoare triple {131424#false} ~i~0 := 0; {131424#false} is VALID [2022-04-15 12:27:05,159 INFO L290 TraceCheckUtils]: 144: Hoare triple {131424#false} #t~short5 := ~i~0 < 1024; {131424#false} is VALID [2022-04-15 12:27:05,159 INFO L290 TraceCheckUtils]: 145: Hoare triple {131424#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {131424#false} is VALID [2022-04-15 12:27:05,159 INFO L290 TraceCheckUtils]: 146: Hoare triple {131424#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {131424#false} is VALID [2022-04-15 12:27:05,159 INFO L290 TraceCheckUtils]: 147: Hoare triple {131424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {131424#false} is VALID [2022-04-15 12:27:05,159 INFO L290 TraceCheckUtils]: 148: Hoare triple {131424#false} #t~short5 := ~i~0 < 1024; {131424#false} is VALID [2022-04-15 12:27:05,159 INFO L290 TraceCheckUtils]: 149: Hoare triple {131424#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {131424#false} is VALID [2022-04-15 12:27:05,159 INFO L290 TraceCheckUtils]: 150: Hoare triple {131424#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {131424#false} is VALID [2022-04-15 12:27:05,159 INFO L290 TraceCheckUtils]: 151: Hoare triple {131424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {131424#false} is VALID [2022-04-15 12:27:05,159 INFO L290 TraceCheckUtils]: 152: Hoare triple {131424#false} #t~short5 := ~i~0 < 1024; {131424#false} is VALID [2022-04-15 12:27:05,159 INFO L290 TraceCheckUtils]: 153: Hoare triple {131424#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {131424#false} is VALID [2022-04-15 12:27:05,159 INFO L290 TraceCheckUtils]: 154: Hoare triple {131424#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {131424#false} is VALID [2022-04-15 12:27:05,159 INFO L272 TraceCheckUtils]: 155: Hoare triple {131424#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {131424#false} is VALID [2022-04-15 12:27:05,159 INFO L290 TraceCheckUtils]: 156: Hoare triple {131424#false} ~cond := #in~cond; {131424#false} is VALID [2022-04-15 12:27:05,160 INFO L290 TraceCheckUtils]: 157: Hoare triple {131424#false} assume 0 == ~cond; {131424#false} is VALID [2022-04-15 12:27:05,160 INFO L290 TraceCheckUtils]: 158: Hoare triple {131424#false} assume !false; {131424#false} is VALID [2022-04-15 12:27:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4634 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:27:05,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:27:05,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487123516] [2022-04-15 12:27:05,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487123516] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:27:05,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776576535] [2022-04-15 12:27:05,160 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:27:05,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:27:05,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:27:05,161 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:05,163 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:05,575 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:27:05,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:27:05,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:27:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:05,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:27:05,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {131423#true} call ULTIMATE.init(); {131423#true} is VALID [2022-04-15 12:27:05,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {131423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {131423#true} is VALID [2022-04-15 12:27:05,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {131423#true} assume true; {131423#true} is VALID [2022-04-15 12:27:05,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131423#true} {131423#true} #64#return; {131423#true} is VALID [2022-04-15 12:27:05,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {131423#true} call #t~ret6 := main(); {131423#true} is VALID [2022-04-15 12:27:05,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {131423#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 39: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 40: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 46: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 57: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 58: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 59: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 60: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 61: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 62: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 63: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 64: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,906 INFO L290 TraceCheckUtils]: 65: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 66: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 67: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 68: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 69: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 70: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 71: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 72: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 73: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 74: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 75: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 76: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 77: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 78: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 79: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 80: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 81: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 82: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 83: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 84: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,907 INFO L290 TraceCheckUtils]: 85: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 86: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 87: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 88: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 89: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 90: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 91: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 92: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 93: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 94: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 95: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 96: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 97: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 98: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 99: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 100: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 101: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 102: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 103: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 104: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,908 INFO L290 TraceCheckUtils]: 105: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 106: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 107: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 108: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 109: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 110: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 111: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 112: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 113: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 114: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 115: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 116: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 117: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 118: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 119: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 120: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 121: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 122: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 123: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 124: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,909 INFO L290 TraceCheckUtils]: 125: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 126: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 127: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 128: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 129: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 130: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 131: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 132: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 133: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 134: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 135: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 136: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 137: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 138: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 139: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 140: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 141: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:05,910 INFO L290 TraceCheckUtils]: 142: Hoare triple {131423#true} assume !(~i~0 < 1024); {131423#true} is VALID [2022-04-15 12:27:05,911 INFO L290 TraceCheckUtils]: 143: Hoare triple {131423#true} ~i~0 := 0; {131930#(<= main_~i~0 0)} is VALID [2022-04-15 12:27:05,911 INFO L290 TraceCheckUtils]: 144: Hoare triple {131930#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {131930#(<= main_~i~0 0)} is VALID [2022-04-15 12:27:05,911 INFO L290 TraceCheckUtils]: 145: Hoare triple {131930#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {131930#(<= main_~i~0 0)} is VALID [2022-04-15 12:27:05,911 INFO L290 TraceCheckUtils]: 146: Hoare triple {131930#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {131930#(<= main_~i~0 0)} is VALID [2022-04-15 12:27:05,912 INFO L290 TraceCheckUtils]: 147: Hoare triple {131930#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {131429#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:05,912 INFO L290 TraceCheckUtils]: 148: Hoare triple {131429#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {131429#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:05,912 INFO L290 TraceCheckUtils]: 149: Hoare triple {131429#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {131429#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:05,912 INFO L290 TraceCheckUtils]: 150: Hoare triple {131429#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {131429#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:05,913 INFO L290 TraceCheckUtils]: 151: Hoare triple {131429#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {131430#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:05,913 INFO L290 TraceCheckUtils]: 152: Hoare triple {131430#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {131430#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:05,913 INFO L290 TraceCheckUtils]: 153: Hoare triple {131430#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {131430#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:05,913 INFO L290 TraceCheckUtils]: 154: Hoare triple {131430#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {131430#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:05,914 INFO L272 TraceCheckUtils]: 155: Hoare triple {131430#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {131967#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:27:05,914 INFO L290 TraceCheckUtils]: 156: Hoare triple {131967#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {131971#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:27:05,914 INFO L290 TraceCheckUtils]: 157: Hoare triple {131971#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {131424#false} is VALID [2022-04-15 12:27:05,914 INFO L290 TraceCheckUtils]: 158: Hoare triple {131424#false} assume !false; {131424#false} is VALID [2022-04-15 12:27:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4634 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4624 trivial. 0 not checked. [2022-04-15 12:27:05,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:27:06,259 INFO L290 TraceCheckUtils]: 158: Hoare triple {131424#false} assume !false; {131424#false} is VALID [2022-04-15 12:27:06,259 INFO L290 TraceCheckUtils]: 157: Hoare triple {131971#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {131424#false} is VALID [2022-04-15 12:27:06,259 INFO L290 TraceCheckUtils]: 156: Hoare triple {131967#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {131971#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:27:06,260 INFO L272 TraceCheckUtils]: 155: Hoare triple {131987#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {131967#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:27:06,260 INFO L290 TraceCheckUtils]: 154: Hoare triple {131987#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {131987#(<= main_~i~0 512)} is VALID [2022-04-15 12:27:06,260 INFO L290 TraceCheckUtils]: 153: Hoare triple {131987#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {131987#(<= main_~i~0 512)} is VALID [2022-04-15 12:27:06,261 INFO L290 TraceCheckUtils]: 152: Hoare triple {131987#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {131987#(<= main_~i~0 512)} is VALID [2022-04-15 12:27:06,261 INFO L290 TraceCheckUtils]: 151: Hoare triple {132000#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {131987#(<= main_~i~0 512)} is VALID [2022-04-15 12:27:06,261 INFO L290 TraceCheckUtils]: 150: Hoare triple {132000#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {132000#(<= main_~i~0 511)} is VALID [2022-04-15 12:27:06,261 INFO L290 TraceCheckUtils]: 149: Hoare triple {132000#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {132000#(<= main_~i~0 511)} is VALID [2022-04-15 12:27:06,262 INFO L290 TraceCheckUtils]: 148: Hoare triple {132000#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {132000#(<= main_~i~0 511)} is VALID [2022-04-15 12:27:06,262 INFO L290 TraceCheckUtils]: 147: Hoare triple {132013#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {132000#(<= main_~i~0 511)} is VALID [2022-04-15 12:27:06,262 INFO L290 TraceCheckUtils]: 146: Hoare triple {132013#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {132013#(<= main_~i~0 510)} is VALID [2022-04-15 12:27:06,262 INFO L290 TraceCheckUtils]: 145: Hoare triple {132013#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {132013#(<= main_~i~0 510)} is VALID [2022-04-15 12:27:06,263 INFO L290 TraceCheckUtils]: 144: Hoare triple {132013#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {132013#(<= main_~i~0 510)} is VALID [2022-04-15 12:27:06,263 INFO L290 TraceCheckUtils]: 143: Hoare triple {131423#true} ~i~0 := 0; {132013#(<= main_~i~0 510)} is VALID [2022-04-15 12:27:06,263 INFO L290 TraceCheckUtils]: 142: Hoare triple {131423#true} assume !(~i~0 < 1024); {131423#true} is VALID [2022-04-15 12:27:06,263 INFO L290 TraceCheckUtils]: 141: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,263 INFO L290 TraceCheckUtils]: 140: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,263 INFO L290 TraceCheckUtils]: 139: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,263 INFO L290 TraceCheckUtils]: 138: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,263 INFO L290 TraceCheckUtils]: 137: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,263 INFO L290 TraceCheckUtils]: 136: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,263 INFO L290 TraceCheckUtils]: 135: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,263 INFO L290 TraceCheckUtils]: 134: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,263 INFO L290 TraceCheckUtils]: 133: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,263 INFO L290 TraceCheckUtils]: 132: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,263 INFO L290 TraceCheckUtils]: 131: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 130: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 129: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 128: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 127: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 126: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 125: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 124: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 123: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 122: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 121: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 120: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 119: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 118: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 117: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 116: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 115: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 114: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 113: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 112: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,264 INFO L290 TraceCheckUtils]: 111: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 110: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 109: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 108: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 107: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 106: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 105: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 104: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 103: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 102: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 101: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 100: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 99: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 98: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 97: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 96: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 95: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 94: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 93: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,265 INFO L290 TraceCheckUtils]: 92: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 91: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 90: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 89: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 88: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 87: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 86: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 85: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 84: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 83: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 82: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 81: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 80: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 79: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 78: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 77: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 76: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 75: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 74: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 73: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,266 INFO L290 TraceCheckUtils]: 72: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 71: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 70: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 69: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 68: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 67: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 66: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 65: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 64: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 63: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 62: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 61: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 60: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 56: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 55: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,267 INFO L290 TraceCheckUtils]: 52: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 49: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 48: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 47: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 46: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 45: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 44: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 43: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 42: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 41: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 40: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 39: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-15 12:27:06,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-15 12:27:06,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {131423#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {131423#true} is VALID [2022-04-15 12:27:06,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {131423#true} call #t~ret6 := main(); {131423#true} is VALID [2022-04-15 12:27:06,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131423#true} {131423#true} #64#return; {131423#true} is VALID [2022-04-15 12:27:06,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {131423#true} assume true; {131423#true} is VALID [2022-04-15 12:27:06,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {131423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {131423#true} is VALID [2022-04-15 12:27:06,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {131423#true} call ULTIMATE.init(); {131423#true} is VALID [2022-04-15 12:27:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4634 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4624 trivial. 0 not checked. [2022-04-15 12:27:06,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776576535] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:27:06,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:27:06,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 7, 7] total 78 [2022-04-15 12:27:06,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:27:06,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [307291938] [2022-04-15 12:27:06,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [307291938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:06,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:06,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2022-04-15 12:27:06,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909426898] [2022-04-15 12:27:06,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:27:06,271 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 71 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 159 [2022-04-15 12:27:06,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:27:06,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 71 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:06,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:06,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-04-15 12:27:06,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:06,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-04-15 12:27:06,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2781, Invalid=3225, Unknown=0, NotChecked=0, Total=6006 [2022-04-15 12:27:06,359 INFO L87 Difference]: Start difference. First operand 160 states and 164 transitions. Second operand has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 71 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:26,207 INFO L93 Difference]: Finished difference Result 516 states and 658 transitions. [2022-04-15 12:27:26,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-04-15 12:27:26,207 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 71 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 159 [2022-04-15 12:27:26,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:27:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 71 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 649 transitions. [2022-04-15 12:27:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 71 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 649 transitions. [2022-04-15 12:27:26,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 649 transitions. [2022-04-15 12:27:26,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 649 edges. 649 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:26,634 INFO L225 Difference]: With dead ends: 516 [2022-04-15 12:27:26,634 INFO L226 Difference]: Without dead ends: 499 [2022-04-15 12:27:26,635 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2831 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=7957, Invalid=13505, Unknown=0, NotChecked=0, Total=21462 [2022-04-15 12:27:26,635 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1801 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:27:26,635 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1801 Valid, 37 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:27:26,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-15 12:27:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 162. [2022-04-15 12:27:27,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:27:27,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 162 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 157 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:27,791 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 162 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 157 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:27,791 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 162 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 157 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:27,803 INFO L93 Difference]: Finished difference Result 499 states and 637 transitions. [2022-04-15 12:27:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 637 transitions. [2022-04-15 12:27:27,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:27,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:27,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 157 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 499 states. [2022-04-15 12:27:27,804 INFO L87 Difference]: Start difference. First operand has 162 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 157 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 499 states. [2022-04-15 12:27:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:27,812 INFO L93 Difference]: Finished difference Result 499 states and 637 transitions. [2022-04-15 12:27:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 637 transitions. [2022-04-15 12:27:27,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:27,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:27,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:27:27,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:27:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 157 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 166 transitions. [2022-04-15 12:27:27,814 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 166 transitions. Word has length 159 [2022-04-15 12:27:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:27:27,814 INFO L478 AbstractCegarLoop]: Abstraction has 162 states and 166 transitions. [2022-04-15 12:27:27,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 71 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:27,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 162 states and 166 transitions. [2022-04-15 12:27:28,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2022-04-15 12:27:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-15 12:27:28,300 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:28,301 INFO L499 BasicCegarLoop]: trace histogram [69, 69, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:28,318 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:28,507 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:28,507 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:28,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:28,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1584578643, now seen corresponding path program 139 times [2022-04-15 12:27:28,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:28,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1081633263] [2022-04-15 12:27:28,511 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:27:28,511 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:27:28,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1584578643, now seen corresponding path program 140 times [2022-04-15 12:27:28,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:28,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858341663] [2022-04-15 12:27:28,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:28,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:30,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:27:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:30,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {135024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {134949#true} is VALID [2022-04-15 12:27:30,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {134949#true} assume true; {134949#true} is VALID [2022-04-15 12:27:30,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134949#true} {134949#true} #64#return; {134949#true} is VALID [2022-04-15 12:27:30,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {134949#true} call ULTIMATE.init(); {135024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:27:30,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {135024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {134949#true} is VALID [2022-04-15 12:27:30,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {134949#true} assume true; {134949#true} is VALID [2022-04-15 12:27:30,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134949#true} {134949#true} #64#return; {134949#true} is VALID [2022-04-15 12:27:30,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {134949#true} call #t~ret6 := main(); {134949#true} is VALID [2022-04-15 12:27:30,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {134949#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {134954#(= main_~i~0 0)} is VALID [2022-04-15 12:27:30,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {134954#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134954#(= main_~i~0 0)} is VALID [2022-04-15 12:27:30,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {134954#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134955#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:30,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {134955#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134955#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:30,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {134955#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134956#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:30,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {134956#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134956#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:30,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {134956#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134957#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:30,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {134957#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134957#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:30,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {134957#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134958#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:30,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {134958#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134958#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:30,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {134958#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134959#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:30,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {134959#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134959#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:30,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {134959#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134960#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:30,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {134960#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134960#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:30,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {134960#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134961#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:30,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {134961#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134961#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:30,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {134961#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134962#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:30,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {134962#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134962#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:30,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {134962#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134963#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:30,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {134963#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134963#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:30,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {134963#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134964#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:30,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {134964#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134964#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:30,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {134964#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134965#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:30,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {134965#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134965#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:30,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {134965#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134966#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:30,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {134966#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134966#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:30,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {134966#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134967#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:30,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {134967#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134967#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:30,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {134967#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134968#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:30,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {134968#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134968#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:30,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {134968#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134969#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:30,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {134969#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134969#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:30,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {134969#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134970#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:30,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {134970#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134970#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:30,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {134970#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134971#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:30,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {134971#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134971#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:30,059 INFO L290 TraceCheckUtils]: 41: Hoare triple {134971#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134972#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:30,059 INFO L290 TraceCheckUtils]: 42: Hoare triple {134972#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134972#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:30,059 INFO L290 TraceCheckUtils]: 43: Hoare triple {134972#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134973#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:30,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {134973#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134973#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:30,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {134973#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134974#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:30,060 INFO L290 TraceCheckUtils]: 46: Hoare triple {134974#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134974#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:30,060 INFO L290 TraceCheckUtils]: 47: Hoare triple {134974#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134975#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:30,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {134975#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134975#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:30,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {134975#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134976#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:30,061 INFO L290 TraceCheckUtils]: 50: Hoare triple {134976#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134976#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:30,061 INFO L290 TraceCheckUtils]: 51: Hoare triple {134976#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134977#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:30,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {134977#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134977#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:30,062 INFO L290 TraceCheckUtils]: 53: Hoare triple {134977#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134978#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:30,062 INFO L290 TraceCheckUtils]: 54: Hoare triple {134978#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134978#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:30,062 INFO L290 TraceCheckUtils]: 55: Hoare triple {134978#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134979#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:30,063 INFO L290 TraceCheckUtils]: 56: Hoare triple {134979#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134979#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:30,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {134979#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134980#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:30,063 INFO L290 TraceCheckUtils]: 58: Hoare triple {134980#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134980#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:30,063 INFO L290 TraceCheckUtils]: 59: Hoare triple {134980#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134981#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:30,064 INFO L290 TraceCheckUtils]: 60: Hoare triple {134981#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134981#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:30,064 INFO L290 TraceCheckUtils]: 61: Hoare triple {134981#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134982#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:30,064 INFO L290 TraceCheckUtils]: 62: Hoare triple {134982#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134982#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:30,065 INFO L290 TraceCheckUtils]: 63: Hoare triple {134982#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134983#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:30,065 INFO L290 TraceCheckUtils]: 64: Hoare triple {134983#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134983#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:30,065 INFO L290 TraceCheckUtils]: 65: Hoare triple {134983#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134984#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:30,065 INFO L290 TraceCheckUtils]: 66: Hoare triple {134984#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134984#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:30,066 INFO L290 TraceCheckUtils]: 67: Hoare triple {134984#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134985#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:30,066 INFO L290 TraceCheckUtils]: 68: Hoare triple {134985#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134985#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:30,066 INFO L290 TraceCheckUtils]: 69: Hoare triple {134985#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134986#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:30,066 INFO L290 TraceCheckUtils]: 70: Hoare triple {134986#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134986#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:30,067 INFO L290 TraceCheckUtils]: 71: Hoare triple {134986#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134987#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:30,067 INFO L290 TraceCheckUtils]: 72: Hoare triple {134987#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134987#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:30,067 INFO L290 TraceCheckUtils]: 73: Hoare triple {134987#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134988#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:30,067 INFO L290 TraceCheckUtils]: 74: Hoare triple {134988#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134988#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:30,068 INFO L290 TraceCheckUtils]: 75: Hoare triple {134988#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134989#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:30,068 INFO L290 TraceCheckUtils]: 76: Hoare triple {134989#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134989#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:30,068 INFO L290 TraceCheckUtils]: 77: Hoare triple {134989#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134990#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:30,069 INFO L290 TraceCheckUtils]: 78: Hoare triple {134990#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134990#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:30,069 INFO L290 TraceCheckUtils]: 79: Hoare triple {134990#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134991#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:30,069 INFO L290 TraceCheckUtils]: 80: Hoare triple {134991#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134991#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:30,069 INFO L290 TraceCheckUtils]: 81: Hoare triple {134991#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134992#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:30,070 INFO L290 TraceCheckUtils]: 82: Hoare triple {134992#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134992#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:30,070 INFO L290 TraceCheckUtils]: 83: Hoare triple {134992#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134993#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:30,070 INFO L290 TraceCheckUtils]: 84: Hoare triple {134993#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134993#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:30,071 INFO L290 TraceCheckUtils]: 85: Hoare triple {134993#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134994#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:30,071 INFO L290 TraceCheckUtils]: 86: Hoare triple {134994#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134994#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:30,071 INFO L290 TraceCheckUtils]: 87: Hoare triple {134994#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134995#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:30,071 INFO L290 TraceCheckUtils]: 88: Hoare triple {134995#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134995#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:30,072 INFO L290 TraceCheckUtils]: 89: Hoare triple {134995#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134996#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:30,072 INFO L290 TraceCheckUtils]: 90: Hoare triple {134996#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134996#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:30,072 INFO L290 TraceCheckUtils]: 91: Hoare triple {134996#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134997#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:30,072 INFO L290 TraceCheckUtils]: 92: Hoare triple {134997#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134997#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:30,073 INFO L290 TraceCheckUtils]: 93: Hoare triple {134997#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134998#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:30,073 INFO L290 TraceCheckUtils]: 94: Hoare triple {134998#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134998#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:30,073 INFO L290 TraceCheckUtils]: 95: Hoare triple {134998#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134999#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:30,073 INFO L290 TraceCheckUtils]: 96: Hoare triple {134999#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134999#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:30,074 INFO L290 TraceCheckUtils]: 97: Hoare triple {134999#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135000#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:30,074 INFO L290 TraceCheckUtils]: 98: Hoare triple {135000#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135000#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:30,074 INFO L290 TraceCheckUtils]: 99: Hoare triple {135000#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135001#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:30,075 INFO L290 TraceCheckUtils]: 100: Hoare triple {135001#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135001#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:30,075 INFO L290 TraceCheckUtils]: 101: Hoare triple {135001#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135002#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:30,075 INFO L290 TraceCheckUtils]: 102: Hoare triple {135002#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135002#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:30,075 INFO L290 TraceCheckUtils]: 103: Hoare triple {135002#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135003#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:30,076 INFO L290 TraceCheckUtils]: 104: Hoare triple {135003#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135003#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:30,076 INFO L290 TraceCheckUtils]: 105: Hoare triple {135003#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135004#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:30,076 INFO L290 TraceCheckUtils]: 106: Hoare triple {135004#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135004#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:30,077 INFO L290 TraceCheckUtils]: 107: Hoare triple {135004#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135005#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:30,077 INFO L290 TraceCheckUtils]: 108: Hoare triple {135005#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135005#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:30,077 INFO L290 TraceCheckUtils]: 109: Hoare triple {135005#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135006#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:30,077 INFO L290 TraceCheckUtils]: 110: Hoare triple {135006#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135006#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:30,078 INFO L290 TraceCheckUtils]: 111: Hoare triple {135006#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135007#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:30,078 INFO L290 TraceCheckUtils]: 112: Hoare triple {135007#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135007#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:30,078 INFO L290 TraceCheckUtils]: 113: Hoare triple {135007#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135008#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:30,078 INFO L290 TraceCheckUtils]: 114: Hoare triple {135008#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135008#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:30,079 INFO L290 TraceCheckUtils]: 115: Hoare triple {135008#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135009#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:30,079 INFO L290 TraceCheckUtils]: 116: Hoare triple {135009#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135009#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:30,079 INFO L290 TraceCheckUtils]: 117: Hoare triple {135009#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135010#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:30,079 INFO L290 TraceCheckUtils]: 118: Hoare triple {135010#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135010#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:30,080 INFO L290 TraceCheckUtils]: 119: Hoare triple {135010#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135011#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:30,080 INFO L290 TraceCheckUtils]: 120: Hoare triple {135011#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135011#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:30,080 INFO L290 TraceCheckUtils]: 121: Hoare triple {135011#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135012#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:30,081 INFO L290 TraceCheckUtils]: 122: Hoare triple {135012#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135012#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:30,081 INFO L290 TraceCheckUtils]: 123: Hoare triple {135012#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135013#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:30,081 INFO L290 TraceCheckUtils]: 124: Hoare triple {135013#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135013#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:30,081 INFO L290 TraceCheckUtils]: 125: Hoare triple {135013#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135014#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:30,082 INFO L290 TraceCheckUtils]: 126: Hoare triple {135014#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135014#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:30,082 INFO L290 TraceCheckUtils]: 127: Hoare triple {135014#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135015#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:30,082 INFO L290 TraceCheckUtils]: 128: Hoare triple {135015#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135015#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:30,083 INFO L290 TraceCheckUtils]: 129: Hoare triple {135015#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135016#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:30,083 INFO L290 TraceCheckUtils]: 130: Hoare triple {135016#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135016#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:30,083 INFO L290 TraceCheckUtils]: 131: Hoare triple {135016#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135017#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:30,083 INFO L290 TraceCheckUtils]: 132: Hoare triple {135017#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135017#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:30,084 INFO L290 TraceCheckUtils]: 133: Hoare triple {135017#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135018#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:30,084 INFO L290 TraceCheckUtils]: 134: Hoare triple {135018#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135018#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:30,084 INFO L290 TraceCheckUtils]: 135: Hoare triple {135018#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135019#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:30,084 INFO L290 TraceCheckUtils]: 136: Hoare triple {135019#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135019#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:30,085 INFO L290 TraceCheckUtils]: 137: Hoare triple {135019#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135020#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:30,085 INFO L290 TraceCheckUtils]: 138: Hoare triple {135020#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135020#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:30,085 INFO L290 TraceCheckUtils]: 139: Hoare triple {135020#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135021#(<= main_~i~0 67)} is VALID [2022-04-15 12:27:30,086 INFO L290 TraceCheckUtils]: 140: Hoare triple {135021#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135021#(<= main_~i~0 67)} is VALID [2022-04-15 12:27:30,086 INFO L290 TraceCheckUtils]: 141: Hoare triple {135021#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135022#(<= main_~i~0 68)} is VALID [2022-04-15 12:27:30,086 INFO L290 TraceCheckUtils]: 142: Hoare triple {135022#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135022#(<= main_~i~0 68)} is VALID [2022-04-15 12:27:30,086 INFO L290 TraceCheckUtils]: 143: Hoare triple {135022#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135023#(<= main_~i~0 69)} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 144: Hoare triple {135023#(<= main_~i~0 69)} assume !(~i~0 < 1024); {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 145: Hoare triple {134950#false} ~i~0 := 0; {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 146: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 147: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 148: Hoare triple {134950#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 149: Hoare triple {134950#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 150: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 151: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 152: Hoare triple {134950#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 153: Hoare triple {134950#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 154: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 155: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 156: Hoare triple {134950#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L272 TraceCheckUtils]: 157: Hoare triple {134950#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 158: Hoare triple {134950#false} ~cond := #in~cond; {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 159: Hoare triple {134950#false} assume 0 == ~cond; {134950#false} is VALID [2022-04-15 12:27:30,087 INFO L290 TraceCheckUtils]: 160: Hoare triple {134950#false} assume !false; {134950#false} is VALID [2022-04-15 12:27:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4771 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:27:30,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:27:30,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858341663] [2022-04-15 12:27:30,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858341663] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:27:30,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172515515] [2022-04-15 12:27:30,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:27:30,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:27:30,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:27:30,089 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:30,090 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:30,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:27:30,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:27:30,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-15 12:27:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:30,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:27:31,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {134949#true} call ULTIMATE.init(); {134949#true} is VALID [2022-04-15 12:27:31,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {134949#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {134949#true} is VALID [2022-04-15 12:27:31,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {134949#true} assume true; {134949#true} is VALID [2022-04-15 12:27:31,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134949#true} {134949#true} #64#return; {134949#true} is VALID [2022-04-15 12:27:31,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {134949#true} call #t~ret6 := main(); {134949#true} is VALID [2022-04-15 12:27:31,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {134949#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {135043#(<= main_~i~0 0)} is VALID [2022-04-15 12:27:31,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {135043#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135043#(<= main_~i~0 0)} is VALID [2022-04-15 12:27:31,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {135043#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134955#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:31,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {134955#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134955#(<= main_~i~0 1)} is VALID [2022-04-15 12:27:31,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {134955#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134956#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:31,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {134956#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134956#(<= main_~i~0 2)} is VALID [2022-04-15 12:27:31,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {134956#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134957#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:31,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {134957#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134957#(<= main_~i~0 3)} is VALID [2022-04-15 12:27:31,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {134957#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134958#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:31,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {134958#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134958#(<= main_~i~0 4)} is VALID [2022-04-15 12:27:31,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {134958#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134959#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:31,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {134959#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134959#(<= main_~i~0 5)} is VALID [2022-04-15 12:27:31,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {134959#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134960#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:31,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {134960#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134960#(<= main_~i~0 6)} is VALID [2022-04-15 12:27:31,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {134960#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134961#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:31,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {134961#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134961#(<= main_~i~0 7)} is VALID [2022-04-15 12:27:31,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {134961#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134962#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:31,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {134962#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134962#(<= main_~i~0 8)} is VALID [2022-04-15 12:27:31,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {134962#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134963#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:31,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {134963#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134963#(<= main_~i~0 9)} is VALID [2022-04-15 12:27:31,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {134963#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134964#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:31,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {134964#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134964#(<= main_~i~0 10)} is VALID [2022-04-15 12:27:31,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {134964#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134965#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:31,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {134965#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134965#(<= main_~i~0 11)} is VALID [2022-04-15 12:27:31,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {134965#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134966#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:31,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {134966#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134966#(<= main_~i~0 12)} is VALID [2022-04-15 12:27:31,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {134966#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134967#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:31,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {134967#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134967#(<= main_~i~0 13)} is VALID [2022-04-15 12:27:31,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {134967#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134968#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:31,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {134968#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134968#(<= main_~i~0 14)} is VALID [2022-04-15 12:27:31,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {134968#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134969#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:31,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {134969#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134969#(<= main_~i~0 15)} is VALID [2022-04-15 12:27:31,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {134969#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134970#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:31,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {134970#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134970#(<= main_~i~0 16)} is VALID [2022-04-15 12:27:31,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {134970#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134971#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:31,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {134971#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134971#(<= main_~i~0 17)} is VALID [2022-04-15 12:27:31,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {134971#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134972#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:31,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {134972#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134972#(<= main_~i~0 18)} is VALID [2022-04-15 12:27:31,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {134972#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134973#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:31,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {134973#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134973#(<= main_~i~0 19)} is VALID [2022-04-15 12:27:31,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {134973#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134974#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:31,374 INFO L290 TraceCheckUtils]: 46: Hoare triple {134974#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134974#(<= main_~i~0 20)} is VALID [2022-04-15 12:27:31,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {134974#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134975#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:31,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {134975#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134975#(<= main_~i~0 21)} is VALID [2022-04-15 12:27:31,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {134975#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134976#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:31,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {134976#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134976#(<= main_~i~0 22)} is VALID [2022-04-15 12:27:31,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {134976#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134977#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:31,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {134977#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134977#(<= main_~i~0 23)} is VALID [2022-04-15 12:27:31,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {134977#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134978#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:31,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {134978#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134978#(<= main_~i~0 24)} is VALID [2022-04-15 12:27:31,376 INFO L290 TraceCheckUtils]: 55: Hoare triple {134978#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134979#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:31,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {134979#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134979#(<= main_~i~0 25)} is VALID [2022-04-15 12:27:31,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {134979#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134980#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:31,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {134980#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134980#(<= main_~i~0 26)} is VALID [2022-04-15 12:27:31,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {134980#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134981#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:31,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {134981#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134981#(<= main_~i~0 27)} is VALID [2022-04-15 12:27:31,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {134981#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134982#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:31,378 INFO L290 TraceCheckUtils]: 62: Hoare triple {134982#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134982#(<= main_~i~0 28)} is VALID [2022-04-15 12:27:31,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {134982#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134983#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:31,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {134983#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134983#(<= main_~i~0 29)} is VALID [2022-04-15 12:27:31,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {134983#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134984#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:31,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {134984#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134984#(<= main_~i~0 30)} is VALID [2022-04-15 12:27:31,380 INFO L290 TraceCheckUtils]: 67: Hoare triple {134984#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134985#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:31,380 INFO L290 TraceCheckUtils]: 68: Hoare triple {134985#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134985#(<= main_~i~0 31)} is VALID [2022-04-15 12:27:31,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {134985#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134986#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:31,381 INFO L290 TraceCheckUtils]: 70: Hoare triple {134986#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134986#(<= main_~i~0 32)} is VALID [2022-04-15 12:27:31,381 INFO L290 TraceCheckUtils]: 71: Hoare triple {134986#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134987#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:31,381 INFO L290 TraceCheckUtils]: 72: Hoare triple {134987#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134987#(<= main_~i~0 33)} is VALID [2022-04-15 12:27:31,381 INFO L290 TraceCheckUtils]: 73: Hoare triple {134987#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134988#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:31,382 INFO L290 TraceCheckUtils]: 74: Hoare triple {134988#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134988#(<= main_~i~0 34)} is VALID [2022-04-15 12:27:31,382 INFO L290 TraceCheckUtils]: 75: Hoare triple {134988#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134989#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:31,382 INFO L290 TraceCheckUtils]: 76: Hoare triple {134989#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134989#(<= main_~i~0 35)} is VALID [2022-04-15 12:27:31,383 INFO L290 TraceCheckUtils]: 77: Hoare triple {134989#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134990#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:31,383 INFO L290 TraceCheckUtils]: 78: Hoare triple {134990#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134990#(<= main_~i~0 36)} is VALID [2022-04-15 12:27:31,383 INFO L290 TraceCheckUtils]: 79: Hoare triple {134990#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134991#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:31,383 INFO L290 TraceCheckUtils]: 80: Hoare triple {134991#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134991#(<= main_~i~0 37)} is VALID [2022-04-15 12:27:31,384 INFO L290 TraceCheckUtils]: 81: Hoare triple {134991#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134992#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:31,384 INFO L290 TraceCheckUtils]: 82: Hoare triple {134992#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134992#(<= main_~i~0 38)} is VALID [2022-04-15 12:27:31,384 INFO L290 TraceCheckUtils]: 83: Hoare triple {134992#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134993#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:31,384 INFO L290 TraceCheckUtils]: 84: Hoare triple {134993#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134993#(<= main_~i~0 39)} is VALID [2022-04-15 12:27:31,385 INFO L290 TraceCheckUtils]: 85: Hoare triple {134993#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134994#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:31,385 INFO L290 TraceCheckUtils]: 86: Hoare triple {134994#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134994#(<= main_~i~0 40)} is VALID [2022-04-15 12:27:31,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {134994#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134995#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:31,386 INFO L290 TraceCheckUtils]: 88: Hoare triple {134995#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134995#(<= main_~i~0 41)} is VALID [2022-04-15 12:27:31,386 INFO L290 TraceCheckUtils]: 89: Hoare triple {134995#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134996#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:31,386 INFO L290 TraceCheckUtils]: 90: Hoare triple {134996#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134996#(<= main_~i~0 42)} is VALID [2022-04-15 12:27:31,386 INFO L290 TraceCheckUtils]: 91: Hoare triple {134996#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134997#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:31,387 INFO L290 TraceCheckUtils]: 92: Hoare triple {134997#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134997#(<= main_~i~0 43)} is VALID [2022-04-15 12:27:31,387 INFO L290 TraceCheckUtils]: 93: Hoare triple {134997#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134998#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:31,387 INFO L290 TraceCheckUtils]: 94: Hoare triple {134998#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134998#(<= main_~i~0 44)} is VALID [2022-04-15 12:27:31,388 INFO L290 TraceCheckUtils]: 95: Hoare triple {134998#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134999#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:31,388 INFO L290 TraceCheckUtils]: 96: Hoare triple {134999#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134999#(<= main_~i~0 45)} is VALID [2022-04-15 12:27:31,388 INFO L290 TraceCheckUtils]: 97: Hoare triple {134999#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135000#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:31,388 INFO L290 TraceCheckUtils]: 98: Hoare triple {135000#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135000#(<= main_~i~0 46)} is VALID [2022-04-15 12:27:31,389 INFO L290 TraceCheckUtils]: 99: Hoare triple {135000#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135001#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:31,389 INFO L290 TraceCheckUtils]: 100: Hoare triple {135001#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135001#(<= main_~i~0 47)} is VALID [2022-04-15 12:27:31,389 INFO L290 TraceCheckUtils]: 101: Hoare triple {135001#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135002#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:31,389 INFO L290 TraceCheckUtils]: 102: Hoare triple {135002#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135002#(<= main_~i~0 48)} is VALID [2022-04-15 12:27:31,390 INFO L290 TraceCheckUtils]: 103: Hoare triple {135002#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135003#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:31,390 INFO L290 TraceCheckUtils]: 104: Hoare triple {135003#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135003#(<= main_~i~0 49)} is VALID [2022-04-15 12:27:31,390 INFO L290 TraceCheckUtils]: 105: Hoare triple {135003#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135004#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:31,391 INFO L290 TraceCheckUtils]: 106: Hoare triple {135004#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135004#(<= main_~i~0 50)} is VALID [2022-04-15 12:27:31,391 INFO L290 TraceCheckUtils]: 107: Hoare triple {135004#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135005#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:31,391 INFO L290 TraceCheckUtils]: 108: Hoare triple {135005#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135005#(<= main_~i~0 51)} is VALID [2022-04-15 12:27:31,391 INFO L290 TraceCheckUtils]: 109: Hoare triple {135005#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135006#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:31,392 INFO L290 TraceCheckUtils]: 110: Hoare triple {135006#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135006#(<= main_~i~0 52)} is VALID [2022-04-15 12:27:31,392 INFO L290 TraceCheckUtils]: 111: Hoare triple {135006#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135007#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:31,392 INFO L290 TraceCheckUtils]: 112: Hoare triple {135007#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135007#(<= main_~i~0 53)} is VALID [2022-04-15 12:27:31,393 INFO L290 TraceCheckUtils]: 113: Hoare triple {135007#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135008#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:31,393 INFO L290 TraceCheckUtils]: 114: Hoare triple {135008#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135008#(<= main_~i~0 54)} is VALID [2022-04-15 12:27:31,393 INFO L290 TraceCheckUtils]: 115: Hoare triple {135008#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135009#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:31,393 INFO L290 TraceCheckUtils]: 116: Hoare triple {135009#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135009#(<= main_~i~0 55)} is VALID [2022-04-15 12:27:31,394 INFO L290 TraceCheckUtils]: 117: Hoare triple {135009#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135010#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:31,394 INFO L290 TraceCheckUtils]: 118: Hoare triple {135010#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135010#(<= main_~i~0 56)} is VALID [2022-04-15 12:27:31,394 INFO L290 TraceCheckUtils]: 119: Hoare triple {135010#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135011#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:31,394 INFO L290 TraceCheckUtils]: 120: Hoare triple {135011#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135011#(<= main_~i~0 57)} is VALID [2022-04-15 12:27:31,395 INFO L290 TraceCheckUtils]: 121: Hoare triple {135011#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135012#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:31,395 INFO L290 TraceCheckUtils]: 122: Hoare triple {135012#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135012#(<= main_~i~0 58)} is VALID [2022-04-15 12:27:31,395 INFO L290 TraceCheckUtils]: 123: Hoare triple {135012#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135013#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:31,396 INFO L290 TraceCheckUtils]: 124: Hoare triple {135013#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135013#(<= main_~i~0 59)} is VALID [2022-04-15 12:27:31,396 INFO L290 TraceCheckUtils]: 125: Hoare triple {135013#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135014#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:31,396 INFO L290 TraceCheckUtils]: 126: Hoare triple {135014#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135014#(<= main_~i~0 60)} is VALID [2022-04-15 12:27:31,396 INFO L290 TraceCheckUtils]: 127: Hoare triple {135014#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135015#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:31,397 INFO L290 TraceCheckUtils]: 128: Hoare triple {135015#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135015#(<= main_~i~0 61)} is VALID [2022-04-15 12:27:31,397 INFO L290 TraceCheckUtils]: 129: Hoare triple {135015#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135016#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:31,397 INFO L290 TraceCheckUtils]: 130: Hoare triple {135016#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135016#(<= main_~i~0 62)} is VALID [2022-04-15 12:27:31,398 INFO L290 TraceCheckUtils]: 131: Hoare triple {135016#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135017#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:31,398 INFO L290 TraceCheckUtils]: 132: Hoare triple {135017#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135017#(<= main_~i~0 63)} is VALID [2022-04-15 12:27:31,398 INFO L290 TraceCheckUtils]: 133: Hoare triple {135017#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135018#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:31,398 INFO L290 TraceCheckUtils]: 134: Hoare triple {135018#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135018#(<= main_~i~0 64)} is VALID [2022-04-15 12:27:31,399 INFO L290 TraceCheckUtils]: 135: Hoare triple {135018#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135019#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:31,399 INFO L290 TraceCheckUtils]: 136: Hoare triple {135019#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135019#(<= main_~i~0 65)} is VALID [2022-04-15 12:27:31,399 INFO L290 TraceCheckUtils]: 137: Hoare triple {135019#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135020#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:31,399 INFO L290 TraceCheckUtils]: 138: Hoare triple {135020#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135020#(<= main_~i~0 66)} is VALID [2022-04-15 12:27:31,400 INFO L290 TraceCheckUtils]: 139: Hoare triple {135020#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135021#(<= main_~i~0 67)} is VALID [2022-04-15 12:27:31,400 INFO L290 TraceCheckUtils]: 140: Hoare triple {135021#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135021#(<= main_~i~0 67)} is VALID [2022-04-15 12:27:31,400 INFO L290 TraceCheckUtils]: 141: Hoare triple {135021#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135022#(<= main_~i~0 68)} is VALID [2022-04-15 12:27:31,401 INFO L290 TraceCheckUtils]: 142: Hoare triple {135022#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135022#(<= main_~i~0 68)} is VALID [2022-04-15 12:27:31,401 INFO L290 TraceCheckUtils]: 143: Hoare triple {135022#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135023#(<= main_~i~0 69)} is VALID [2022-04-15 12:27:31,401 INFO L290 TraceCheckUtils]: 144: Hoare triple {135023#(<= main_~i~0 69)} assume !(~i~0 < 1024); {134950#false} is VALID [2022-04-15 12:27:31,401 INFO L290 TraceCheckUtils]: 145: Hoare triple {134950#false} ~i~0 := 0; {134950#false} is VALID [2022-04-15 12:27:31,401 INFO L290 TraceCheckUtils]: 146: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-15 12:27:31,401 INFO L290 TraceCheckUtils]: 147: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-15 12:27:31,401 INFO L290 TraceCheckUtils]: 148: Hoare triple {134950#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-15 12:27:31,401 INFO L290 TraceCheckUtils]: 149: Hoare triple {134950#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {134950#false} is VALID [2022-04-15 12:27:31,401 INFO L290 TraceCheckUtils]: 150: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-15 12:27:31,402 INFO L290 TraceCheckUtils]: 151: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-15 12:27:31,402 INFO L290 TraceCheckUtils]: 152: Hoare triple {134950#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-15 12:27:31,402 INFO L290 TraceCheckUtils]: 153: Hoare triple {134950#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {134950#false} is VALID [2022-04-15 12:27:31,402 INFO L290 TraceCheckUtils]: 154: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-15 12:27:31,402 INFO L290 TraceCheckUtils]: 155: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-15 12:27:31,402 INFO L290 TraceCheckUtils]: 156: Hoare triple {134950#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-15 12:27:31,402 INFO L272 TraceCheckUtils]: 157: Hoare triple {134950#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {134950#false} is VALID [2022-04-15 12:27:31,402 INFO L290 TraceCheckUtils]: 158: Hoare triple {134950#false} ~cond := #in~cond; {134950#false} is VALID [2022-04-15 12:27:31,402 INFO L290 TraceCheckUtils]: 159: Hoare triple {134950#false} assume 0 == ~cond; {134950#false} is VALID [2022-04-15 12:27:31,402 INFO L290 TraceCheckUtils]: 160: Hoare triple {134950#false} assume !false; {134950#false} is VALID [2022-04-15 12:27:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4771 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:27:31,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:27:36,131 INFO L290 TraceCheckUtils]: 160: Hoare triple {134950#false} assume !false; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 159: Hoare triple {134950#false} assume 0 == ~cond; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 158: Hoare triple {134950#false} ~cond := #in~cond; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L272 TraceCheckUtils]: 157: Hoare triple {134950#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 156: Hoare triple {134950#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 155: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 154: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 153: Hoare triple {134950#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 152: Hoare triple {134950#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 151: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 150: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 149: Hoare triple {134950#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 148: Hoare triple {134950#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 147: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 146: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 145: Hoare triple {134950#false} ~i~0 := 0; {134950#false} is VALID [2022-04-15 12:27:36,132 INFO L290 TraceCheckUtils]: 144: Hoare triple {135557#(< main_~i~0 1024)} assume !(~i~0 < 1024); {134950#false} is VALID [2022-04-15 12:27:36,133 INFO L290 TraceCheckUtils]: 143: Hoare triple {135561#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135557#(< main_~i~0 1024)} is VALID [2022-04-15 12:27:36,133 INFO L290 TraceCheckUtils]: 142: Hoare triple {135561#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135561#(< main_~i~0 1023)} is VALID [2022-04-15 12:27:36,133 INFO L290 TraceCheckUtils]: 141: Hoare triple {135568#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135561#(< main_~i~0 1023)} is VALID [2022-04-15 12:27:36,134 INFO L290 TraceCheckUtils]: 140: Hoare triple {135568#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135568#(< main_~i~0 1022)} is VALID [2022-04-15 12:27:36,134 INFO L290 TraceCheckUtils]: 139: Hoare triple {135575#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135568#(< main_~i~0 1022)} is VALID [2022-04-15 12:27:36,134 INFO L290 TraceCheckUtils]: 138: Hoare triple {135575#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135575#(< main_~i~0 1021)} is VALID [2022-04-15 12:27:36,135 INFO L290 TraceCheckUtils]: 137: Hoare triple {135582#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135575#(< main_~i~0 1021)} is VALID [2022-04-15 12:27:36,135 INFO L290 TraceCheckUtils]: 136: Hoare triple {135582#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135582#(< main_~i~0 1020)} is VALID [2022-04-15 12:27:36,135 INFO L290 TraceCheckUtils]: 135: Hoare triple {135589#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135582#(< main_~i~0 1020)} is VALID [2022-04-15 12:27:36,135 INFO L290 TraceCheckUtils]: 134: Hoare triple {135589#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135589#(< main_~i~0 1019)} is VALID [2022-04-15 12:27:36,136 INFO L290 TraceCheckUtils]: 133: Hoare triple {135596#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135589#(< main_~i~0 1019)} is VALID [2022-04-15 12:27:36,136 INFO L290 TraceCheckUtils]: 132: Hoare triple {135596#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135596#(< main_~i~0 1018)} is VALID [2022-04-15 12:27:36,136 INFO L290 TraceCheckUtils]: 131: Hoare triple {135603#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135596#(< main_~i~0 1018)} is VALID [2022-04-15 12:27:36,137 INFO L290 TraceCheckUtils]: 130: Hoare triple {135603#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135603#(< main_~i~0 1017)} is VALID [2022-04-15 12:27:36,137 INFO L290 TraceCheckUtils]: 129: Hoare triple {135610#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135603#(< main_~i~0 1017)} is VALID [2022-04-15 12:27:36,137 INFO L290 TraceCheckUtils]: 128: Hoare triple {135610#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135610#(< main_~i~0 1016)} is VALID [2022-04-15 12:27:36,137 INFO L290 TraceCheckUtils]: 127: Hoare triple {135617#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135610#(< main_~i~0 1016)} is VALID [2022-04-15 12:27:36,138 INFO L290 TraceCheckUtils]: 126: Hoare triple {135617#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135617#(< main_~i~0 1015)} is VALID [2022-04-15 12:27:36,138 INFO L290 TraceCheckUtils]: 125: Hoare triple {135624#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135617#(< main_~i~0 1015)} is VALID [2022-04-15 12:27:36,138 INFO L290 TraceCheckUtils]: 124: Hoare triple {135624#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135624#(< main_~i~0 1014)} is VALID [2022-04-15 12:27:36,139 INFO L290 TraceCheckUtils]: 123: Hoare triple {135631#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135624#(< main_~i~0 1014)} is VALID [2022-04-15 12:27:36,139 INFO L290 TraceCheckUtils]: 122: Hoare triple {135631#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135631#(< main_~i~0 1013)} is VALID [2022-04-15 12:27:36,139 INFO L290 TraceCheckUtils]: 121: Hoare triple {135638#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135631#(< main_~i~0 1013)} is VALID [2022-04-15 12:27:36,139 INFO L290 TraceCheckUtils]: 120: Hoare triple {135638#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135638#(< main_~i~0 1012)} is VALID [2022-04-15 12:27:36,140 INFO L290 TraceCheckUtils]: 119: Hoare triple {135645#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135638#(< main_~i~0 1012)} is VALID [2022-04-15 12:27:36,140 INFO L290 TraceCheckUtils]: 118: Hoare triple {135645#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135645#(< main_~i~0 1011)} is VALID [2022-04-15 12:27:36,140 INFO L290 TraceCheckUtils]: 117: Hoare triple {135652#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135645#(< main_~i~0 1011)} is VALID [2022-04-15 12:27:36,140 INFO L290 TraceCheckUtils]: 116: Hoare triple {135652#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135652#(< main_~i~0 1010)} is VALID [2022-04-15 12:27:36,141 INFO L290 TraceCheckUtils]: 115: Hoare triple {135659#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135652#(< main_~i~0 1010)} is VALID [2022-04-15 12:27:36,141 INFO L290 TraceCheckUtils]: 114: Hoare triple {135659#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135659#(< main_~i~0 1009)} is VALID [2022-04-15 12:27:36,141 INFO L290 TraceCheckUtils]: 113: Hoare triple {135666#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135659#(< main_~i~0 1009)} is VALID [2022-04-15 12:27:36,142 INFO L290 TraceCheckUtils]: 112: Hoare triple {135666#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135666#(< main_~i~0 1008)} is VALID [2022-04-15 12:27:36,142 INFO L290 TraceCheckUtils]: 111: Hoare triple {135673#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135666#(< main_~i~0 1008)} is VALID [2022-04-15 12:27:36,142 INFO L290 TraceCheckUtils]: 110: Hoare triple {135673#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135673#(< main_~i~0 1007)} is VALID [2022-04-15 12:27:36,142 INFO L290 TraceCheckUtils]: 109: Hoare triple {135680#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135673#(< main_~i~0 1007)} is VALID [2022-04-15 12:27:36,143 INFO L290 TraceCheckUtils]: 108: Hoare triple {135680#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135680#(< main_~i~0 1006)} is VALID [2022-04-15 12:27:36,143 INFO L290 TraceCheckUtils]: 107: Hoare triple {135687#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135680#(< main_~i~0 1006)} is VALID [2022-04-15 12:27:36,143 INFO L290 TraceCheckUtils]: 106: Hoare triple {135687#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135687#(< main_~i~0 1005)} is VALID [2022-04-15 12:27:36,144 INFO L290 TraceCheckUtils]: 105: Hoare triple {135694#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135687#(< main_~i~0 1005)} is VALID [2022-04-15 12:27:36,144 INFO L290 TraceCheckUtils]: 104: Hoare triple {135694#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135694#(< main_~i~0 1004)} is VALID [2022-04-15 12:27:36,144 INFO L290 TraceCheckUtils]: 103: Hoare triple {135701#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135694#(< main_~i~0 1004)} is VALID [2022-04-15 12:27:36,144 INFO L290 TraceCheckUtils]: 102: Hoare triple {135701#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135701#(< main_~i~0 1003)} is VALID [2022-04-15 12:27:36,145 INFO L290 TraceCheckUtils]: 101: Hoare triple {135708#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135701#(< main_~i~0 1003)} is VALID [2022-04-15 12:27:36,145 INFO L290 TraceCheckUtils]: 100: Hoare triple {135708#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135708#(< main_~i~0 1002)} is VALID [2022-04-15 12:27:36,145 INFO L290 TraceCheckUtils]: 99: Hoare triple {135715#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135708#(< main_~i~0 1002)} is VALID [2022-04-15 12:27:36,146 INFO L290 TraceCheckUtils]: 98: Hoare triple {135715#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135715#(< main_~i~0 1001)} is VALID [2022-04-15 12:27:36,146 INFO L290 TraceCheckUtils]: 97: Hoare triple {135722#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135715#(< main_~i~0 1001)} is VALID [2022-04-15 12:27:36,146 INFO L290 TraceCheckUtils]: 96: Hoare triple {135722#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135722#(< main_~i~0 1000)} is VALID [2022-04-15 12:27:36,146 INFO L290 TraceCheckUtils]: 95: Hoare triple {135729#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135722#(< main_~i~0 1000)} is VALID [2022-04-15 12:27:36,147 INFO L290 TraceCheckUtils]: 94: Hoare triple {135729#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135729#(< main_~i~0 999)} is VALID [2022-04-15 12:27:36,147 INFO L290 TraceCheckUtils]: 93: Hoare triple {135736#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135729#(< main_~i~0 999)} is VALID [2022-04-15 12:27:36,147 INFO L290 TraceCheckUtils]: 92: Hoare triple {135736#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135736#(< main_~i~0 998)} is VALID [2022-04-15 12:27:36,148 INFO L290 TraceCheckUtils]: 91: Hoare triple {135743#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135736#(< main_~i~0 998)} is VALID [2022-04-15 12:27:36,148 INFO L290 TraceCheckUtils]: 90: Hoare triple {135743#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135743#(< main_~i~0 997)} is VALID [2022-04-15 12:27:36,148 INFO L290 TraceCheckUtils]: 89: Hoare triple {135750#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135743#(< main_~i~0 997)} is VALID [2022-04-15 12:27:36,148 INFO L290 TraceCheckUtils]: 88: Hoare triple {135750#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135750#(< main_~i~0 996)} is VALID [2022-04-15 12:27:36,149 INFO L290 TraceCheckUtils]: 87: Hoare triple {135757#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135750#(< main_~i~0 996)} is VALID [2022-04-15 12:27:36,149 INFO L290 TraceCheckUtils]: 86: Hoare triple {135757#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135757#(< main_~i~0 995)} is VALID [2022-04-15 12:27:36,149 INFO L290 TraceCheckUtils]: 85: Hoare triple {135764#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135757#(< main_~i~0 995)} is VALID [2022-04-15 12:27:36,149 INFO L290 TraceCheckUtils]: 84: Hoare triple {135764#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135764#(< main_~i~0 994)} is VALID [2022-04-15 12:27:36,150 INFO L290 TraceCheckUtils]: 83: Hoare triple {135771#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135764#(< main_~i~0 994)} is VALID [2022-04-15 12:27:36,150 INFO L290 TraceCheckUtils]: 82: Hoare triple {135771#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135771#(< main_~i~0 993)} is VALID [2022-04-15 12:27:36,150 INFO L290 TraceCheckUtils]: 81: Hoare triple {135778#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135771#(< main_~i~0 993)} is VALID [2022-04-15 12:27:36,151 INFO L290 TraceCheckUtils]: 80: Hoare triple {135778#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135778#(< main_~i~0 992)} is VALID [2022-04-15 12:27:36,151 INFO L290 TraceCheckUtils]: 79: Hoare triple {135785#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135778#(< main_~i~0 992)} is VALID [2022-04-15 12:27:36,151 INFO L290 TraceCheckUtils]: 78: Hoare triple {135785#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135785#(< main_~i~0 991)} is VALID [2022-04-15 12:27:36,151 INFO L290 TraceCheckUtils]: 77: Hoare triple {135792#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135785#(< main_~i~0 991)} is VALID [2022-04-15 12:27:36,152 INFO L290 TraceCheckUtils]: 76: Hoare triple {135792#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135792#(< main_~i~0 990)} is VALID [2022-04-15 12:27:36,152 INFO L290 TraceCheckUtils]: 75: Hoare triple {135799#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135792#(< main_~i~0 990)} is VALID [2022-04-15 12:27:36,152 INFO L290 TraceCheckUtils]: 74: Hoare triple {135799#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135799#(< main_~i~0 989)} is VALID [2022-04-15 12:27:36,153 INFO L290 TraceCheckUtils]: 73: Hoare triple {135806#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135799#(< main_~i~0 989)} is VALID [2022-04-15 12:27:36,153 INFO L290 TraceCheckUtils]: 72: Hoare triple {135806#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135806#(< main_~i~0 988)} is VALID [2022-04-15 12:27:36,153 INFO L290 TraceCheckUtils]: 71: Hoare triple {135813#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135806#(< main_~i~0 988)} is VALID [2022-04-15 12:27:36,153 INFO L290 TraceCheckUtils]: 70: Hoare triple {135813#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135813#(< main_~i~0 987)} is VALID [2022-04-15 12:27:36,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {135820#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135813#(< main_~i~0 987)} is VALID [2022-04-15 12:27:36,154 INFO L290 TraceCheckUtils]: 68: Hoare triple {135820#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135820#(< main_~i~0 986)} is VALID [2022-04-15 12:27:36,154 INFO L290 TraceCheckUtils]: 67: Hoare triple {135827#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135820#(< main_~i~0 986)} is VALID [2022-04-15 12:27:36,154 INFO L290 TraceCheckUtils]: 66: Hoare triple {135827#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135827#(< main_~i~0 985)} is VALID [2022-04-15 12:27:36,155 INFO L290 TraceCheckUtils]: 65: Hoare triple {135834#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135827#(< main_~i~0 985)} is VALID [2022-04-15 12:27:36,155 INFO L290 TraceCheckUtils]: 64: Hoare triple {135834#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135834#(< main_~i~0 984)} is VALID [2022-04-15 12:27:36,155 INFO L290 TraceCheckUtils]: 63: Hoare triple {135841#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135834#(< main_~i~0 984)} is VALID [2022-04-15 12:27:36,156 INFO L290 TraceCheckUtils]: 62: Hoare triple {135841#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135841#(< main_~i~0 983)} is VALID [2022-04-15 12:27:36,156 INFO L290 TraceCheckUtils]: 61: Hoare triple {135848#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135841#(< main_~i~0 983)} is VALID [2022-04-15 12:27:36,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {135848#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135848#(< main_~i~0 982)} is VALID [2022-04-15 12:27:36,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {135855#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135848#(< main_~i~0 982)} is VALID [2022-04-15 12:27:36,157 INFO L290 TraceCheckUtils]: 58: Hoare triple {135855#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135855#(< main_~i~0 981)} is VALID [2022-04-15 12:27:36,157 INFO L290 TraceCheckUtils]: 57: Hoare triple {135862#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135855#(< main_~i~0 981)} is VALID [2022-04-15 12:27:36,157 INFO L290 TraceCheckUtils]: 56: Hoare triple {135862#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135862#(< main_~i~0 980)} is VALID [2022-04-15 12:27:36,158 INFO L290 TraceCheckUtils]: 55: Hoare triple {135869#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135862#(< main_~i~0 980)} is VALID [2022-04-15 12:27:36,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {135869#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135869#(< main_~i~0 979)} is VALID [2022-04-15 12:27:36,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {135876#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135869#(< main_~i~0 979)} is VALID [2022-04-15 12:27:36,158 INFO L290 TraceCheckUtils]: 52: Hoare triple {135876#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135876#(< main_~i~0 978)} is VALID [2022-04-15 12:27:36,159 INFO L290 TraceCheckUtils]: 51: Hoare triple {135883#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135876#(< main_~i~0 978)} is VALID [2022-04-15 12:27:36,159 INFO L290 TraceCheckUtils]: 50: Hoare triple {135883#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135883#(< main_~i~0 977)} is VALID [2022-04-15 12:27:36,159 INFO L290 TraceCheckUtils]: 49: Hoare triple {135890#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135883#(< main_~i~0 977)} is VALID [2022-04-15 12:27:36,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {135890#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135890#(< main_~i~0 976)} is VALID [2022-04-15 12:27:36,160 INFO L290 TraceCheckUtils]: 47: Hoare triple {135897#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135890#(< main_~i~0 976)} is VALID [2022-04-15 12:27:36,160 INFO L290 TraceCheckUtils]: 46: Hoare triple {135897#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135897#(< main_~i~0 975)} is VALID [2022-04-15 12:27:36,160 INFO L290 TraceCheckUtils]: 45: Hoare triple {135904#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135897#(< main_~i~0 975)} is VALID [2022-04-15 12:27:36,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {135904#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135904#(< main_~i~0 974)} is VALID [2022-04-15 12:27:36,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {135911#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135904#(< main_~i~0 974)} is VALID [2022-04-15 12:27:36,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {135911#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135911#(< main_~i~0 973)} is VALID [2022-04-15 12:27:36,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {135918#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135911#(< main_~i~0 973)} is VALID [2022-04-15 12:27:36,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {135918#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135918#(< main_~i~0 972)} is VALID [2022-04-15 12:27:36,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {135925#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135918#(< main_~i~0 972)} is VALID [2022-04-15 12:27:36,162 INFO L290 TraceCheckUtils]: 38: Hoare triple {135925#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135925#(< main_~i~0 971)} is VALID [2022-04-15 12:27:36,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {135932#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135925#(< main_~i~0 971)} is VALID [2022-04-15 12:27:36,163 INFO L290 TraceCheckUtils]: 36: Hoare triple {135932#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135932#(< main_~i~0 970)} is VALID [2022-04-15 12:27:36,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {135939#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135932#(< main_~i~0 970)} is VALID [2022-04-15 12:27:36,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {135939#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135939#(< main_~i~0 969)} is VALID [2022-04-15 12:27:36,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {135946#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135939#(< main_~i~0 969)} is VALID [2022-04-15 12:27:36,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {135946#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135946#(< main_~i~0 968)} is VALID [2022-04-15 12:27:36,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {135953#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135946#(< main_~i~0 968)} is VALID [2022-04-15 12:27:36,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {135953#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135953#(< main_~i~0 967)} is VALID [2022-04-15 12:27:36,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {135960#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135953#(< main_~i~0 967)} is VALID [2022-04-15 12:27:36,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {135960#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135960#(< main_~i~0 966)} is VALID [2022-04-15 12:27:36,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {135967#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135960#(< main_~i~0 966)} is VALID [2022-04-15 12:27:36,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {135967#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135967#(< main_~i~0 965)} is VALID [2022-04-15 12:27:36,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {135974#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135967#(< main_~i~0 965)} is VALID [2022-04-15 12:27:36,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {135974#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135974#(< main_~i~0 964)} is VALID [2022-04-15 12:27:36,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {135981#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135974#(< main_~i~0 964)} is VALID [2022-04-15 12:27:36,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {135981#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135981#(< main_~i~0 963)} is VALID [2022-04-15 12:27:36,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {135988#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135981#(< main_~i~0 963)} is VALID [2022-04-15 12:27:36,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {135988#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135988#(< main_~i~0 962)} is VALID [2022-04-15 12:27:36,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {135995#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135988#(< main_~i~0 962)} is VALID [2022-04-15 12:27:36,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {135995#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135995#(< main_~i~0 961)} is VALID [2022-04-15 12:27:36,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {136002#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135995#(< main_~i~0 961)} is VALID [2022-04-15 12:27:36,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {136002#(< main_~i~0 960)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {136002#(< main_~i~0 960)} is VALID [2022-04-15 12:27:36,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {136009#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {136002#(< main_~i~0 960)} is VALID [2022-04-15 12:27:36,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {136009#(< main_~i~0 959)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {136009#(< main_~i~0 959)} is VALID [2022-04-15 12:27:36,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {136016#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {136009#(< main_~i~0 959)} is VALID [2022-04-15 12:27:36,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {136016#(< main_~i~0 958)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {136016#(< main_~i~0 958)} is VALID [2022-04-15 12:27:36,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {136023#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {136016#(< main_~i~0 958)} is VALID [2022-04-15 12:27:36,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {136023#(< main_~i~0 957)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {136023#(< main_~i~0 957)} is VALID [2022-04-15 12:27:36,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {136030#(< main_~i~0 956)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {136023#(< main_~i~0 957)} is VALID [2022-04-15 12:27:36,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {136030#(< main_~i~0 956)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {136030#(< main_~i~0 956)} is VALID [2022-04-15 12:27:36,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {136037#(< main_~i~0 955)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {136030#(< main_~i~0 956)} is VALID [2022-04-15 12:27:36,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {136037#(< main_~i~0 955)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {136037#(< main_~i~0 955)} is VALID [2022-04-15 12:27:36,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {134949#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {136037#(< main_~i~0 955)} is VALID [2022-04-15 12:27:36,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {134949#true} call #t~ret6 := main(); {134949#true} is VALID [2022-04-15 12:27:36,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134949#true} {134949#true} #64#return; {134949#true} is VALID [2022-04-15 12:27:36,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {134949#true} assume true; {134949#true} is VALID [2022-04-15 12:27:36,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {134949#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2); {134949#true} is VALID [2022-04-15 12:27:36,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {134949#true} call ULTIMATE.init(); {134949#true} is VALID [2022-04-15 12:27:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4771 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:27:36,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172515515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:27:36,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:27:36,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 72, 72] total 144 [2022-04-15 12:27:36,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:27:36,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1081633263] [2022-04-15 12:27:36,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1081633263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:36,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:36,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-04-15 12:27:36,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618748491] [2022-04-15 12:27:36,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:27:36,174 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 72 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-04-15 12:27:36,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:27:36,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 73 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 72 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:36,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:36,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-04-15 12:27:36,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:36,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-04-15 12:27:36,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10155, Invalid=10437, Unknown=0, NotChecked=0, Total=20592 [2022-04-15 12:27:36,265 INFO L87 Difference]: Start difference. First operand 162 states and 166 transitions. Second operand has 73 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 72 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:57,267 INFO L93 Difference]: Finished difference Result 523 states and 667 transitions. [2022-04-15 12:27:57,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-04-15 12:27:57,267 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 72 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-04-15 12:27:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:27:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 72 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 658 transitions. [2022-04-15 12:27:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 72 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 658 transitions. [2022-04-15 12:27:57,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 658 transitions. [2022-04-15 12:27:57,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 658 edges. 658 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:57,716 INFO L225 Difference]: With dead ends: 523 [2022-04-15 12:27:57,716 INFO L226 Difference]: Without dead ends: 506 [2022-04-15 12:27:57,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2828 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=20166, Invalid=25416, Unknown=0, NotChecked=0, Total=45582 [2022-04-15 12:27:57,718 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 2094 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2094 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:27:57,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2094 Valid, 32 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:27:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-04-15 12:27:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 164. [2022-04-15 12:27:58,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:27:58,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 506 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:58,914 INFO L74 IsIncluded]: Start isIncluded. First operand 506 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:58,914 INFO L87 Difference]: Start difference. First operand 506 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:58,922 INFO L93 Difference]: Finished difference Result 506 states and 646 transitions. [2022-04-15 12:27:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 646 transitions. [2022-04-15 12:27:58,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:58,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:58,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 506 states. [2022-04-15 12:27:58,923 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 506 states. [2022-04-15 12:27:58,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:58,932 INFO L93 Difference]: Finished difference Result 506 states and 646 transitions. [2022-04-15 12:27:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 646 transitions. [2022-04-15 12:27:58,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:58,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:58,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:27:58,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:27:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2022-04-15 12:27:58,934 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 161 [2022-04-15 12:27:58,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:27:58,934 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2022-04-15 12:27:58,934 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 72 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:58,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 168 transitions. [2022-04-15 12:27:59,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:59,448 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-04-15 12:27:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-15 12:27:59,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:59,449 INFO L499 BasicCegarLoop]: trace histogram [70, 70, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:59,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-04-15 12:27:59,649 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:27:59,650 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1746702065, now seen corresponding path program 141 times [2022-04-15 12:27:59,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:59,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [126108997] [2022-04-15 12:27:59,654 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:27:59,654 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:27:59,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1746702065, now seen corresponding path program 142 times [2022-04-15 12:27:59,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:59,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106185547] [2022-04-15 12:27:59,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:59,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat